000 | 02972nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-47642-9 | ||
003 | DE-He213 | ||
005 | 20160624102025.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1993 gw | s |||| 0|eng d | ||
020 |
_a9783540476429 _9978-3-540-47642-9 |
||
024 | 7 |
_a10.1007/3-540-56734-8 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTJ210.2-211.495 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aTJFM1 _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
082 | 0 | 4 |
_a006.3 _223 |
100 | 1 |
_aWansing, Heinrich. _eauthor. |
|
245 | 1 | 4 |
_aThe Logic of Information Structures _h[electronic resource] / _cby Heinrich Wansing. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1993. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1993. |
|
300 |
_aCLXXX, 168 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, _x0302-9743 ; _v681 |
|
505 | 0 | _aGeneralizations -- Intuitionistic minimal and intuitionistic information processing -- Functional completeness for substructural subsystems of IPL -- Formulas-as-types for substructural subsystems of IPL -- Constructive minimal and constructive information processing -- Functional completeness for substructural subsystems of N -- The constructive typed ?-calculus ?c and formulas-as-types for N? -- Monoid models and the informational interpretation of substructural propositional logics. | |
520 | _aThis monograph gives a logical treatment of two central aspects of the concept of information, namely information processing and information structure. The structure of information is treated as a topic in model theory, while information processing is seen as an aspect of proof theory. A wide spectrum of substructural subsystems of intuitionistic propositional logic and of Nelson's constructive logic with strong negation is investigated. In particular, the problems of cut-elimination, functional completeness, and coding of proofs with lambda-terms are handled. Finally, an interpretation of these systems in terms of states of information and operations over these states is presented. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aLogic, Symbolic and mathematical. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aMathematical Logic and Foundations. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540567349 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, _x0302-9743 ; _v681 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-56734-8 |
942 |
_2EBK6140 _cEBK |
||
999 |
_c35434 _d35434 |