On partially conservative sentences and interpretability
- 1 January 1984
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 91 (3) , 436-443
- https://doi.org/10.1090/s0002-9939-1984-0744645-9
Abstract
A sentence is -conservative over if <!-- MATH $T + \varphi \vdash \psi$ --> implies <!-- MATH $T \vdash \psi$ --> for every <!-- MATH $\psi \in \Gamma$ --> . In §1 this concept for <!-- MATH $\Gamma = \sum _{n + 1}^0$ --> and <!-- MATH $\prod _{n + 1}^0$ --> is investigated. In §2 results from §1 are applied to interpretability in theories containing arithmetic.
Keywords
This publication has 11 references indexed in Scilit:
- On certain lattices of degrees of interpretability.Notre Dame Journal of Formal Logic, 1984
- Fifty years of self-reference in arithmetic.Notre Dame Journal of Formal Logic, 1981
- Calculating self-referential statements: Guaspari sentences of the first kindThe Journal of Symbolic Logic, 1981
- Partially Conservative Extensions of ArithmeticTransactions of the American Mathematical Society, 1979
- On Partially Conservative Extensions of ArithmeticPublished by Elsevier ,1979
- On interpretability in theories containing arithmeticFundamenta Mathematicae, 1972
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic SystemsMathematical Logic Quarterly, 1968
- On weak completeness of intuitionistic predicate logicThe Journal of Symbolic Logic, 1962
- Relative InterpretationsMathematical Logic Quarterly, 1961
- Arithmetization of metamathematics in a general settingFundamenta Mathematicae, 1960