I am wondering if there is an extension of PA by additional axioms, but without extending its language, which is equiconsistent with ZF. In particular I am wondering if there is a relatively short axiom we can add to PA to gain equiconsistency with ZF without leaving the language of PA and using set theory.
2026-03-25 16:00:22.1774454422
Theory of arithmetic equiconsistent with ZF
129 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PEANO-AXIOMS
- Difference between provability and truth of Goodstein's theorem
- How Can the Peano Postulates Be Categorical If They Have NonStandard Models?
- Show that PA can prove the pigeon-hole principle
- Peano Axioms and loops
- Is it true that $0\in 1$?
- Is there a weak set theory that can prove that the natural numbers is a model of PA?
- Exercises and solutions for natural deduction proofs in Robinson and Peano arithmetic
- Proof of Strong Induction Using Well-Ordering Principle
- Some questions about the successor function
- Prove addition is commutative using axioms, definitions, and induction
Related Questions in META-MATH
- Should axioms be seen as "building blocks of definitions"?
- Maximum possible reputation? (NOT a meta question)
- Exotic schemes of implications, examples
- Is the style of _Scott 1967_ outdated in discussing continuum hypothesis in a probability space?
- Is there a weak set theory that can prove that the natural numbers is a model of PA?
- How quickly can EFA define things, asymptotically?
- Where to put the dot at the end of a sentence when using cases-figure?
- Set theory that proves that if its consistient, is only proves true things about arithmetic
- Do models (in logic) contain elements?
- Does specifying which variables depend on which other variables strengthen arithmetic?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The simplest approach would be the following. Given a primitively recursively axiomatized theory $T$ (ZF is such a theory, and indeed by Craig's trick every r.e. axiomatizable theory is equivalent to such), let PA[$T$] be the theory consisting of PA together with, for each $n$, the axiom
It's easy to show that (if $T$ proves $Con(PA)$ - which is the case when $T=ZF$) then PA proves that PA$[T]$ is consistent iff $T$ is consistent.
(Note that PA + $Con(ZFC)$ is too strong, so we really do need to be a bit fiddly here.)
But that's probably not satisfying, partly because it's "clearly cheating" and also because it's not a single principle. Is there anything better?
Harvey Friedman has developed a many-pronged program around finding "natural combinatorial" principles of high consistency strength (e.g. well beyond ZF) - see e.g. his manuscript on Boolean Relation Theory or his many postings on the Foundations of Mathematics mailing list (which has searchable archives). Friedman is on record as arguing that the principles he has isolated are natural, compelling, and easily comprehensible; I personally largely disagree, but I'd certainly agree that they're much more natural that I would expect and reveal surprising facts about combinatorial complexity and that his results are incredibly striking.
That said, Friedman's goal has always (to the best of my knowledge) been to locate "natural" statements of highest consistency strength possible (well, not quite :P) and to show that the large cardinal hierarchies form the right tool for gauging the consistency strength of such. So he's focused more on principles corresponding to large cardinals beyond ZFC and I don't know of any that have consistency strength exactly that of ZF.