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

1
vote
1answer
254 views

Self-containing graphs

[Second try, after this question failed.] Let me sketch a notion of self-containing structures by a simple example. Consider the class $\Gamma$ of finite or countable digraphs ("graphs" for short) ...
7
votes
6answers
497 views

Applications of forcing in model theory

What are the major applications of (set theoretic) forcing in model theory?
4
votes
0answers
196 views

Schanuel's conjecture and abstract elementary classes

Are there any connections between Schanuel's conjecture and abstract elementary classes. More precisely Question. Is there any conjecture in abstract elementary classes whose truth implies the ...
5
votes
1answer
147 views

Is there a truth approximation on a‎ cumulative hierarchy‎‎‎‎?

‎‎‎Note ‎to ‎the ‎following ‎well known theorem:‎ Theorem (1): ‎If ‎‎$‎‎\kappa‎‎$ ‎be a ‎‎"measurable" ‎cardinal ‎and ‎‎$‎‎‎\mathcal{F}‎$ be a‎ ‎"non-principal ‎$‎‎‎\kappa‎$-complete normal‎" ...
4
votes
1answer
186 views

“Small” subfields of algebraically closed fields

Sufficient background: Let $\mathcal{M}=(M,...)$ be an $\mathcal{L}$-structure and $X\subset M$. Definition. $X$ is large if there exists a function $f:\mathcal{M}^n \overset {\leq k} \rightarrow ...
6
votes
0answers
186 views

Krull dimension and Morley rank

Definition : A Topological space $\mathcal{D}$ is called noetherian if it satisfies the descending chain condition for closed subsets. We define the dimension of $\mathcal{D}$ to be the supremum of ...
13
votes
0answers
774 views

Hrushovski's Construction

Zilber expressed a conjecture for $\aleph_{1}$- categorical theories (In the 80s). Zilber's Conjecture: The geometry of any $\aleph_{1}$- categorical structure is one of the following: (a) Trivial ...
18
votes
1answer
768 views

Main open computational problems in quantifier elimination?

A language is said to have quantifier elimination if every first-order-logic sentence in the language can be shown to be equivalent to a quantifier-free sentence, i.e., a sentence without any ...
6
votes
1answer
664 views

Is there a monster behind the trees?

‎First Fix the following notation:‎ ‎ $‎‎\forall ‎\kappa‎\in Card~~~Tp(‎\kappa‎):="‎\kappa‎~has~tree~property"$‎ ‎‎‎‎ The large cardinals as "monsters of heaven" live everywhere in the land of ...
5
votes
0answers
88 views

Can the isomorphism relation for countable models become harder when adding finitely many constants?

I am particularly interesting in the case where $T$ is o-minimal, but I would be interested in any theory $T$ (or even an $L_{\omega_1,\omega}$-sentence) which has this property. Context: view the ...
2
votes
0answers
372 views

Deducing Skolem's nonstandard integers from downward Lowenheim-Skolem?

If one has a nonstandard model $\mathcal{N}$ of PA and adjoins to the first-order theory the countable list of axioms $1<H,\, 2<H,\, 3<H, \ldots$ (satisfied in $\mathcal{N}$) for all the ...
6
votes
0answers
180 views

Axiomatizations of the real exponential field

According to Marker's "Model Theory: An Introduction", the real exponential field has a $\forall\exists$ axiomatization (because it is model complete) but no-one has any idea what such an ...
3
votes
0answers
86 views

Is a proconstructible subsemigroup of $M_n(\mathbb{C})$ an intersection of constructible subsemigroups?

Let $S$ be a proconstructible subsemigroup of $M_n(\mathbb{C})$, that is a subsemigroup which is an intersection of constructible sets. Is $S$ an intersection of constructible subsemigroups? The ...
6
votes
1answer
246 views

Vopenka's Principle for non-first-order logics

(For simplicity, the background theory for this post is NBG, a set theory directly treating proper classes which is a conservative extension of ZFC.) Vopenka's Principle ($VP$) states that, given any ...
3
votes
0answers
167 views

strong order property in continuous logic

I am wondering what is the accepted version of the strong order property in continuous logic. The definition for classical logic is as follows: $T$ has SOP$_n$ (for $n\geq 3$) if there is a formula ...
14
votes
1answer
209 views

Existence property for ordered fields

A theory $T$ has the existence property (EP) if the following holds: Let $\phi(x)$ be a formula with one free variable (and no parameters) such that $T \vdash (\exists x) \phi(x)$. Then there is ...
3
votes
1answer
447 views
1
vote
0answers
62 views

a regular type of U-rank > 1 in the theory of compact complex spaces

