# Tagged Questions

Model theory is the study of (classes of) mathematical structures (e.g. groups, fields, graphs, universes of set theory) using tools from mathematical logic. Objects of study in model theory are models for formal languages which are structures that give meaning to the sentences of these formal ...

39 views

### Are ($Q$, $\leq$) and ($Q \times Q$, $\leq _e$) isomorphic? [duplicate]

I can't really tell if ($Q$, $\leq$)$\cong$($Q \times Q$, $\leq _e$), where $\leq_e$ denotes the left lexicographic order. Neither have a last/first element, both are dense and have the same ...
48 views

### Extending the language in Henkin style completeness proof for first-order logic

There is a detail in the Henkin style proof of completeness for first order logic that I can't quite understand. So in the first part (Lindenbaum's Lemma), we need to show that a consistent set of ...
774 views

### Does a finite first-order theory which has a model always have a finite model?

I'm curious whether this is true or not: Let T be a finite, first-order theory. If T has a model, then T has a finite model. I would assume the answer is 'yes', but I wanted to make sure I haven'...
58 views

### Definibility of $\mathbb{Z}$ in product rings

If $R$ is a product ring whose factors are in a finite number and are all quotients of $\mathbb{Z}$ (that is, either $\mathbb{Z}$ or $\mathbb{Z}_n$'s ), is it a sufficient and necessary condition for ...
68 views

### Boolean model containing both confusion and junk

I'm doing a course in Equational Programming, and really new to these materials. So we got a specification for Booleans: ...
97 views

### Is $\mathbb Z$ first-order definable in (the ring) $\mathbb{Z\times Z}$?

Is $\mathbb Z$ first-order definable in $\mathbb{Z\times Z}$ (using sum and product but obviously not the concept of "component")? I believe no but how may I prove it? Is this standard?
77 views

### Is it possible to formalize $T \models \sigma$ within the deductive calculus?

I know that the notion of $T \vdash \sigma$ is formalizable within any sufficiently powerful theory $T$ but is $T \models \sigma$ formalizable as well? How is this possible if there are infinitely ...
27 views

### On the existence of finite substructures when sufficient chain conditions are met

Let $L$ be a language and $T$ and $L$ theory. Suppose that for any $M\models{T}$, we have $M\subseteq{\bigcup{C_{n}}}$, where each $C_{n}\models{T_{\forall}}$ is finite. I want to show that for some ...
24 views

### 1-model complete

For $L$ structures $A$ and $B$ we write $A\preceq_{1}B$ if $A\subseteq{B}$ and $A\models{\varphi(a)}$ iff $B\models{\varphi(a)}$ for any finite tuple (of the correct length) $a$ from $A$ and for any ...
112 views

### Class models of $\mathsf{ZFC}$ and consistency results

First of all, I'm only starting to study independence results in set theory. And there is one obstacle that confuses me a lot. Probably such questions have already been asked, but I haven't found ...
67 views

51 views

### If $\mathcal{T}_1$ and $\mathcal{T}_2$ admit quantifier elimination, does $\mathcal{T}$ admit quantifier elimination?

Let $\mathcal{T}_1$ and $\mathcal{T}_2$ be theories with disjoint signatures $\mathcal{L}_1, \mathcal{L}_2$. Form a new language $\mathcal{L} = \mathcal{L}_1 \cup \mathcal{L}_2 \cup \{P_1, P_2\}$, ...
92 views

### How do we know $\mathbb{N}$ is a model of Peano Arithmetic?

The induction axiom in the theory of Peano Arithmetic (PA) is actually an axiom scheme such that for every formula $\phi(x,\bar{y})$ with free variables $x,\bar{y}$ ($\bar{y}$ being a string of ...
48 views

### Hodges exercise 2.7.1: Quantifier elimination in dense linear orderings

In Hodges' A Shorter Model Theory, exercise 2.7.1 tells you to prove theorem 2.7.1, which says that the following five formulas are an elimination $\Phi$ set for the class of all dense linear ...
37 views

### two different realization of one type

Im having trouble solving this problem: Let $M$ be a saturated structure of cardinality $\kappa$. Let $A\subseteq |M|$ with $|A|<\kappa$. Then there is a type $p\in S_1(A)$ with two different ...
92 views

### What does the theory of the empty set look like?

I know next to nothing about logic, but I was wondering what first order axioms would give rise to the theory of the empty set (that is to a theory whose only model is the empty set)? The problem I ...
140 views

### Detecting incomparability in countable elementary submodel

This might be just an easy exercise in model theory but I can't seem to wrap my head around right now. Let $\theta$ be large enough regular cardinal and $\kappa < \theta$. $(\kappa, \prec)$ is ...
58 views

### Quantifier elimination in infinitary languages

Let $L$ be a first order relational language with identity. Let $E$ be an $L$-structure. Let $L_{\alpha\beta}$ be the usual infinitary extension of $L$. Thus, $E$ is an $L_{\alpha\beta}$-structure ...
22 views

### satisfaction of a set in the expanded language

Consider a set $\Gamma$ of formula which is satisfiable in language $\mathcal{L}$. let $\mathcal{L'} \supseteq \mathcal{L}$ be any expansion. then is $\Gamma$ satisfiable in $\mathcal{L'}$? I can ...
91 views

### Elimination of quantifiers

What does it mean that a theory admits constructive elimination of quantifiers? A theory admits elimination of quantifiers when each formula of the theory is equivalent to a quanifier-free formula, ...
57 views

### bound and free variables

I have a question that has been bothering me for quite some time. In second order logic sometimes there is an indication that a variable can be both bound and free. The simplest example I can give is ...
67 views

### Why can't an $\omega$-stable theory have finitely many countable models?

This is a "well-known fact," but I'm at a loss to finding a proof. I could swear I've read it somewhere, but checking the handful of places I'm used to checking doesn't help. Google gives nothing, ...