Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Visser (2018)
The small‐is‐very‐small principleMathematical Logic Quarterly, 65
P. Hájek, P. Pudlák (2017)
Metamathematics of first‐order arithmetic, 3
J. Avigad (2004)
Forcing in Proof TheoryBulletin of Symbolic Logic, 10
H. Kotlarski (1994)
On the incompleteness theoremsJournal of Symbolic Logic, 59
A. Visser (2006)
The predicative Frege hierarchyAnn. Pure Appl. Log., 160
J. Avigad
Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic—Proof Theory
A. Visser (2008)
Can We Make the Second Incompleteness Theorem Coordinate Free?J. Log. Comput., 21
L. Beklemishev (2011)
Gödel incompleteness theorems and the limits of their applicability. IRussian Mathematical Surveys, 65
A. Visser (2009)
CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSENThe Review of Symbolic Logic, 2
K. Gödel (1931)
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik und Physik, 38
外史 竹内 (1996)
Bounded Arithmetic と計算量の根本問題, 1996
C. Smoryński (1977)
The Incompleteness Theorems
A. S. Troelstra, D. Dalen (1988)
Constructivism in Mathematics, vol. 1, 121
S. Feferman (1959)
Arithmetization of metamathematics in a general setting
J. Ferrante, C. Rackoff (1979)
The computational complexity of logical theories
A. Visser (2017)
On QSoft Computing, 21
and P
P. Hájek, P. Pudlák (2017)
Metamathematics of First-Order Arithmetic by Petr Hájek
S. Simpson (1999)
Subsystems of second order arithmetic
Avigad J. (2003)
402ACM Trans. Comput. Log. (TOCL), 4
J. Avigad (2003)
Eliminating definitions and Skolem functions in first‐order logic, 4
T. Franzén (2017)
Gödel's Theorem: An Incomplete Guide to Its Use and Abuse
In this paper, we prove that no consistent finitely axiomatized theory one‐dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose formulation is completely arithmetic‐free. Probably the most important novel feature that distinguishes our result from the previous results of this kind is that it is applicable to arbitrary weak theories, rather than to extensions of some base theory. The methods used in the proof of the main result yield a new perspective on the notion of sequential theory, in the setting of forcing‐interpretations.
Bulletin of the London Mathematical Society – Wiley
Published: Dec 1, 2022
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.