Some independence results for Peano arithmetic
From MaRDI portal
Publication:4194958
DOI10.2307/2273511zbMath0408.03048OpenAlexW2005638249MaRDI QIDQ4194958
Publication date: 1978
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273511
Number TheoryModel TheoryCountable Nonstandard ModelIndependence Results for Peano's First Order Axioms
Related Items
The strength of infinitary Ramseyan principles can be accessed by their densities, Non-standard algorithmic and dynamic logic, Recursively saturated nonstandard models of arithmetic, Regularity in models of arithmetic, More on lower bounds for partitioning \(\alpha\)-large sets, How to prove representation-independent independence results, Reverse mathematical bounds for the termination theorem, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem, Phase Transitions for Weakly Increasing Sequences, Some bounds for the Ramsey-Paris-Harrington numbers, Independence results in computer science?, On the strength of Ramsey's theorem without Σ1‐induction, Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic, Die another day, On Gödel incompleteness and finite combinatorics, Phase transitions for Gödel incompleteness, Categoricity, On the complexity of models of arithmetic, Petri nets and large finite sets, Flipping properties in arithmetic, Some remarks on initial segments in models of Peano arithmetic, In search of the first-order part of Ramsey's theorem for pairs
