Switch to: References

Citations of:

Gödel's Second Theorem for Elementary arithmetic

Lawrence J. Pozsgay

Mathematical Logic Quarterly 14 (1-5):67-80 (1968)

Add citations

You must login to add citations.

Fermat’s last theorem proved in Hilbert arithmetic. I. From the proof by induction to the viewpoint of Hilbert arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (7):1-57.details In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...) Download Export citation Bookmark
Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.details We characterize the bimodal provability logics for certain natural (classes of) pairs of recursively enumerable theories, mostly related to fragments of arithmetic. For example, we shall give axiomatizations, decision procedures, and introduce natural Kripke semantics for the provability logics of (IΔ 0 + EXP, PRA); (PRA, IΣ 1 ); (IΣ m , IΣ n ) for $1 \leq m etc. For the case of finitely axiomatized extensions of theories these results are extended to modal logics with propositional constants. Download Export citation Bookmark 7 citations

1