Zoe Chatzidakis (ed.)Lecture Notes in Logic 27
Logic Colloquium '02
Lecture Notes in Logic 27
Herausgeber: Chatzidakis, Zoé; Pohlers, Wolfram; Koepke, Peter
Zoe Chatzidakis (ed.)Lecture Notes in Logic 27
Logic Colloquium '02
Lecture Notes in Logic 27
Herausgeber: Chatzidakis, Zoé; Pohlers, Wolfram; Koepke, Peter
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Logic Colloquium '02 includes articles from some of the world's preeminent logicians
Andere Kunden interessierten sich auch für
Vincent Von Oostrom (ed.)Logic Colloquium '9962,99 €
Logic Colloquium 200744,99 €
The Young Mathematician's Logic14,99 €
Augustus De MorganFormal Logic (1847)25,99 €
L. BrouwerStudies in Logic and the Foundations of Mathematics - The Axiomatic Method with Special Reference to Geometry and Physics40,99 €
Boyd Henry BodeAn Outline of Logic22,99 €
American Mathematical SocietyThe Princeton Colloquium17,99 €-
-
-
Logic Colloquium '02 includes articles from some of the world's preeminent logicians
Produktdetails
- Produktdetails
- Verlag: A K Peters/CRC Press
- Seitenzahl: 376
- Erscheinungstermin: 13. Juli 2006
- Englisch
- Abmessung: 229mm x 152mm x 20mm
- Gewicht: 544g
- ISBN-13: 9781568813011
- ISBN-10: 1568813015
- Artikelnr.: 32440347
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
- Verlag: A K Peters/CRC Press
- Seitenzahl: 376
- Erscheinungstermin: 13. Juli 2006
- Englisch
- Abmessung: 229mm x 152mm x 20mm
- Gewicht: 544g
- ISBN-13: 9781568813011
- ISBN-10: 1568813015
- Artikelnr.: 32440347
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
Zoe Chatzidakis Department of Mathematics University of Paris 7 Peter Koepke Mathematical Institute University of Bonn Wolfram Pohlers Institute for Mathematical Logic and Foundational Research University of Munster
Preface
Participants Photograph
Generic absoluteness for ?? formulas and the continuum problem
Axioms of generic absoluteness
Generalised dynamic ordinals - universal measures for implicit computational complexity
The Worm principle
"One is a lonely number": logic and communication
Computable versions of the uniform boundedness theorem
Symmetry of the universal computable function: A study of its automorphisms
homomorphisms and isomorphic embeddings
PCF theory and Woodin cardinals
Embedding finite lattices into the computably enumerable degrees - a status survey
Dimension theory inside a homogeneous model
Reals which compute little
Bisimulation invariance and finite models
Choice principles in constructive and classical set theories
Ash's theorem for abstract structures
Martin-Lof random and PA-complete sets
Learning and computing in the limit
Participants Photograph
Generic absoluteness for ?? formulas and the continuum problem
Axioms of generic absoluteness
Generalised dynamic ordinals - universal measures for implicit computational complexity
The Worm principle
"One is a lonely number": logic and communication
Computable versions of the uniform boundedness theorem
Symmetry of the universal computable function: A study of its automorphisms
homomorphisms and isomorphic embeddings
PCF theory and Woodin cardinals
Embedding finite lattices into the computably enumerable degrees - a status survey
Dimension theory inside a homogeneous model
Reals which compute little
Bisimulation invariance and finite models
Choice principles in constructive and classical set theories
Ash's theorem for abstract structures
Martin-Lof random and PA-complete sets
Learning and computing in the limit
Preface
Participants Photograph
Generic absoluteness for ?? formulas and the continuum problem
Axioms of generic absoluteness
Generalised dynamic ordinals - universal measures for implicit computational complexity
The Worm principle
"One is a lonely number": logic and communication
Computable versions of the uniform boundedness theorem
Symmetry of the universal computable function: A study of its automorphisms
homomorphisms and isomorphic embeddings
PCF theory and Woodin cardinals
Embedding finite lattices into the computably enumerable degrees - a status survey
Dimension theory inside a homogeneous model
Reals which compute little
Bisimulation invariance and finite models
Choice principles in constructive and classical set theories
Ash's theorem for abstract structures
Martin-Lof random and PA-complete sets
Learning and computing in the limit
Participants Photograph
Generic absoluteness for ?? formulas and the continuum problem
Axioms of generic absoluteness
Generalised dynamic ordinals - universal measures for implicit computational complexity
The Worm principle
"One is a lonely number": logic and communication
Computable versions of the uniform boundedness theorem
Symmetry of the universal computable function: A study of its automorphisms
homomorphisms and isomorphic embeddings
PCF theory and Woodin cardinals
Embedding finite lattices into the computably enumerable degrees - a status survey
Dimension theory inside a homogeneous model
Reals which compute little
Bisimulation invariance and finite models
Choice principles in constructive and classical set theories
Ash's theorem for abstract structures
Martin-Lof random and PA-complete sets
Learning and computing in the limit







