- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A Simple Proof of Arithmetical Completeness for $\Pi_1$ -Conservativity Logic
Notre Dame Journal of Formal Logic 35 (3):346-354 (1994)
Abstract
Hájek and Montagna proved that the modal propositional logic ILM is the logic of -conservativity over sound theories containing I (PA with induction restricted to formulas). I give a simpler proof of the same factLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Arithmetical completeness versus relative completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
Syntactical results on the arithmetical completeness of modal logic.Paolo Gentilini - 1993 - Studia Logica 52 (4):549 - 564.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
Proof-theoretic modal PA-Completeness II: The syntactic countermodel.Paolo Gentilini - 1999 - Studia Logica 63 (2):245-268.
A Simple Proof of Completeness and Cut-elimination for Propositional G¨ odel Logic.Arnon Avron - unknown
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
A simple strong completeness proof for sentential logic.Charles Silver - 1980 - Notre Dame Journal of Formal Logic 21 (1):179-181.
Arithmetical interpretations of dynamic logic.Petr Hájek - 1983 - Journal of Symbolic Logic 48 (3):704-713.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Generic generalized Rosser fixed points.Dick H. J. Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193 - 203.
Analytics
Added to PP
2010-08-24
Downloads
28 (#584,743)
6 months
5 (#700,287)
2010-08-24
Downloads
28 (#584,743)
6 months
5 (#700,287)
Historical graph of downloads
Citations of this work
Transductions in arithmetic.Albert Visser - 2016 - Annals of Pure and Applied Logic 167 (3):211-234.
On the limit existence principles in elementary arithmetic and Σ n 0 -consequences of theories.Lev D. Beklemishev & Albert Visser - 2005 - Annals of Pure and Applied Logic 136 (1-2):56-74.
Hierarchical Incompleteness Results for Arithmetically Definable Extensions of Fragments of Arithmetic.Rasmus Blanck - 2021 - Review of Symbolic Logic 14 (3):624-644.
References found in this work
Provability Interpretations of Modal Logic.Robert M. Solovay - 1981 - Journal of Symbolic Logic 46 (3):661-662.
The interpretability logic of peano arithmetic.Alessandro Berarducci - 1990 - Journal of Symbolic Logic 55 (3):1059-1089.
Provability logics for relative interpretability.Frank Veltman & Dick De Jongh - 1990 - In Petio Petrov Petkov (ed.), Mathematical Logic. Proceedings of the Heyting '88 Summer School. New York, NY, USA: pp. 31-42.
The logic of π1-conservativity.Petr Hajek & Franco Montagna - 1990 - Archive for Mathematical Logic 30 (2):113-123.
On the proofs of arithmetical completeness for interpretability logic.Domenico Zambella - 1992 - Notre Dame Journal of Formal Logic 33 (4):542-551.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8fb5884b9-g9g5w uwo