Skip to main content

All Questions

1 vote
0 answers
42 views

Is this a non-standard extension?

I started reading Henson's "Foundations of Nonstandard Analysis. A Gentle Introduction to Nonstandard Extensions" a couple of days ago, and I am a bit confused about something. Let $F$ be an ...
Saúl RM's user avatar
  • 3,545
1 vote
0 answers
27 views

Double exponentials in weak arithmetic

In arithmetic without total exponentiation, the exponentiable numbers are closed under addition. It is thus common to think of natural numbers as binary strings $n : |n| \to 2$, whose (unary) lengths $...
Robin Saunders's user avatar
0 votes
2 answers
85 views

Showing existence of a non-standard model of arithmetic elementarily equivalent to standard model of arithmetic

Let $\mathcal{M}_A=\langle\mathbb N, 0^{\mathcal{M}_A}, s^{\mathcal{M}_A}, +^{\mathcal{M}_A}, \times^{\mathcal{M}_A}, <^{\mathcal{M}_A}\rangle$ be the standard model for the language of arithmetic $...
John Davies's user avatar
1 vote
1 answer
143 views

Confusion about the model in Robert’s Nonstandard Analysis

I’m working through Alain M. Robert’s “Nonstandard Analysis”. I’m intrigued by his suggestion that his axiomatic approach, rather than adding elements to ℕ to create a nonstandard model *ℕ, “discerns ...
Rivers McForge's user avatar
3 votes
3 answers
195 views

If Goldbach's conjecture G is undecidable in PA, then can we prove $\mathbb N\models G$?

Suppose Goldbach's conjecture $G$ is undecidable in first-order Peano arithmetic, $\sf{PA}$. That would mean there are models in which $G$ is true and other in which it is false. But intuitively, this ...
WillG's user avatar
  • 6,672
1 vote
1 answer
77 views

Does anyone describe Henkinization as closing under Skolem Functions?

When I'm constructing a nonstandard model by by adding in a new constant symbol and invoking compactness, it feels much more like I'm adding in $c$ and "closing under Skolem functions" (at ...
TomKern's user avatar
  • 3,079
1 vote
0 answers
141 views

If I use ZFC as a metatheory for FOL, doesn't it make it weaker?

Basically, there is a theorem of first-order logic that says that no L-structure whose domain is infinite can be axiomatized up to isomorphism, so in particular there is no set $\Phi$ of formulas that ...
Xenônio's user avatar
7 votes
1 answer
151 views

Extending a Model of $ T + \operatorname {Con} ( T ) $ to a model of $ T + \neg \operatorname {Con} ( T ) $

Let $ T $ be a recursively axiomatizable extension of $ \mathsf {PA} $ and $ \mathfrak M $ be a model of $ T + \operatorname {Con} ( T ) $. Is it true that there must exist a model $ \mathfrak N $ ...
Mohsen Shahriari's user avatar
1 vote
1 answer
60 views

Which theories of arithmetic have non-standard computable models?

From this answer: In particular, while PA is still overkill, there are theories of arithmetic much stronger than arithmetic with successor which are too weak for the Tennenbaum phenomenon to hold for ...
Carla only proves trivial prop's user avatar
3 votes
1 answer
146 views

Every nonstandard model of arithmetic has an element which is a multiple of every $n\in \Bbb N$.

Let $\mathfrak N$ be the structure of the natural numbers on the language of arithmetic $\mathcal L=\{0,1,+,\cdot,<\}$. Let $\mathfrak M$ be any nonstandard model of arithmetic. Show that there ...
Addem's user avatar
  • 5,696
6 votes
1 answer
265 views

Which models of PA can be standard in some model of ZFC?

From wikipedia: For example, there are models of Peano arithmetic in which Goodstein's theorem fails. It can be proved in Zermelo–Fraenkel set theory that Goodstein's theorem holds in the standard ...
Carla only proves trivial prop's user avatar
5 votes
1 answer
56 views

Hyper-extensions of Hom space

We fix an ultrafilter $\mathcal{F}$ of $\mathbb{N}$ which contains the cofinite filter. Let $A,B$ be sets and ${}^{*}A,{}^{*}B$ their hyper-extensions. Then is $$ {\rm Hom}({}^{*}A,{}^{*}B) $$ equal ...
M masa's user avatar
  • 161
0 votes
0 answers
66 views

Number of models of the naturals and reals with and without CH

The Wikipedia page on true arithmetic says that it has $2^\kappa$ models for each uncountable cardinal $\kappa$. This refers to the theory of all first-order statements of the naturals. I'm curious ...
Mike Battaglia's user avatar
1 vote
1 answer
96 views

Soundness and Completeness for a single Model Only?

Question modified to hopefully answer the questions (I'm a physicist to all might not be mathematically watertight) In Enderton "A Mathematical Introduction to Logic", logical Implication is ...
user avatar
3 votes
2 answers
187 views

"Real-closed" vs "transfer principle"

The hyperreals are "real-closed," which means that any first-order statement that is true of the reals is true of the hyperreals. However, they also satisfy a "transfer principle," ...
Mike Battaglia's user avatar

15 30 50 per page
1
2 3 4 5 6