May I ask why Presburger arithmetic is not categorical in any cardinality? And I was told that the theory $T<$ of natural number with ordering structure $(\mathbb{N} , 0 , S, <)$ is not categorical in any cardinality, e.g. the nonstandard part in $A$, a model of $T<$, are gained by replacing every points in $(\mathbb{N}, <)$ with a "$\mathbb{Z}$-chain" (which is like "$......, a, Sa , SSa$", because every "number" other than $0$ is a successor of some other "number") and the one in model $B$, another model of $T<$, are gained by replacing every points in $(\mathbb{Q}, <)$ with a $\mathbb{Z}$-chain, then $A$ and $B$ are not isomorphic. I think it may be because the $\mathbb{Z}$-chains in $A$ are dense but $B$'s are not. However, could this argument work for uncountable cardnalities as well?
2026-03-31 14:30:45.1774967445
Why Presburger arithmetic is not categorical in any cardinality (the theory of natural number with ordering also)?
141 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 MODEL-THEORY
- What is the definition of 'constructible group'?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Existence of indiscernible set in model equivalent to another indiscernible set
- A ring embeds in a field iff every finitely generated sub-ring does it
- Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree
- What would be the function to make a formula false?
- Sufficient condition for isomorphism of $L$-structures when $L$ is relational
- Show that PA can prove the pigeon-hole principle
- Decidability and "truth value"
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
Related Questions in NATURAL-NUMBERS
- Recursive Induction Floor Proof Help
- Countable set example
- Bound a natural by two consecutive powers
- Set theory that proves that if its consistient, is only proves true things about arithmetic
- $n$ is natural number. What is the result of $(-1)^{2n}-(-1)^{4n-1}-1^{n+1}-(-2)^3$
- Given a sufficiently large integer $N$, is it true that there are more primes than perfect squares in $[1,N]$?
- How to show that $(S\cup\{0\},\ge)$ is order-isomorphic to $(S,\ge)$?
- Some questions about the successor function
- What IS the successor function without saying $S(n) = n + 1$?
- Prove addition is commutative using axioms, definitions, and induction
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 theory $Th(\mathbb{N},<)$ is easier to think about, so let's treat it first. The models of $Th(\mathbb{N},<)$ are exactly the linear orders of the form $\omega + \zeta\cdot L$ for some linear order $L$ (possibly $L=\emptyset$). Here $\omega$ is the ordertype of $\mathbb{N}$ and $\zeta$ is the ordertype of $\mathbb{Z}$.
The key fact is this: we have $$\omega+\zeta\cdot L_1\cong \omega+\zeta\cdot L_2\quad\iff\quad L_1\cong L_2.$$ The right-to-left direction is trivial; for the left-to-right direction, the point is that an isomorphism can't send two elements in different "$\zeta$-blocks" to elements of the same "$\zeta$-block." Note that this relies on the structure of $\zeta$: it is not true that e.g. $\omega+\eta\cdot L_1\cong \omega+\eta\cdot L_2\implies L_1\cong L_2$ (here $\eta$ is the ordertype of $\mathbb{Q}$).
This, together with the fact that $\vert\omega+\zeta\cdot L\vert=\vert L\vert$ if $L$ is infinite, means:
One way to do this (motivated by the idea in your post) is to show that there is a dense linear order of size $\kappa$ and a non-dense linear order of size $\kappa$. The latter is provided by $\kappa$ itself; for the former, we can take e.g. $\eta\cdot\kappa$.
Now models of Presburger arithmetic, which I'll call "$\mathsf{Pres}$" ("$\mathsf{PA}$" already means something), are more than just linear orders. The above does however suggest an approach to proving non-categoricity in any cardinal: find some class of structures $\mathbb{X}$ with lots (that is, $>1$) of non-isomorphic instances of each infinite cardinality, and a way $X\mapsto M_X$ of turning structures in $\mathbb{X}$ into linear orders such that $$X\cong Y\iff M_X\cong M_Y.$$
Here's one way to do that:
Of course, for more complicated theories this sort of ad hoc argument gets increasingly tedious. Ultimately it's nice to have some powerful theorems to apply. For example:
This reduces the task of proving non-categoricity in uncountable cardinals to an analysis of countable models, which is usually pretty easy. Proving non-categoricity in $\omega$ is then handled separately (usually via omitting types).
Ultimately, counting models of a given theory is surprisingly hard, and over the years lots of work has gone into this - the term "(neo)stability theory" is key here. But for reasonably-natural countable theories, establishing non-categoricity is usually pretty straightforward, especially with a few key theorems in hand.