In their book Models for Smooth Infinitesimal Analysis Moerdijk and Reyes claim that the natural number object in any Grothendieck topos is a model of all classical provable statements of first order Peano arithmetic. Is this true? They do not provide a proof other than "do an induction on the formula". The semantic is the forcing semantic (equivalently the standard categorical semantic).
2026-03-25 11:15:04.1774437304
is the NNO in a sheaf topos a model of classical PA?
108 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in TOPOS-THEORY
- Continuous functor for a Grothendieck topology
- Show that a certain functor preserves colimits and finite limits by verifying it on the stalks of sheaves
- Prove that a "tensor product" principal $G$-bundle coincides with a "pullback" via topos morphism
- (From Awodey) Find the subobject classifier for $\sf Sets^{P}$ for a poset $\sf P$
- Cardinal collapse and (higher) toposes
- Geometric interpretation of Lawvere-Tierney topology
- Can 2 different coverages *on the same category* yield the same sheaf topos?
- Is there a classifying topos for schemes?
- $\infty$-categories definition disambiguation
- Classifying topos of a topological group
Related Questions in INTUITIONISTIC-LOGIC
- Are Proofs of Dependent Pair Types Equivalent to Finding an Inverse Function?
- Prove the undecidability of a formula
- Semantics for minimal logic
- Is minimal logic equivalent to intuitionistic?
- How do set theories base on Intuitionistic Logic deal with ordinals?
- Why is intuitionistic modelling called forcing?
- Attempt at constructive proof of compactness of [0,1], does this use LEM? Does a constructive proof exist?
- Is there a theorem that can easily be proved to be non intuitionistic?
- Interpretation of implication in intuitionistic logic
- $\mathbb Q$ topological semantics for intuitionistic propositional logic
Related Questions in CATEGORICAL-LOGIC
- Can we give a categorical definition of product without using any sub/superscripts or cheating?
- What do you think of this visual category theory tool? See any issues? Would you use it?
- Why are local rings a coherent theory?
- A simple example in regular categorical logic
- Graphs in a regular category
- Categoricity of categorical arithmetic
- Equivalent algebraic theory with at most binary operations
- Internal equality for Eq-fibrations
- What is a presentation of a Lawvere theory formally, and how do you generate the associated Lawvere theory?
- How to categorically characterize the structure of all grounded first-order logic formulas?
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?
Yes.
In general, consider a Boolean topos $T$ and a topos $S$, and suppose we have a functor $F : T \to S$ which preserves finite limits and has a right adjoint (in other words, is the left part of a geometric morphism).
Even without the assumption that $T$ is Boolean, we see that $F$ is a coherent functor. This means that $F$ preserves finite limits, finite joins, and images. In other words, $F$ preserves the fragment of the internal logic consisting of $\top, \bot, \land, \lor$, $=$, and $\exists x \in A$. This is fairly easy to verify.
When we add in the assumption that $T$ is Boolean, it turns out that $F$ is also a Heyting functor. This means that $F$ also preserves the Heyting implication and dual images. So $F$ preserves the full $\Delta_0$ logic of $T$- that is, the full logic where we can quantify over elements.
Now, we may observe that given any cocomplete topos $S$, the functor $\Delta : Set \to S$ preserves finite limits and has a right adjoint - namely, the global sections functor $Hom(1, -)$. Recall that we may define $\Delta S = \coprod\limits_{s \in S} 1$.
In particular, note that $\Delta \mathbb{N}$ is the natural numbers object in $S$ (and of course the operations $0, 1, +, \cdot, succ$ are preserved by the functor). Therefore, for all sentences $\phi$ in the language of PA, if $\mathbb{N} \models \phi$ holds in the category of sets, then we also have $\Delta \mathbb{N} \models \phi$ in $S$. So in a sense, the arithmetic of $\mathbb{N}$ is absolute along the inclusion $\Delta : Set \to S$.
In fact, the left part of a geometric morphism must always preserve well-founded relations. This gives us a nice way of showing that $\Delta \mathbb{N}$ is the NNO. This is because an NNO can be axiomatised in the internal logic by the second-order Peano axioms (in Heyting arithmetic), which consist of first-order coherent axioms and the axiom that the relation $R = \{(x, succ(x)) \mid x \in \mathbb{N}\}$ is well-founded. All of these axioms are therefore preserved by $\Delta$ (even if $Set$ isn’t Boolean).
Finally, note the assumption of excluded middle for $Set$ is critical. For we could instead consider a model of constructive set theory in which Church’s thesis holds, which contradicts Peano arithmetic. But then we could take any Boolean Grothendieck topos $T$ (in particular, the double negation sheaves on $Set$ work nicely), and the functor $\Delta : Set \to T$ would be the left part of a geometric morphism but wouldn’t preserve $Set$’s arithmetic, since Peano arithmetic holds in $T$.