Book contents
- Frontmatter
- Dedication
- Preface
- Contents
- CHAPTER 0 Introduction
- CHAPTER 1 Preliminaries
- CHAPTER 2 Incompleteness
- CHAPTER 3 Numerations of r.e. sets
- CHAPTER 4 Axiomatizations
- CHAPTER 5 Partial conservativity
- CHAPTER 6 Interpretability
- CHAPTER 7 Degrees of interpretabilty
- CHAPTER 8 Generalizations
- References
- Index
- Notation
- References
References
Published online by Cambridge University Press: 24 March 2017
Book contents
- Frontmatter
- Dedication
- Preface
- Contents
- CHAPTER 0 Introduction
- CHAPTER 1 Preliminaries
- CHAPTER 2 Incompleteness
- CHAPTER 3 Numerations of r.e. sets
- CHAPTER 4 Axiomatizations
- CHAPTER 5 Partial conservativity
- CHAPTER 6 Interpretability
- CHAPTER 7 Degrees of interpretabilty
- CHAPTER 8 Generalizations
- References
- Index
- Notation
- 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
- Aspects of Incompleteness , pp. 125 - 129Publisher: Cambridge University PressPrint publication year: 2017
References
Only works mentioned in the text (Notes) have been included among the references; for a more comprehensive bibliography, see and (1993).
(1995). Iterated local reflection versus iterated consistency, Annals of Pure and Applied Logic
75, 25–48.Google Scholar
(199?). Notes on local reflection principles, to appear.
(1986). On some orderings of extensions of arithmetic, Thesis, Dept. of Philosophy, Univ. of Göteborg.
(1986a) Lindenbaum algebras and partial conservativity, Proc. Amer. Math. Soc.
97, 323–327.Google Scholar
(1979). The Unprovability of Consistency, Cambridge University Press, Cambridge, USA.
(1993). The Logic of. Provability, Cambridge University Press, Cambridge, USA.
(ed.) (1965). The Undecidable, Raven Press.
and (1960). Representability of recursively enumerable sets in formal theories, Arch. Math. Logic
5, 37–41.Google Scholar
(1960). Arithmetization of metamathematics in a general setting, Fund. Math. 49, 35–92.Google Scholar
(1962). Transfinite recursive progressions of axiomatic theories, J. Symb. Logic
27, 259–316.Google Scholar
(1975). One hundred and two problems in mathematical logic, J. Symb. Logic
40, 113–129.Google Scholar
(1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatsh. Math. Physik. 38,173–198 (English translation in Davis (1965)).Google Scholar
(1934). On undecidable propositions of formal mathematical systems (mimeographed lecture notes by S. C. Kleene and J. B. Rosser), Princeton (reprinted in Davis (1965)).Google Scholar
(1936). Über die Länge von Beweisen, Ergebnisse eines math. Koll, 7, 23–24 (English translation in Davis (1965)).Google Scholar
(1986). On the interpretability of some extensions of arithmetic, Mat. Zametki
40, 561–572; English transl. in Math. Notes 40.Google Scholar
(1979). Partially conservative extensions of arithmetic, Trans. Amer. Math. Soc. 254, 47–68.Google Scholar
(1979). On partially conservative extensions of arithmetic, in: Logic Colloquium 78 (eds. et al.), North-Holland, Amsterdam, 225–234.
(1984). On a new notion of partial conservativity, in: Computation and Proof Theory, Springer Lecture Notes in Math. 1104, 217–232.Google Scholar
, , (1992). Abbreviating proofs using metamathematical rules, in: Proof Theory and Computational Complexity (eds. and ), Oxford University Press, 197–221.
and (1993). Metamathematics of First–Order Arithmetic, Perspectives in Mathematical Logic, Springer–Verlag.
(1971). The lattice of bi-numerations of arithmetic I, II, Comment. Math. Univ. Carol. 12, 81–104, 281–306.Google Scholar
and (1972). On interpretability in theories containing arithmetic, Fund. Math. 76, 131–137.Google Scholar
and (1934, 1939). Grundlagen der Mathematik I, II, Springer–Verlag, Berlin.
(1971b). Non-effectiveness in S. Orey's compactness theorem, Zeitschr. Math. Log. Grundl. Math. 17, 285–289.Google Scholar
(1991). Models of Peano arithmetic, Oxford Logic Guides 15, Clarendon Press, Oxford.
(1973). The relation of A to Prov'A’ in the Lindenbaum sentence algebra, J.Symb. Logic
38, 295–298.Google Scholar
(1952b). Finite axiomatizability of theories in the predicate calculus using additional predicate symbols, Memoirs Amer. Math. Soc. 10, 27–66.Google Scholar
(1962). On weak completeness of intuitionistic predicate logic, J. Symb. Logic
27, 139–158.Google Scholar
and (1968). Reflection principles and their use for establishing the complexity of axiomatic systems, Zeitschr. für math. Logik
14, 97–142.Google Scholar
and (1955). Some applications of formalized consistency proofs, Fund. Math. 42, 101–110.Google Scholar
(1963). “Flexible” predicates in formal number theory, Proc. Amer. Math. Soc. 13, 647–650.Google Scholar
(1979). Some results on interpretability, in: Proceedings of the 5th Scandinavian Logic Symposium 1979, Aalborg University Press, Aalborg, 329–361.
(1984a). On partially conservative sentences and interpretability, Proc. Amer. Math. Soc. 91, 436–443.Google Scholar
(1984b). On certain lattices of degrees of interpretability, Notre Dame J. Formal Logic
25, 127–140.Google Scholar
(1984c). On faithful interpretability, in: Computation and Proof Theory, Springer Lecture Notes in Math. 1104, 279–288.Google Scholar
(1988). Partially generic formulas in arithmetic, Notre Dame J. Formal Logic
29, 185–192.Google Scholar
(1993). On Σ1 and П1 sentences and degrees of interpretability, Annals of Pure and Applied Logic
61, 175–193.Google Scholar
(199?). Provability logic, to appear in Theoria.
(1987). Introduction to Mathematical Logic (3rd ed.), van Nostrand.
(1982). The non homogeniety of the E-tree–answer to a problem raised by D. Jensen and A. Ehrenfeucht, Proc. Amer. Math. Soc. 84, 573–575.Google Scholar
(1983). Answer to a problem by D. Guaspari, in: Open days in Model Theory and Set Theory (eds. et al.), Poland, 181–183.
(1982). Relatively precomplete numerations and arithmetic, J. Phil. Logic
11, 419–430.Google Scholar
(1992). Polynomially and superexponentially shorter proofs in fragments of arithmetic, J. Symb. Logic
57, 844–863.Google Scholar
and (1985). Universal recursion theoretic properties of r.e. preordered structures, J. Symb. Logic
50, 397–406.Google Scholar
(1957). Two theorems on relative interpretability, Summer institute for Symbolic Logic, Cornell, 263–264.
(1961). Semantical closure and non–finite axiomatizability I, in: Infinitistic Methods, Warsaw, 45–69.
(1962). Theories incomparable with respect to relative interpretability, J. Sym. Logic
27, 195–211.Google Scholar
(1963). Syntactical treatments of modality, with corollaries on reflection principles and finite axiomatizability, in: Proceedings of a Colloquium on Modal and Many-Valued Logics, Acta Philosophica Fennica, Helsinki, 153–167.
and (1957). Independent recursive axiomatizability, Summer institute for Symbolic Logic, Cornell, 270.
(1952b). Sentences undecidable in formalized arithmetic, North–Holland.
(1975). A theorem on shortening the length of proof in formal systems of arithmetic, J. Symb. Logic
40, 398–400.Google Scholar
(1968). Independent axiomatization and its relation to the hypersimple set, Zeitschr. für math. Logik
14, 449–456.Google Scholar
and (1967). Deduction preserving recursive isomorphisms between theories, Fund. Math. 61, 141–163.Google Scholar
and (1960). Exact separation of recursively enumerable sets within theories, Proc. Amer. Math. Soc. 11, 574–577.Google Scholar
(1980). Some problems in logic, Thesis, Oxford University.
(1981). Sets of Σk–conservative sentences are Π0
2 complete, J. Symb. Logic
46, 442 (abstract).Google Scholar
(1961). Non-standard models and independence of the induction axiom, in: Essays on the Foundations of Mathematics, Jerusalem, 287–299.
(1936). Extensions of some theorems of Gödel and Church, J. Symb. Logic
1, 87–91 (reprinted in Davis (1965)).Google Scholar
(1952). The role of the axiom of induction in elementary arithmetic, Fund. Math. 39, 239–263.Google Scholar
(1976). An effective fixed point theorem in intuitionistic diagonalizable algebras, Studia Logica
35, 345–361.Google Scholar
(1962). Algebras of sets binumerable in complete extensions of arithmetic, in: Recursive Function Theory (ed. ), Providence, 117–121.Google Scholar
(1988). The logic of relative interpretability over Peano arithmetic, Steklov Mathematical Institute, Moscow. (Russian)
(1993). Subalgebras of diagonalizable algebras of theories containing arithmetic, Dissertationes Mathematicae CCCXXIII, Warsaw.
(1960). Representability of recursively enumerable sets in formal theories, Arch. Math. Logic
5, 119–127.Google Scholar
(1981a). Calculating self-referential statements: Guaspari sentences of the first kind, J. Symb. Logic
46, 329–344.Google Scholar
(1981b). Fifty years of self-reference in arithmetic, Notre Dame J. Formal Logic
22, 357–374.Google Scholar
(1985). Self-Reference and Modal Logic, Springer–Verlag.
(1987). Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer–Verlag.
(1985). Infinite fixed-point algebras, Proceedings of Symposia in Pure Mathematics
42, Providence, 473–486.Google Scholar
(1997). Arithmetical realizations of modal formulas, Thesis, Dept. of Philosophy, University of Göteborg.
(1933). Der Wahrheitsbegriff in den formalisierten Sprachen, Studia Philosophica
1, 261–405.Google Scholar
, and (1953). Undecidable Theories, North–Holland, Amsterdam.
(1992). Feasible interpretability, in: Arithmetic, Proof Theory and Computational Complexity (eds. and ), Oxford Univ. Press, 387–428.
(1994). The complexity of feasible interpretability, in: Feasible Mathematics II (eds. and ), Birkhäuser, Boston, 429–447.