Book contents
- Frontmatter
- Preface
- Contents
- PART I PROOF THEORETIC ANALYSIS
- PART II LOGIC AND COMPUTATION
- PART III APPLICATIVE AND SELF-APPLICATIVE THEORIES
- On extensionality, uniformity and comprehension in the theories of operations and classes
- The proof-theoretic analysis of the Suslin operator in applicative theories
- Feferman-Landin Logic
- Explicit mathematics with monotone inductive definitions: A survey
- PART IV PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT
- Symposium program
- References
On extensionality, uniformity and comprehension in the theories of operations and classes
from PART III - APPLICATIVE AND SELF-APPLICATIVE THEORIES
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Contents
- PART I PROOF THEORETIC ANALYSIS
- PART II LOGIC AND COMPUTATION
- PART III APPLICATIVE AND SELF-APPLICATIVE THEORIES
- On extensionality, uniformity and comprehension in the theories of operations and classes
- The proof-theoretic analysis of the Suslin operator in applicative theories
- Feferman-Landin Logic
- Explicit mathematics with monotone inductive definitions: A survey
- PART IV PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT
- Symposium program
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Reflections on the Foundations of MathematicsEssays in Honor of Solomon Feferman, pp. 251 - 269Publisher: Cambridge University PressPrint publication year: 2002
References
[1] , Foundations of constructive mathematics, Springer, Berlin, 1985.
[2] , Towards a computation system based on set theory, Theoretical Computer Science, vol. 60 (1988), pp. 297-340.Google Scholar
[3] , , and (editors), Logic colloquium 78, Amsterdam, North Holland, 1979.
[4] , Logical frameworks for truth and abstraction, North Holland, Amsterdam, 1996.
[5] , Relating Quine's NF to Feferman's EM, Studia Logica, vol. 62 (1999), pp. 141-162.Google Scholar
[6] and , Uniform inseparability in explicit mathematics, The Journal of Symbolic Logic, vol. 64 (1999), pp. 313-326.Google Scholar
[7] , On the consistency of an impredicative subsystem of Quine's NF, The Journal of Symbolic Logic, vol. 47 (1982), pp. 131-136.Google Scholar
[8] (editor), Algebra and logic, Lecture Notes inMathematics 450, Berlin, Springer, 1975.
[9] and (editors), Proof theory symposion, Lecture Notes in Mathematics 500, Berlin, Springer, 1975.
[10] , On the consistency of a positive theory,Mathematical Logic Quarterly, vol. 45 (1999), to appear.Google Scholar
[11] , Some formal systems for the unlimited theory of structures and categories, The Journal of Symbolic Logic, vol. 39 (1974), pp. 374-375. abstract.Google Scholar
[12] , A language and axioms for explicit mathematics, In Crossley [8], pp. 87-139.
[13] , Non-extensional type-free theories of partial operations and classifications I, In Diller and Müller [9], pp. 73-118.
[14] , Recursion theory and set theory: a marriage of convenience, In Fenstad et al. [19], pp. 55-98.
[15] , Constructive theories of functions and classes, In Boffa et al. [3], pp. 159-225.
[16] , Towards useful type-free theories, I, The Journal of Symbolic Logic, vol. 49 (1984), pp. 244-259.Google Scholar
[17] and , Systems of explicit mathematics with non-constructive _-operator, I, Annals of Pure and Applied Logic, vol. 65 (1993), pp. 243-263.Google Scholar
[18] , Systems of explicit mathematics with non-constructive _-operator, II, Annals of Pure and Applied Logic, vol. 79 (1996), pp. 37-52.Google Scholar
[19] , , and (editors), Generalized recursion theory II, Amsterdam, North Holland, 1978.
[20] and , The consistency problem for positive comprehension principles, The Journal of Symbolic Logic, vol. 54 (1989), pp. 1401-1418.Google Scholar
[21] , The consistency of partial set theory without extensionality, Axiomatic set theory II, 1974, pp. 147-153.Google Scholar
[22] , Consistency of a fragment of Quine's NF system, SovietMathematics Doklady, vol. 10 (1969), pp. 1387-1390.Google Scholar
[23] , The equivalence of NF-style set theories with “tangled” type theories: the construction of _-models of predicative NF (and more), The Journal of Symbolic Logic, vol. 60 (1995), pp. 178-190.Google Scholar
[24] , Power types in explicit mathematics, The Journal of Symbolic Logic, vol. 62 (1997), pp. 1142-1146.Google Scholar
[25] (editor), Axiomatic set theory II, Proceedings of Symposia in Pure Mathematics, Providence RI, AMS, 1974.
[26] , Theories of types and names with positive stratified comprehension, Studia Logica, vol. 62 (1999), pp. 215-242.Google Scholar
[27] and , A minimal predicative set theory, Notre Dame Journal of Formal Logic, vol. 35 (1994), pp. 186-203.Google Scholar
[28] , , and (editors), Logic, methodology and philosophy of science, Stanford, Stanford University Press, 1962, Proceedings of the 1960 International Congress.
[30] , Logic for mathematicians, Mc Graw-Hill, New York, 1953.
[31] , Typical ambiguity, In Nagel et al. [28], Proceedings of the 1960 International Congress, pp. 116-123.