scientific article
From MaRDI portal
Publication:3893931
zbMath0448.03054MaRDI QIDQ3893931
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonstandard models of arithmetic (03H15) Model theory of denumerable and separable structures (03C15)
Related Items (15)
The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem ⋮ On the number of steps in proofs ⋮ Transfinite induction within Peano arithmetic ⋮ Slow reflection ⋮ Short proofs for slow consistency ⋮ ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ Inductive full satisfaction classes ⋮ A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) ⋮ Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ Proof lengths for instances of the Paris-Harrington principle ⋮ Connected components of graphs and reverse mathematics ⋮ On Gödel incompleteness and finite combinatorics ⋮ Independence of Ramsey theorem variants using $\varepsilon _0$ ⋮ On the finite containment problem for Petri nets
This page was built for publication: