Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 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-Löf random and PA-complete sets
- Learning and computing in the limit
- References
Choice principles in constructive and classical set theories
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 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-Löf random and PA-complete sets
- Learning and computing in the limit
- References
- Type
- Chapter
- Information
- Logic Colloquium '02 , pp. 299 - 326Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , The type theoretic interpretation of constructive set theory Logic Colloquium '77 (A. MacIntyre, L. Pacholski, and J Paris, editors), North-Holland, Amsterdam, 1978, pp. 55–66.
[2] , The type theoretic interpretation of constructive set theory: choice principles The L. E. J. Brouwer Centenary Symposium ( and , editors), North-Holland, Amsterdam, 1982, pp. 1–40.
[3] , The type theoretic interpretation of constructive set theory: inductive definitions Logic, Methodology and Philosophy of Science, VII ( et al., editors), North-Holland, Amsterdam, 1986, pp. 17–49.
[4] and , Notes on constructive set theory, Technical Report 40, Institut Mittag-Leffler, The Royal Swedish Academy of Sciences, 2001, http://www.ml.kva.se/preprints/archive2000-2001.php.
[5] , Admissible Sets and Structures, Springer-Verlag, Berlin, 1975.
[6] , Continuity in intuitionistic set theories Logic Colloquium '78 (M Boffa, D. van Dalen, and K. McAloon, editors), North-Holland, Amsterdam, 1979, pp. 1–52.
[7] and , Constructive Analysis, Springer-Verlag, Berlin, 1985.
[8] , Injectivity, projectivity, and the axiom of choice Transactions of the American Mathematical Society, vol. 255 (1979), pp. 31–59.
[9] ,Œuvres de Émil Borel, Centre National de la recherche Scientifique, Paris, 1972.
[10] , Axiom of choice and complementation Proceedings of the American Mathematical Society, vol. 51 (1975), pp. 176–178.
[11] and , The core model Annals of Mathematical Logic, vol. 20 (1981), no. 1, pp. 43–75.
[12] , Set theoretic foundations for constructive analysis Annals of Mathematics. Second Series, vol. 105 (1977), no. 1, pp. 1–28.
[13] and , The lack of definable witnesses and provably recursive functions in intuitionistic set theories Advances in Mathematics, vol. 57 (1985), no. 1, pp. 1–13.
[14] , Types and Sets: A Study on the Jump to Full Impredicativity, Laurea Dissertation, Department of Pure and Applied Mathematics, University of Padua, 1999.
[15] , Heyting-Valued Interpretations for Constructive SetTheory, Department of Computer Science, Manchester University, 2002.
[16] , All uncountable cardinals can be singular Israel Journal of Mathematics, vol. 35 (1980), no. 1-2, pp. 61–88.
[17] and , Consequences of the Axiom of Choice, Mathematical Surveys and Monographs, vol. 59, American Mathematical Society, Providence, 1998.Google Scholar
[18] , The Axiom of Choice, North-Holland, Amsterdam, 1973.
[19] , Independence of the axiom of dependent choices from the countable axiom of choice (abstract) The Journal of Symbolic Logic, vol. 31 (1966), p. 294.
[20] , From the axiom of choice to choice sequences Nordic Journal of Philosophical Logic, vol. 1 (1996), no. 1, pp. 95–98.
[21] , An intuitionistic theory of types: predicative part Logic Colloquium '73 ( and , editors), North-Holland, Amsterdam, 1975, pp. 73–118.
[22] , Intuitionistic Type Theory, Bibliopolis, Naples, 1984.
[23] , Realizability and Recursive Mathematics, Ph.D. thesis, Oxford University, 1984.
[24] and , Type theories, toposes and constructive set theory: predicative aspects of AST Annals of Pure and Applied Logic, vol. 114 (2002), no. 1-3, pp. 155–201.
[25] , Power set recursion Annals of Pure and Applied Logic, vol. 71 (1995), no. 3, pp. 247–306.
[26] , Constructive set theory The Journal of Symbolic Logic, vol. 40 (1975), no. 3, pp. 347–382.
[27] , Fragments of Kripke-Platek set theory with infinity Proof Theory (, , and , editors), Cambridge University Press, Cambridge, 1992, pp. 251– 273.
[28] , The Strength of Some Martin-Lof Type Theories, Department of Mathematics, preprint, Ohio State University, 1993.
[29] , The realm of ordinal analysis Sets and Proofs ( and , editors), Cambridge University Press, Cambridge, 1999, pp. 219–279.
[30] , The disjunction and other properties for constructive Zermelo-Fraenkel set theory The Journal of Symbolic Logic, vol. 70 (December 2005), no. 4, pp. 1233–1254.
[31] , The disjunction and other properties for constructive Zermelo-Fraenkel set theory with choice principles, in preparation.
[32] , The formulae-as-classes interpretation of constructive set theory Proof Technology and Computation, IOS Press, Amsterdam, Proceedings of the International Summer School Marktoberdorf 2003, to appear.
[33] and , On the regular extension axiom and its variants Mathematical Logic Quarterly, vol. 49 (2003), no. 5, pp. 511–518.
[34] and , Characterizing the interpretation of set theory in Martin-Löf type theory, to appear in Annals of Pure and Applied Logic.
[35] and , Proof-theoretic investigations on Kruskal's theorem Annals of Pure and Applied Logic, vol. 60 (1993), no. 1, pp. 49–88.
[36] and , Constructivism in Mathematics. Vol. I, II, North-Holland, Amsterdam, 1988.
- 5
- Cited by