What is an example, in the theory of compact complex spaces, of a regular (i.e. orthogonal to all its forking extensions) type which is of U-rank strictly greater than 1? update: after witnessing ...
1
vote
2answers
280 views

Embedding of consistent subset in first order logic (finitely many variables)

I am looking at FOL with no equality, no constant, no function symbol and the unique binary predicate $\in$ with variables in arbitrary sets $V$ or $W$. Specifically we define ${\bf P}(V)$ as the free ...
2
votes
0answers
126 views

topology generated by irreducible componets of $\Gamma$-invariant closed sets

For an analytic space $U$ equipped with an action of a group $\Gamma$, call a subset $Z\subseteq U$ $\Gamma$-closed iff it is a closed analytic subset and each of its irreducible components is an ...
7
votes
1answer
154 views

Definability of Morley rank in the theory of Compact Complex Spaces(CCS)

Is there a counter-example showing that Morley rank in the theory of compact complex spaces (as defined by Zilber, Pillay, Moosa, ...) is not definable in families? Given the existence of such a ...
7
votes
1answer
243 views

Iterating definability

An odd -- probably basic -- question about model theory: For $\mathcal{M}$ a structure in a (first-order) signature $\Sigma$, let $\mathcal{M}'$ be the structure in signature $\Sigma\sqcup\lbrace ...
6
votes
0answers
240 views

Is there Ultracoproduct-like construction for topological spaces in general?

In http://arxiv.org/pdf/math/9704205.pdf they define the ultracoproduct of a sequence of compact Hausdorff spaces, $\sum_\mathcal{U}X_i$ along an ultrafilter $\mathcal{U}$ as the Wallman-Frink ...
3
votes
0answers
164 views

Saturated Ehrenfeucht-Mostowski models

Inspired by this question on MSE I tried to prove the following: Let $T$ be a complete theory in a first order language and $\kappa$ a cardinal. If $T$ is $\kappa$-stable, then there exists a ...
31
votes
1answer
972 views

Is $π$ definable in $(\Bbb R,0,1,+,×,<,\exp)$?

