Independent recursive axiomatizability in arithmetic
HTML articles powered by AMS MathViewer
- by J. P. Jones PDF
- Proc. Amer. Math. Soc. 23 (1969), 107-113 Request permission
References
- William Craig, On axiomatizability within a system, J. Symbolic Logic 18 (1953), 30–32. MR 55278, DOI 10.2307/2266324 G. Kreisel, Independent recursive axiomatization, J. Symbolic Logic 22 (1957), 109. R. Montague and A. Tarski, Independent recursive axiomatizability, Mimeographed notes, Summer Institute for Symbolic Logic, Cornell University, Ithaca, N. Y., 1957, p. 270.
- A. Mostowski, On models of axiomatic systems, Fund. Math. 39 (1952), 133–158 (1953). MR 54547, DOI 10.4064/fm-39-1-133-158 M. B. Poúr-El, Hypersimplicity as a necessary and sufficient condition for nonindependent axiomatization, Z. Math. Logik Grundlagen Math. 14 (1968), 449-456.
- Iégor Reznikoff, Tout ensemble de formules de la logique classique est équivalent à un ensemble indépendant, C. R. Acad. Sci. Paris 260 (1965), 2385–2388 (French). MR 177873 A. Tarski, Grundzüge des systemenkalkuls. I, Fund. Math. 25 (1935), 503-526.
- Alfred Tarski, Undecidable theories, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1953. In collaboration with Andrzej Mostowski and Raphael M. Robinson. MR 0058532
Additional Information
- © Copyright 1969 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 23 (1969), 107-113
- MSC: Primary 02.72
- DOI: https://doi.org/10.1090/S0002-9939-1969-0256878-0
- MathSciNet review: 0256878