Model theory is the branch of mathematical logic which deals with the connection between a formal language and its interpretations, or models.

learn more… | top users | synonyms

4
votes
1answer
134 views

Examples of NIP fields of characteristic $p$

Definition. According to Shelah, a field $K$ does not have the independence property (i.e. is NIP) if for every first order formula $\varphi(x, \bar y)$ in the language of fields $(+,\times,0,1)$, the ...
1
vote
0answers
151 views

Reference request: Models of isomorphic languages result into isomorphic categories

This is basically a reference request by someone who has not been educated as a logician and would like to be rigorous about certain preliminary aspects of model theory. Fix an uncountable universe ...
3
votes
0answers
134 views

Hyperimaginaries and continuous logic

Classical (i.e., discrete) logic is well positioned to study imaginaries in part because the $T^{eq}$ construction allows us to treat imaginary sorts as we would treat any other sort. With ...
4
votes
1answer
198 views

When does an infinite model have a proper class-sized elementary extension?

Suppose that a set of sentences of a 1st order language has an infinite model $M$. Under what conditions is there is a proper class-sized elementary extension of $M$? How does the answer change if ...
9
votes
0answers
314 views

Riemann hypothesis in Zilber's field

Question. What is known about the situation (truth or falsity) of Riemann hypothesis in the Zilber's field?
5
votes
0answers
200 views
+50

Constructive compactness for countable models?

The compactness theorem for countable (Tarski?) models is equivalent to the weak König's lemma by a result of H. Friedman and others as noted here, in the context of classical logic. The weak König's ...
3
votes
1answer
157 views

Compactness in Bishop's constructive mathematics

In Bishop's constructive mathematics, is there any literature on a possible version of the weak König's lemma, or of the compactness theorem for countable models? There is some related information ...
4
votes
1answer
171 views

Are there first order theories of interest to an algebraist or at least a model theorist of large cardinal consistency strength?

I am wondering if there are some first order theories of algebraic structures or structures of interest to model theorists of large cardinal consistency strength or at least unexpectedly high ...
11
votes
1answer
258 views

Intutionistic Robinson Arithmetic

By Friedman translation $HA$ and $PA$ prove the same $\Pi_2$ formulas. Is it true for Intutionistic Robinson arithmetic(Robinson axioms with intutionistic logic) and classic Robinson arithmetic? ...
1
vote
1answer
830 views

What is the modern consensus on the difficulty of infinitesimals?

At a related thread at MSE an expert in reverse mathematics noted that "As the modern consensus is that only nonstandard models have infinitesimals, it will be quite challenging to give a concrete ...
-2
votes
1answer
221 views

A set theory and a model without the empty set [closed]

Im just asking out of curiosity. Is there a set theory $\mathcal T$ and a model $\langle M,E\rangle \vDash \mathcal T$ such that no set in M is empty: $$\left(\forall m\in M \right)\left(\exists n\in ...
1
vote
0answers
60 views

models of $I\exists^+_1$

$\phi$ is a $\exists^+_1$ formula iff it is in language of arithmetic and does not have $\forall$,$\neg$ and $\rightarrow$, therefore $I\exists^+_1$ is theory of $Q$+induction axioms for $\exists^+_1$ ...
23
votes
1answer
637 views

Do the analogies between metamathematics of set theory and arithmetic have some deeper meaning?

By "formal analogies" between the metamathematics of $\mathsf{ZFC}$/set theory and $\mathsf{PA}$(=Peano Arithmetic)/first order arithmetic, I mean facts such as the following: We are considering a ...
16
votes
0answers
435 views

Variant of Conceptual Completeness

Let $\mathcal{C}$ and $\mathcal{D}$ be pretopoi, and let $f: \mathcal{C} \rightarrow \mathcal{D}$ be a pretopos functor (that is, a functor which preserves finite coproducts, finite limits, and ...
2
votes
1answer
113 views

How to show certain theories are not existentially closed

To show that $ZFC$ is not existentially closed, we can use the following forcing argument: Let the ground model can model $V=L$ and the forcing extension model $2^{{\aleph}_{0}}=\aleph_{2}$. (Maybe ...
4
votes
0answers
77 views

Does every model of $I\Delta_0$ has an end extension to a model of $I\Delta_0+\Omega_1$?

Does every model of $I\Delta_0$ has an end extension to a model of $I\Delta_0+\Omega_1$? In End extensions of models of linearly bounded arithmetic paper the author said this problem is open. I ...
3
votes
0answers
77 views

Does Łoś's theorem imply choice given a free ultrafilter?

In the paper "Łoś's theorem and the boolean prime ideal theorem imply axiom of choice" Howard has shown that Łoś's theorem and the boolean prime ideal theorem imply axiom of choice. At the end of the ...
21
votes
9answers
2k 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 ...
21
votes
4answers
1k 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 ...
6
votes
0answers
219 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
1answer
142 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
1answer
298 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 ...
7
votes
0answers
118 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 ...
3
votes
1answer
218 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
3answers
206 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
2answers
477 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
0answers
38 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
1answer
321 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
0answers
143 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
1answer
246 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
1answer
289 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
0answers
92 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
3answers
229 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, ...
7
votes
2answers
197 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
1answer
351 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 ...
24
votes
0answers
523 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
1answer
251 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
0answers
153 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
1answer
217 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
1answer
102 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 ...
5
votes
0answers
108 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
0answers
102 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
1answer
104 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
2answers
141 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
0answers
98 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 ...
3
votes
1answer
236 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
1answer
249 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
0answers
140 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 ...
5
votes
1answer
160 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
0answers
88 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 ...