000 | 03105nam a22004935i 4500 | ||
---|---|---|---|
001 | 978-3-540-36884-7 | ||
003 | DE-He213 | ||
005 | 20190213151515.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1973 gw | s |||| 0|eng d | ||
020 |
_a9783540368847 _9978-3-540-36884-7 |
||
024 | 7 |
_a10.1007/BFb0066770 _2doi |
|
050 | 4 | _aQA8.9-10.3 | |
072 | 7 |
_aPBC _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aPBC _2thema |
|
072 | 7 |
_aPBCD _2thema |
|
082 | 0 | 4 |
_a511.3 _223 |
245 | 1 | 0 |
_aCambridge Summer School in Mathematical Logic _h[electronic resource] : _bHeld in Cambridge/England, August 1–21, 1971 / _cedited by A. R. D. Mathias, H. Rogers. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1973. |
|
300 |
_aXII, 664 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 Mathematics, _x0075-8434 ; _v337 |
|
505 | 0 | _aLectures on intuitionism -- Realizability: A retrospective survey -- Some applications of Kleene's methods for intuitionistic systems -- Notes on intuitionistic second order arithmetic -- Some properties of intuitionistic zermelo-frankel set theory -- Ouelques Resultats sur les Interpretations Fonctionnelles -- Combinator realizability of constructive finite type analysis -- The arithmetic theory of constructions -- The priority method for the construction of recursively enumerable sets -- Admissible ordinals and priority arguments -- Abstract computability versus analog-generability (a survey) -- Infinitary combinatorics -- The maximum sum of a family of ordinals -- Effective implications between the "finite" choice axioms -- On descendingly complete ultrafilters -- XVI. A model for the negation of the axiom of choice -- Filters closed under MAHLO's and GAIFMAN's operation -- On chromatic number of graphs and set systems -- Countable models of set theories -- Errata -- Descriptive set theory in -- Modal model theory -- A preservation theorem for interpretations -- Vaught sentences and Lindström's regular relations. | |
650 | 0 | _aLogic, Symbolic and mathematical. | |
650 | 0 | _aComputer science. | |
650 | 1 | 4 |
_aMathematical Logic and Foundations. _0http://scigraph.springernature.com/things/product-market-codes/M24005 |
650 | 2 | 4 |
_aMathematical Logic and Formal Languages. _0http://scigraph.springernature.com/things/product-market-codes/I16048 |
700 | 1 |
_aMathias, A. R. D. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRogers, H. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662201343 |
776 | 0 | 8 |
_iPrinted edition: _z9783540055693 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v337 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0066770 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c10908 _d10908 |