000 | 03381nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-39119-7 | ||
003 | DE-He213 | ||
005 | 20190213151508.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1984 gw | s |||| 0|eng d | ||
020 |
_a9783540391197 _9978-3-540-39119-7 |
||
024 | 7 |
_a10.1007/BFb0099476 _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 |
_aComputation and Proof Theory _h[electronic resource] : _bProceedings of the Logic Colloquium held in Aachen, July 18–23, 1983 Part II / _cedited by Egon Börger, Walter Oberschelp, Michael M. Richter, Brigitta Schinzel, Wolfgang Thomas. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1984. |
|
300 |
_aX, 482 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 ; _v1104 |
|
505 | 0 | _aContiguous R.E. Degrees -- Abstract construction of counterexamples in recursive graph theory -- Minimal degrees and 1-generic sets below 0? -- Undecidability and recursive equivalence II -- Logical syntax and computational complexity -- Subrecursive hierarchies via direct limits -- A star-finite relational semantics for parallel programs -- Between constructive and classical mathematics -- Partial closures and semantics of while: Towards an iteration-based theory of data types -- Toward logic tailored for computational complexity -- On a new notion of partial conservativity -- Finitely approximable sets -- A unified approach to constructive and recursive analysis -- On faithful interpretability -- Abstract recursion as a foundation for the theory of algorithms -- Some logical problems connected with a modular decomposition theory of automata -- Diophantine equations in a fragment of number theory -- Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ?, ?, ?, ?, ? -- On subsets of the Skolem class of exponential polynomials -- Effective operators in a topological setting -- An axiomatization of the apartness fragment of the theory DLO+ of dense linear order. | |
650 | 0 | _aLogic, Symbolic and mathematical. | |
650 | 1 | 4 |
_aMathematical Logic and Foundations. _0http://scigraph.springernature.com/things/product-market-codes/M24005 |
700 | 1 |
_aBörger, Egon. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aOberschelp, Walter. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRichter, Michael M. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSchinzel, Brigitta. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aThomas, Wolfgang. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662205327 |
776 | 0 | 8 |
_iPrinted edition: _z9783540139010 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1104 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0099476 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c10876 _d10876 |