Keywords
- Inductive Generation
- Atomic Formula
- Total Operation
- Conservative Extension
- Partial Operation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
[B] P. Bernays, A system of axiomatic set theory, I., J. Symbolic Logic 2 (1937) 65–77.
[Bℓ] S. L. Bloom, A note on the predicatively definable sets of N. N. Nepeîvoda, IBM Research Report RC 4829, #21499, May 1, 1974.
[C] A. Chauvin, Théorie des objets et théorie des ensembles, Thèse, Université de Clermont-Ferrand (1974).
[F] S. Feferman, A language and axioms for explicit mathematics, in Algebra and Logic (Proc. 1974 Summer Res. Inst., Monash) ed. J. N. Crossley, to appear.
[Fil] F. B. Fitch, The system CΔ of combinatory logic, J. Symbolic Logic 28 (1963) 87–97.
[Fi2] F. B. Fitch, A consistent modal set theory, (abstract), J. Symbolic Logic 31 (1966) 701.
[Fr] H. Friedman, Axiomatic recursive function theory, in Logic Colloquium '69, eds. Gandy and Yates, North-Holland, Amsterdam (1971) 113–137.
[G] P. C. Gilmore, The consistency of partial set theory without extensionality, in Axiomatic Set Theory (1967 U.C.L.A. Symposium), Proc. Symposia in Pure Math. XIII, Part II, ed. T. Tech, A.M.S., Providence, 1974, 147–153.
[H, C] G. E. Hughes and M. J. Cresswell, An Introduction to Modal Logic, Methuen, London (1968).
[K] S. C. Kleene, Recursive functionals and quantifiers of finite types, I., Trans. Amer. Math. Soc. 91 (1959) 1–32.
[L] P. Lindström, First order logic and generalized quantifiers Theoria 32 (1966) 186–195.
[M] Y. N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam (1974).
[N] N. N. Nepeîvoda, A new notion of predicative truth and definability, (in Russian), Mat. Zametki 13 (1973) 735–745. (English translation Mathematical Notes 13 (1973) 493–495.)
[R] B. Russell, Mathematical logic as based on the theory of types (1908), reprinted in From Frege to Gödel, ed. J. van Heijenoort, Harvard University Press, Cambridge (1967) 150–182.
[S] K. Schütte, Beweistheorie, Springer, Berlin (1960).
[Sc] D. Scott, Data types as lattices (lecture notes, Kiel Summer School in Logic, 1972), to appear.
Editor information
Editors and Affiliations
Additional information
Dedicated to Kurt Schütte on the occasion of his 65th birthday
Rights and permissions
Copyright information
© 1975 Springer-Verlag
About this paper
Cite this paper
Feferman, S. (1975). Non-extensional type-free theories of partial operations and classifications, I. In: Diller, J., Müller, G.H. (eds) ⊨ISILC Proof Theory Symposion. Lecture Notes in Mathematics, vol 500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079548
Download citation
DOI: https://doi.org/10.1007/BFb0079548
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07533-2
Online ISBN: 978-3-540-38020-7
eBook Packages: Springer Book Archive
