**23**

votes

**9**answers

3k views

### What is… A Grossone?

Y. Sergeyev developed a positional system for representing infinite numbers using a basic unit called a "grossone", as well as what he calls an "infinity computer". The mathematical value of this ...

**24**

votes

**5**answers

2k views

### What are the advantages of the more abstract approaches to nonstandard analysis?

This question does not concern the comparative merits of standard (SA) and nonstandard (NSA) analysis but rather a comparison of different approaches to NSA. What are the concrete advantages of the ...

**12**

votes

**1**answer

588 views

### What is the precise relationship between o-minimal theory and Grothendieck's “Esquisse d'un programme”?

I have seen various references in the literature to such a connection but they tend to assume that the reader is familiar with the connection, and limit themselves to providing additional detail. So ...

**3**

votes

**1**answer

151 views

### When can we have “each subtheory is satisfiable iff it is recursively axiomatizable”?

Weak Version:
Is there a 1st order language $L$ (with only countably-many formulas) such that for each recursive coding $C$ of the formulas of $L$, there is a theory $T$ of $L$ where
$T$ is not ...

**5**

votes

**1**answer

312 views

### A proper class of formulas with every set-sized (but no proper-class-sized) subcollection satisfiable

What feature(s) must a (non 1st-order) language with proper-class-many formulas have in order to guarantee that:
There is a proper class P of formulas such that both
(a) every set-sized sub-...

**7**

votes

**0**answers

130 views

### Kripke models of $HA$

Let $K$ be a kripke model and $k$ be one of its node, then $\mathcal{M}_k$ is classical structure of $k$.
What is the strongest theory of arithmetic like $T$ such that for
every kripke model $K\...

**3**

votes

**1**answer

226 views

### Can we use this symbol? [closed]

We consider the ring $\mathbb{C}[e^{\lambda x} \mid \lambda \in \mathbb{C}]$ and the language $L=\{+, \cdot , \frac{d}{dx} , 0, 1\}$.
The ring consists of elements of the form $$\sum_{i=0}^N \...

**4**

votes

**3**answers

225 views

### End Extension models of $I\Delta_0$

Recently I'm thinking about question below, but I can not prove or disprove it.
Is it true that for every model $M\models I\Delta_0$ there exists a
model $M'\models PA$ such that $M'$ is end ...

**9**

votes

**2**answers

563 views

### Why is there a need for ordinal analysis?

Consider the Peano axioms. There exists a model for them (namely, the natural numbers with a ordering relation $<$, binary function $+$, and constant term $0$). Therefore, by the model existence ...

**1**

vote

**0**answers

50 views

### Infinitesimally small elements in extensions of models of model-complete theories

Suppose that we have a first order language $\mathcal{L}$ that extends the language of rings. Let $T$ a be a topological $\mathcal{L}$-theory of fields in the sense of Pillay.. this means that not ...

**13**

votes

**1**answer

344 views

### Is this theory decidable?

It is well-known that both Presburger arithmetic (by contrast with Peano arithmetic) and Tarski geometry are decidable. I was in the shower this morning and wondered whether there exists an elegant ...

**0**

votes

**0**answers

150 views

### Is the positive existential theory undecidable?

