**9**

votes

**2**answers

449 views

### What is the precise notion of “enough arithmetic” in Godel's first Incompleteness theorem?

I'm trying to reconstruct the proof of Godel's first theorem (Rosser's strong version) from the uncomputability of the Halting function. If we just started with the language $\mathcal{L}=\{0, S, +, ...

**8**

votes

**2**answers

317 views

### The (non-)absoluteness of second-order elementary equivalence

Elementary equivalence is set-theoretically absolute between any two transitive models of set theory; this is also true for the infinitary logics - e.g., $\mathcal{L}_{\omega_1\omega}$ - at least, ...

**1**

vote

**1**answer

102 views

### Preserving Predimension Functions under Functional Convergences

Definition 1. If $\mathcal{L}$ is a countable relational language, a predimension class $C$ is a class of $\mathcal{L}$-structures with the following properties:
C1: ...

**2**

votes

**0**answers

116 views

### Preimages of accessible full subcategories

My question is ultimately about the model theory of $L_{\infty, \omega}$, but it is more convenient to phrase it in terms of category theory. Suppose I have finitely accessible categories ...

**4**

votes

**1**answer

154 views

### Stable examples from Algebra such that the model theoretic algebraic closure of a substructre is no model

Let $T$ be a stable theory. Let $A$ be a subset or substructure of a model $M$ of $T$. Now in some theories the (model theoretic) algebraic closure of $A$ is already a (sub)model of $T$. For example, ...

**4**

votes

**0**answers

106 views

### Relation between fundamental theorem of Ehrenfeucht-Fraisse games and notions of bisimulation and simulation

Vijay D alluded to the relation between the fundamental theorem of Ehrenfeucht-Fraisse games and notions of bisimulation and simulation in response to the whats-a-magical-theorem-in-logic question.
...

**9**

votes

**3**answers

360 views

### Is a model of arithmetic contained in a model of arithmetic an initial segment?

It's easy enough to show that if $\mathbb{N}_1$ is a non-standard model of the Peano axioms, then there is a canonical embedding $\mathbb{N} \to \mathbb{N}_1$, and we have a theorem that if $x \in ...

**10**

votes

**0**answers

162 views

### Maximality of linear orders in the Keisler order on theories

Recently Malliaris and Shelah (see their preprint http://math.uchicago.edu/~mem/Malliaris-Shelah-CST.pdf) have shown that theories with $SOP_2$ are maximal in the Keisler order. A preceding result of ...

**1**

vote

**1**answer

410 views

### Compactness and completeness in Gödel logic

The standard proof of the completeness theorem in first-order Gödel logic is based
on a first-order countable language. I want to know that is there any proof of the completeness theorem in ...

**3**

votes

**0**answers

146 views

### Equational theories determined by “identities without variables”

How to characterize equational theories $T$ which have the following property: for any two terms $t(x_1,...,x_n)$ and $t'(x_1,...,x_n)$ in the signature of $T$, if for any closed terms (i. e. terms ...

**1**

vote

**0**answers

80 views

### unique types and decidability

Suppose $\mathcal{M}$ is an infinite structure which has the property that every type that is realised is realised uniquely. Also assume that every element of $\mathcal{M}$ is definable but there is ...

**3**

votes

**1**answer

234 views

### Colorful model theory

There are a number of concepts in model theory - often situated around Hrushovski's amalgamation method (see for instance http://math.univ-lyon1.fr/~wagner/nijmegen.pdf) - which are colorfully named:
...

**6**

votes

**1**answer

187 views

### Morley Phenomena for Special Families of Reals

Vaught's Conjecture is a dual form of Continuum Hypothesis in model theory. It asserts that for each complete consistent theory $T$ in a countable language if $I(T,\aleph_{0})>\aleph_{0}$ then ...

**4**

votes

**1**answer

121 views

### Replace Morley sequence over some set by one over a finite set, s.t. they both satiesfy a certain formula

Let $T$ be a stable $L$-theory with elimination of imaginaries. We work in the monster model $\mathfrak C$ of $T$. Let $A$ be a small (infinite) set of the monster, $\phi(x,y)$ be a $L(A)$-formula and ...

**3**

votes

**1**answer

143 views

### Algebraically closed fields with only definable automorphisms

According to the paper "Models with second order properties IV. A general method and eliminating diamonds" by Shelah, he constructs ordered fields with only definable automorphisms.
I haven't read ...

**1**

vote

**3**answers

296 views

### Can the structure of an ultrafilter determine the structure of its ultrapower?

Usually we work with ultrafilters as pure sets without any structure.
Q1. Is there any important notion of structure on an ultrafilter?
Q2. Is there any non-trivial notion of structure on ...

**10**

votes

**3**answers

891 views

### Is it ever a good idea to use Keisler-Shelah to show elementary equivalence?

The most useful way I know to show that two structures are elementarily equivalent is Ehrenfeucht-Fraisse games. These are quite nice and intuitive, and even when I can't use them to solve my problem ...

**0**

votes

**0**answers

23 views

### CRAM[t(n) \subseteq IND[t(n)]

In the proof of lemma 5.3 in Immerman's descriptive complexity (CRAM[t(n) \subseteq IND[t(n)]), he mentions a disjunction depending on the value of the processor's program counter at the "directly" ...

**4**

votes

**1**answer

141 views

### Finite generation of vector identities

This question is partially motivated by Looking for a comprehensive referece for vector identities, although that question may not be appropriate for MO.
Consider the set $\mathcal{E}$ of all valid ...

**5**

votes

**1**answer

194 views

### A ZFC construction to get a proper extension which is a $\omega_1$-model

In $V$, let me call a set theory structure A is a $\omega_1$ model if the $\omega_1$ of $A$ is the same as the $\omega_1$ in $V$ (up to isomorphism). The question I would like to ask is the following: ...

**2**

votes

**0**answers

42 views

### quantifier rank and number of variables as complexity measures

Is there a property of finite structures expressible with a sentence using only 2 variables and quantifier rank n but not expressible by any sentence with more variables and quantifier rank less than ...

**13**

votes

**3**answers

460 views

### Varieties where every algebra is free

I'd like to know more about varieties (in the sense of universal algebra) where every algebra is free. Another way to state the condition is that the comparison functor from the Kleisli category to ...

**8**

votes

**2**answers

241 views

### Vaught's conjecture for partial orders

In
``Steel, John R. On Vaught's conjecture. Cabal Seminar 76–77, pp. 193–208''
the following is proved:
Theorem. Let $\phi\in L_{\omega_1,\omega}.$ If every model of $\phi$ is a tree, then $\phi$ has ...

**2**

votes

**3**answers

391 views

### Can a Decidable Theory Have Non-recursive Models?

Tennenbaums' theorem proves neither addition nor multiplication can be recursive in any countable non-standard model of arithmetic. Tennenbaum's proof applies to theories much weaker than PA.
...

**4**

votes

**2**answers

303 views

### Forcing for Arbitrary First Order Theories

Forcing is a relative model construction method for models of $ZF$ as a particular first order theory using models of another first order theory (forcing companion) that in this case is the theory of ...

**3**

votes

**3**answers

322 views

### Godel's Second Incompleteness theorem and Models

As I understand it, Godel's completeness theorem essentially says that if a sentence $\phi$ can be proven in a first order theory $\Gamma$, then $\phi$ is satisfied in all models $\mathcal{U}$ of ...

**7**

votes

**0**answers

188 views

### “Fraïssé limits” without amalgamation

All structures are countable with countable signature.
Given a structure $\mathcal{A}$, the age of $\mathcal{A}$, $Age(\mathcal{A})$, is the set of structures isomorphic to finitely-generated ...

**7**

votes

**1**answer

241 views

### Fields of characteristic zero via ultraproducts

Is every noncountable field of characteristic zero the ultraproduct (using a non principal ultrafilter over the set of prime numbers) of fields of positive characteristic?

**6**

votes

**1**answer

318 views

### Can an ultraproduct be infinite countable?

In exercise 4 page 456 of Hodges "Model Theory" it is required to show that if an ultrafilter $\mathcal{U}$ is not $\omega_1$-complete, then every ultraproduct $\prod_I A_i/ \mathcal{U}$ has ...

**4**

votes

**0**answers

86 views

### Stabilization of recursive approximation in $PA^-+I\Sigma_1^0$

Over any model M of $PA^-+I\Sigma_1^0$. Suppose $A\in [T]$ where $T$ is a $\Delta_2^0$-tree and $A$ is one isolated path. Further, $A$ is regular, i.e. $\forall n A\upharpoonright n$ has a code in ...

**2**

votes

**0**answers

150 views

### Algebras admitting quantifier elimination

I apologize if this question is meaningless or trivial:
What are examples of Algebras admitting quantifier elimination? Especially are there Groups admitting quantifier elimination?
I need to say ...

**24**

votes

**1**answer

2k views

### A preprint of Sela concerning the work of Kharlampovich-Miyasnikov

Yesterday, Z. Sela published a preprint in arXiv which claims that the solution of Olga Kharlampovich and Alexi Miyasnikov for the Tarski problem on decidablity of the first order theories of free ...

**0**

votes

**3**answers

138 views

### Negated varieties and their relatively free algebras

During the past days, I asked some questions in order to gain a clear understanding of the notion of "free algebras". I suppose that the question below is the most clear image of the concept I have ...

**4**

votes

**3**answers

254 views

### The existence of an algebra whose set of identities and first order theory are equivalent

Is there an algebra $A$ (for example a group) such that $Th(A)$ is logically equivalent to $id(A)$? In other words, is there an algebra $A$ such that
$$
Mod(Th(A))=Var(A)?
$$
Clearly finite algebras ...

**0**

votes

**1**answer

153 views

### relatively free groups in $Var(S_3)$

Suppose $S_3$ is the symmetric group of order 6. Which elements of the variety $Var(S_3)$ are relatively free?
This question is related to my previous question
Relatively free algebras in a variety ...

**5**

votes

**2**answers

222 views

### Universal graphs on higher cardinals

The Rado graph contains every finite graph as induced subgraph, and its also holds for countable graphs. So it is an universal graph of size $\aleph_0$, which contains all graphs of size $\aleph_0$ as ...

**4**

votes

**0**answers

207 views

### Stability of analytic Zariski structures

Noetherian Zariski structures are introduced by Hrushovski and Zilber(1996).
An analytic Zariski structure is a generalization of Noetherian Zariski structures, introduced by Zilber and Peatfield.
...

**11**

votes

**1**answer

232 views

### Is “approximate categoricity” absolute?

Let $T$ be a countable first-order theory, and assume that $T$ has exactly one atomic model up to isomorphism in every uncountable cardinality. (By "atomic" I mean a model which omits the ...

**3**

votes

**0**answers

119 views

### Peano (Dedekind) categoricity

What is the smallest fragment of second order logic such that $Th(\mathbb{N})$ in that logic is categorical (only one model, namely natural numbers, up to isomorphism). For example, can we do this in ...

**6**

votes

**1**answer

251 views

### Recursive ordinals and the minimal standard model of ZF

Does the minimal standard model of ZF contain all recursive ordinals or is it limited (probably by the proof theoretic ordinal of ZF as I suspect but cannot prove)?
Paul J. Cohen's definition of the ...

**0**

votes

**1**answer

314 views

### Recursive Non-standard Models of Modular Arithmetic? [closed]

Any algebraically closed field (ACF) is a model of Modular arithmetic (MA). (MA) has the same axioms as first order Peano arithmetic (PA) except $\forall x(Sx \neq 0)$ is replaced with $\exists ...

**3**

votes

**1**answer

139 views

### Outer Definability of a Class

Definition: Let $C$ be a class of sets and $\mathcal{L}$ a first order relational language. We say $C$ is "outer definable" by $\mathcal{L}$ if there is a first order theory $T$ and for each $n_{R}$ - ...

**50**

votes

**4**answers

2k views

### Is there a 0-1 law for the theory of groups?

Several months ago, Dominik asked the question Is there a 0-1 law for the theory of groups? on mathstackexchange, but although his question received attention there is still no answer. By asking the ...

**6**

votes

**1**answer

240 views

### Generalizations of Birkhoff's HSP Theorem

Let $\mathbf{C}$ be the class of algebraic structures of some fixed type satisfying some sentence $\phi$. Birkhoff's HSP theorem says that $\mathbf{C}$ is closed under homomorphisms, subalgebras and ...

**2**

votes

**1**answer

219 views

### $(\kappa,\lambda)$ - Minimal Models & Stronger Version of Rowbottom's Theorem

Definition 1: Let $M$ be a $\mathcal{L}$ - structure and $A\subseteq Dom(M)$. Define:
$Def_{A}(M):=\{X\subseteq Dom(M)~|~\exists n\in \omega~~\exists \varphi (x,y_1,...,y_n)\in ...

**1**

vote

**1**answer

259 views

### $(\kappa , \lambda)$ - Minimal Models of $\text{ZF}$

The notion of minimality in model theory is related to the existence of a gap in the size of definable subsets of a model. Now consider the following generalization:
Definition 1: Let $M$ be a ...

**2**

votes

**1**answer

377 views

### From elementary equivalence to isomorphism

A few years ago, when I took the basic course in Logic, I was very surprised to discover that given a signature $\sigma$ and two structures $M$ and $N$ of $\sigma$ which are elementarily equivalent ...

**3**

votes

**2**answers

155 views

### Joint Forcing Extension Property

Definition 1: A class $\mathcal{K}$ of countable transitive models of $\text{ZF}$ has strong "joint forcing extension property" (JFEP) iff for all $M,N\in \mathcal{K}$ there are forcing notions ...

**2**

votes

**1**answer

119 views

### Expressing “There are more Fs then Gs” in first-order logic

Is there a sentence of first-order logic that's true in all finite interpretations in which there are more Fs than Gs, and false in all finite interpretations in which there are not more Fs than Gs?
...

**6**

votes

**0**answers

89 views

### What classes of complex manifolds are known to be definable in an o-minimal expansion of the real field?

It is a widely known (perhaps slightly folkloric) fact that compact complex manifolds, understood as first-order structures with a predicate for each analytic subset, are definable in an expansion of ...