(This question is originally from Math.SE, where it didn't receive any answers.) Is there a first-order formula $\phi(x) $ with exactly one free variable $ x $ in the language of ordered fields ...
4
votes
1answer
188 views

Replacement axiom and existence of end-extensions (Chang and Keisler's Model Theory)

I am currently reading Chang and Keisler's model theory textbook, and there is something that I don't seem to be able to understand about their proof (through the Omitting Types Theorem) that every ...
7
votes
1answer
953 views

Is the first-order theory (with =) of real numbers with addition and multiplication complete and decidable?

Due to Andreas Blass's answer to my question "Is the feasibility of a system of nonlinear, non-convex equations (inequalities) decidable?", i have now investigated real closed fields (RCF), because i ...
1
vote
0answers
149 views

Self-modelling structures

Consider - for the sake of simplicity - only graphs as structures. For undirected graphs $(V, E\subseteq \binom{V}{2})$ let $E(v)$ be the set of edges $e\in E$ incident with $v$, i.e. $\lbrace e ...
2
votes
1answer
239 views

Every abelian torsion-free group is strictly totally orderable (via the compactness theorem)

Let $\mathbb G = (G, +)$ be a group. We say that $\mathbb G$ is strictly totally orderable (others would say bi-orderable) if there exists a total order $\preceq$ on $G$ such that $x+z \prec y + z$ ...
3
votes
0answers
163 views

Is there a useful Galois connection between Languages and Grammars?

I've just beginning to learn logic and proof theory - and the following rather vague and perhaps ill-formed question occurred to me. Given an alphabet it's straightforward to construct the Language, ...
1
vote
1answer
165 views

Importance of Denjoy-Carleman classes as a class.

Denjoy-Carleman classes of differentiable functions, say in Roumieu's form: Given a log-convex sequence $M_n$ of positive number denote by $C_M=C_M(\mathbb{R}^n,0)$ the ring of germs of ...
2
votes
1answer
172 views

dp-minimality and stability

What are some of the common popular stable theories that are known to be dp-minimal (or not dp-minimal)? Some dp-minimal examples I am aware of are strongly minimal theories, superstable theories of ...
1
vote
1answer
224 views

Elementary extensions and type spaces

If $M$ and $N$ are two $L$-structures, and $f: M \rightarrow N$ is an elementary extension, then given any subset $A$ of $M$, $f$ induces in a natural way a morphism $S^M_n(A) \rightarrow S^N_n(f(A))$ ...
3
votes
2answers
203 views

Validity in Kripke frames whose points are finite or infinite sequences

Suppose $D$ is a non-empty set and $\{ R_i : i \in \mathbb{N} \}$ is a family of binary relations on sequences over $D$ so that $R_i \subseteq D^i \times D^i$. Let $R_\omega \subseteq D^\omega \times ...
12
votes
1answer
452 views

First order decidability of rings vs Diophantine decidability

Are there known (preferably ``concrete'') examples of a ring $R$ (commutative, with 1) such that: $\bullet$ the first order theory of $R$ is undecidable, but $\bullet$ the positive existential (= ...
1
vote
2answers
136 views

Approximating a function via definable functions II

In a previous post I asked about the definability of a function that can be "approximated" by a uniformly definable family of functions. Nevertheless, the notion of approximation I gave was too weak ...
1
vote
1answer
177 views

Approximating a function via definable functions

Let $T$ be a first order theory, $M$ a model of $T$ equipped with a topology with a definable basis (i.e. every basic open is definable with parameters). Let $F: M\rightarrow M$ be a partial function ...
3
votes
4answers
350 views

A Fraïssé class without the strong amalgamation property.

I am trying to find some examples of Fraïssé classes that do not have the strong amalgamation property. Anyone?
2
votes
1answer
200 views

Definability in a language with a single binary predicate

Let the first-order language ${\mathcal{L}}$ have a single binary predicate $P$. Consider the structure whose underlying set is ${\mathbb{Z}}$, the integers, and an ordered pair $(m,n)$ is in $P$ if ...
3
votes
1answer
269 views

Barwise compactness theorem

In Admissible Sets and Structures, page 101, theorem 5.8, Barwise introduces a weird form of his compactness theorem in which there are two theories $T$ and $T'$ both $\Sigma_1$, such that every ...
1
vote
1answer
845 views

Are there non-commutative models of arithmetic which have a prime number structure?

Peano Arithmetic (PA) models have a prime number structure and commutativity of addition and multiplication. Presburger arithmetic (PrA) models of arithmetic have addition without multiplication and ...
1
vote
1answer
227 views

A (seem to be) elementary logic question

Given language $L$. $P$ is a 1-place predicate in $L$. Let language $L_0 = L \setminus \{P\}$. Let $\sigma$ be a sentence of $L$ (may contain symbol $P$). $\mathfrak{A}$ is a structure of $L$, and ...
2
votes
1answer
441 views

What follows from assuming not Con(ZF)?

Hello. Let $\operatorname{sat} X$ denote the satisfiability of a theory $X$. From Gödel's second incompleteness theorem and his completeness theorem follows $$ZF \not\vdash \lceil \operatorname{sat} ...
1
vote
0answers
161 views

What are the enforceable models of local artinian rings?

I was reading Hodges' "Model Theory" Chapter 8 a propos existentially closed models of $\forall_2$ theories in a countable first order language $L$. He extends the proof of the omitting type theorem ...
0
votes
0answers
285 views

Definitions for Oddness

In the thread Even Xor Odd Infinities I defined odd models of Modular Arithmetic (MA) as models satisfying the axioms of MA and two first order statements. Even XOR Odd Infinities? $O1) \forall x(x=0 ...
5
votes
1answer
280 views

Is there any o-minimal expansion of the real field with functions of growth higher than exponential?

Let $\bar{\mathbb{R}}$ be the structure of the real field, that is $(\mathbb{R},0,1,+,-,*,<)$ . We say that a function $f$ is of growth higher than exponential if for all $N\in \mathbb{N}$ there ...
8
votes
0answers
315 views

Using Lindstrom's theorem to prove Craig interpolation

[EDIT: The theorem I call "Beth definability" below is apparently not generally called that (wikipedia notwithstanding; see http://math.stackexchange.com/questions/288450/two-forms-of-beths-theorem). ...
4
votes
0answers
220 views

A canonical way to kill a subset of cohomology in a dg-algebra: via $A_\infty$-algebras? References?

Let $A$ be a differential graded algebra, $S\subset H^*(A)$. I would like to 'kill $S$ in a canonical way'. Is it possible to do it as follows: consider the $A_\infty$-algebra structure on ...
4
votes
1answer
167 views

When do substructures have computable copies?

Say that a class $\mathcal{C}$ of countable first-order structures in some finite signature has the effective substructure property if $\mathcal{C}$ is closed under isomorphism and whenever $A\in ...
1
vote
0answers
106 views

Compactness-like property for universal generalization?

Hi all! I have the following problem. Suppose I have a sequence of models $M_1,M_2,...$, all of which have the same countable domain (call it $D$). $x_1,x_2,...$ is a well-ordering of $D$. $\phi(x)$ ...