Could you tell if the positive existential theory of $\mathbb{C}[e^{\mu x} \mid \mu \in \mathbb{C}]$ is undecidable in the language $\{+, \cdot , \frac{d}{dx} , 0, 1, e^x\}$ ?
How can we prove the (...

**6**

votes

**1**answer

255 views

### What is known about the large cardinal strength of Shelah's categoricity conjecture?

Shelah's categoricity conjecture states that for every Abstract Elementary Class $\mathcal{K}$ there is a cardinal $\mu$ depending only on $\operatorname{LS}(K)$ (i.e. the Löwenheim–Skolem number of $\...

**4**

votes

**1**answer

298 views

### Show that the positive existential theory is undecidable

To show that the positive existential theory of $\mathbb{C}[t, e^{\lambda t} \mid \lambda \in \mathbb{C}]$ in the language $\{+, \cdot , ' , 0 , 1, t\}$ is undecidable we have to prove the following: $...

**6**

votes

**0**answers

100 views

### Finitely presented algebras with isomorphic semilattices of congruences

Let $\mathbb{T}$ be a finitary algebraic theory. For each $\mathbb{T}$-algebra $A$, let $Q (A)$ be the join semilattice of finitely generated congruences on $A$. There is an evident pushforward ...

**3**

votes

**3**answers

234 views

### Semantic reflection

Let $\ulcorner \cdot \urcorner$ be a fixed encoding of formulas by numbers, e.g.
let $\ulcorner \varphi \urcorner$ denote the Godel number of $\varphi$.
Let $T$ be a first-order arithmetic theory, e....

**7**

votes

**2**answers

214 views

### How to extend Morley's omitting type theorem to uncountable languages?

In his 1965 paper Omitting Classes of Elements (found in The Theory of Models: Proceedings of the 1963 International Symposium at Berkeley, published by North-Holland Publ. Co., Amsterdam (1965)), ...

**10**

votes

**1**answer

376 views

### Extending an infinite simple group

Maybe the question does not fit here.
Yesterday in my logic course, I presented a nice example about an application of model theory to group theory. The example is due to Hodges and as following: For ...

**26**

votes

**0**answers

589 views

### Where do uncountable models collapse to?

Suppose $T$ is a complete first-order theory (in an finite, or at worst countable, language). Given any model $\mathcal{M}\models T$ of cardinality $\kappa$, we can ask whether $\mathcal{M}$ can be ...

**11**

votes

**1**answer

273 views

### Can there be computable non-standard models of PA in a weaker sense?

By Tennenbaum's theorem, in the usual sense of computability for models,
neither addition nor multiplication can be computable in a non-standard model of PA.
Weak version:
Can addition or ...

**9**

votes

**0**answers

159 views

### From interpolation to separation

Lusin's separation theorem states that, if $A$ and $B$ are disjoint analytic subsets of a Polish space, then there is a Borel set $X$ separating them ($A\subseteq X$, $B\cap X=\emptyset$). Craig's ...

**13**

votes

**1**answer

234 views

### Near model completeness

A theory $T$ is called near model complete if every formula is equivalent to a Boolean combination of existential formulas mod $T$. I wonder whether there is an equivalent "semantic" definition of ...

**9**

votes

**1**answer

122 views

### Does non-stablity imply that there is a difference between non-forking and coheir extension

Fix some theory $T$.
Let $p$ be a type over some Model M and let $q$ be some global extension of $p$.
Note:
The number of global coheirs of $p$ is bounded by the number of ultrafilters on $M$.
Also ...

**6**

votes

**0**answers

122 views

### model theory of non-reduced schemes

In model theory one studies Boolean algebras of definable sets of complete theories. For many theories definable sets are in direct correspondence with geometric objects, for example, definable sets ...

**8**

votes

**0**answers

108 views

### Two cardinal obstructions

Given a theory $T$ and a formula $\phi(x)$ we say that they admit a $(\kappa, \lambda)$ model if there is a model $M$ such that $|M| = \kappa$ and $|\phi(M)| = \lambda$.
In all examples that I know ...

**3**

votes

**1**answer

113 views

### Scott Rank of Models of Infinitary Sentences

Let $\mathscr{L}$ be a recursive language. Let $\varphi$ be a $\mathscr{L}_{\omega_1 \omega}$-sentence and $\varphi \in L_{\omega_1^\emptyset}$. (Let $\varphi$ be a computably infinitary formula.) Let ...

**1**

vote

**2**answers

142 views

### Precise interpretability strength of $\mathcal P_{DF}(\omega)$ and $L_{\omega_1^{CK}}$

I am curious about the relationship between the definable power set of $\omega$ and the $\omega_1^{CK}$th level of the constructible sets $L$.
In short, $\omega_1^{CK}$ is the least nonrecursive ...

**2**

votes

**0**answers

111 views

### Is the dg-nerve functor a Quillen equivalence?

Lurie defines the dg-nerve $N_{dg}(\mathcal{C})$ of a dg-category $\mathcal{C}$ in Higher Algebra Construction 1.3.1.6: for each $n \geq 0$, we define $N_{dg}(\mathcal{C})_n\simeq \text{Hom}_{\mathcal{...

**3**

votes

**1**answer

242 views

### History of unstable formulas [closed]

There are many equivalent definitions for stability, one of them being that being unstable is equivalent to the existence of a formula having the order property.
While intuitively it makes sense that ...

**3**

votes

**1**answer

261 views

### Löwenheim-Skolem for many-sorted theories

Let $L$ be a many-sorted first order language, and let $\kappa$ be an infinite cardinal which is greater than or equal to the number of function and relation symbols in $L$. Let $T$ be a complete ...

**0**

votes

**0**answers

144 views

### Minimum regular open set containing a given set in a T0 Alexandrov topological space

What is known about the minimum regular open set containing a given set in a T$_0$ Alexandrov topological space? I'm particularly interested in the condition for the minimum set happening to be first-...

**5**

votes

**1**answer

165 views

### Do models-and-homomorphisms always form an accessible category?

It's well-known that the category of models of any first-order theory $T$ form an accessible category if we take the elementary embeddings as morphisms. This is true in finitary first-order logic or ...

**2**

votes

**0**answers

94 views

### Nice model theoretic properties of a theory after adding predicates

I would like to know what nice model theoretic properties (for example simplicity, NIP, stability, etc) can be preserved when we add a new predicate to the language.
Explicitly, if T is an L-theory ...

**2**

votes

**1**answer

229 views

### Classification Theory

It is often said that unsuperstable theories do not admit a classification in the sense of Shelah. Why exactly is this so? And also what exactly does in the sense of Shelah mean? It is hand waved in a ...

**3**

votes

**1**answer

209 views

### Number of non-isomorphic models

I had this question up on Math stackexchange: http://math.stackexchange.com/questions/1349247/number-of-non-isomorphic-models/1350763#1350763 . While it was answered partially there, I'm posting here ...

**4**

votes

**2**answers

204 views

### Non-Forking and Related Concepts

Is the importance of developing forking machinery in the way we set it up, or is it in the fact that it allows us to come up with a notion of independence via the properties of non-forking? I'm ...

**5**

votes

**0**answers

107 views

### Lascar strong types in fragments of arithmetic

Are Lascar strong types (definition below) in models of fragments of arithmetic always type definable? (They trivially are, in models of full induction.)
Definition Given a saturated model ${\cal M}$ ...

**0**

votes

**1**answer

234 views

### Provability of unprovability

I have three questions (without any real background, this is just something I've been wondering about recently)
Can PA prove that PA can't prove nor disprove, say, Goodstein theorem (or any natural ...

**5**

votes

**0**answers

109 views

### O-Minimal sentences in $L_{\omega_1,\omega}$?

Is there any meaningful sense in which we can talk about o-minimal sentences of $L_{\omega_1,\omega}$? I can give a first attempt, easily; given a countable fragment $F$ and a sentence $\Phi$ in that ...

**2**

votes

**1**answer

177 views

### Epsilon-approximations of set systems with finite VC-dimension

ECorollary 6.9 in A Guide to NIP theories by Pierre Simon proves the following
Theorem. For every positive integer $k$ and every positive real $\varepsilon$ there is an integer $n=n(k,\epsilon)$ ...

**5**

votes

**1**answer

254 views

### Looking for reference or proof to some facts stated on Anand Pillay's book

In my current work I am using facts 2.1.11 and 2.1.12 from Anand Pillay's book Geometric Stability Theory.
The facts are stated as follows:
Fact 2.1.11. Let $(S,\mbox{cl})$ be a locally ...

**6**

votes

**1**answer

333 views

### If two structures are elementarily equivalent, is there a zigzag of elementary embeddings between them?

Fix a first-order signature $\Sigma$. There is an equivalence relation $\sim$ on the class $\Sigma\mathrm{-Str}$ of all $\Sigma$-structures given by $M \sim N$ iff $M$ and $N$ are elementarily ...

**1**

vote

**1**answer

347 views

### Is second-order ZFC categorical with regard to its proper class models

Second-order ZFC offers partial categoricity in the sense that, given any two models, one of them must be isomorphic to an initial segment of the other [1]. However, this leaves questions regarding ...

**2**

votes

**1**answer

239 views

### Is there a 'largest' second-order categorical axiomatization of set theory, extended from ZFC2

While it's possible to obtain categorical second-order axiomatizations of set theory by extending ZFC2 with additional axioms (see [1]), these axioms tend to be somewhat arbitrary (e.g. adding an ...

**4**

votes

**0**answers

128 views

### Is the lowenheim-skolem number of nth order logic larger than the corresponding number for 2nd order logic

According to this paper, by Vaananen, the $LS$ number for $2^{nd}$ order logic is given by "the supremum of $Π_{2}$-definable ordinals", where "The Lowenheim-Skolem number $LS(L)$ of $L$ is the ...

**18**

votes

**4**answers

752 views

### Is there a Leibnizian model with no definable elements, in a finite language?

A first-order structure $M$ is Leibnizian, if any two distinct
elements $a,b\in M$ satisfy different $1$-types; that is, if there
is some formula $\varphi$ such that $M\models\varphi(a)$ and
$M\models\...

**8**

votes

**2**answers

325 views

### Around Vopěnka: Accessible category with small full discrete subcategories of arbitrary size?

I believe the model-theoretic version of the question is: is there a theory in finitary first-order logic which has, for each cardinal $\lambda$, a set $C_\lambda$ of $\lambda$-many models, such that ...

**1**

vote

**0**answers

136 views

### What can be said about a Boolean-valued structure from what the Boolean-valued forcing extension thinks about it?

Suppose that $\phi$ is a formula in the language of set theory such that
there are some $n_{1},...,n_{k}$ such that if $V\models\phi(x)$, then $x=(X,R_{1},...,R_{k})$ and $\mathrm{Eq}:X^{2}\...

**13**

votes

**2**answers

969 views

### When does Vopěnka's principle hold?

Vopěnka's principle (VP) is the statement that, given any proper class $\{\mathcal{A}_\eta: \eta\in ON\}$ of first-order structures in the same language, there are some $\alpha\not=\beta$ with $\...

**5**

votes

**1**answer

116 views

### When is a formula preserved under taking factors in a reduced product or the stalk in a Boolean product?

I want to know if there is a nice characterization of when a formula is preserved under taking reduced factors.
We say that a formula $\phi$ is closed under taking reduced factors if whenever $I$ is ...