5
votes
1answer
122 views

O-minimal Theories with Non-Dense Order Type

I asked this question on MSE, but I haven't received any comments or responses (also, it has a very low view count), so I thought I would also ask it here. In this paper, Knight, Pillay, and ...
5
votes
3answers
267 views

Does this property of a first-order structure imply categoricity?

Let $\mathfrak{A}$ be a first-order structure over a relational language and let $\kappa$ be an infinite cardinal. Lets say that $\mathfrak{A}$ has the $\kappa$-property if for every structure ...
2
votes
1answer
150 views

References for the Keisler Order

Are there any good/modern references on the Keisler order. I have been reading Keisler's original paper, "Ultraproducts which are not Saturated", which introduces the order. However it is somewhat ...
3
votes
1answer
133 views

Countable model theory for $\omega$-stable theories?

This is a bit of a fishing expedition, because I'm not sure what I'm looking for. Very vaguely stated, here's the driving question: What conditions on an $\omega$-stable theory make the class of ...
4
votes
3answers
366 views

Systematic brute-force searches for counterexamples

This is getting nowhere on math.stackexchange.com, so I'm putting it here. Gödel's completeness theorem says that for every statement in first-order predicate calculus with equality, there is either ...
4
votes
0answers
100 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. ...
10
votes
0answers
156 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
0answers
77 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
1answer
226 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: ...
4
votes
2answers
295 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 ...
6
votes
0answers
181 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 ...
5
votes
2answers
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
0answers
199 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. ...
12
votes
3answers
591 views

The interplay between certain aspects of interpretability, model theory and category theory

I have some questions about the interplay of interpretability, model theory and category theory. Since I had difficulties in finding literature or other helpful information about this topic, it would ...
4
votes
2answers
277 views

Can we force with Fraisse filters to solve Vaught's conjecture?

Around the classic Fraisse amalgamation theorem in model theory we have the following notions: Definition (1): If $M$ be an $\mathcal{L}$-structure then define: $age(M):=\lbrace N~|~N~\text{is ...
9
votes
2answers
294 views

Extending a partial order while preserving an automorphism

It is well known that if $(P, \leq)$ is a partial order then $\leq$ can always be extended to a linear order. This is sometimes called Szpilrajn´s theorem although it had been previously proved by ...
5
votes
0answers
85 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
359 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
172 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 ...
7
votes
1answer
147 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
233 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 ...
2
votes
1answer
190 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$ ...
4
votes
0answers
219 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 ...
2
votes
1answer
346 views

Decidability survives new constants

Let $L$ be a finite first order language and let $M$ be an $L$-structure with universe $\mathbb{N}$ that interprets all $L$-symbols as recursive sets (so $M$ is a recursive $L$-structure). Let ...
6
votes
1answer
417 views

(Finite) Models of two subtheories of Peano Arithmetic

Consider first-order theory (with identity) of Peano Artithmetic built in the language $\{S,+,\times,0\}$ and with the following set of axioms: \begin{align} \neg Sx&=0\tag{1}\\\ ...
10
votes
1answer
342 views

Number of linear orders

It is well known that for every infinite cardinal $\kappa$ the number of non-isomorphic total orders of cardinality $\kappa$ is $2^\kappa$. Who first proved this, and in what context? Was it proved ...
4
votes
3answers
567 views

Survey of finite axiomatizability for relational theories?

An $L$-theory $T$ is finitely axiomatizable if there is a finite set $A$ of $L$-sentences with the same consequences as $T$, i.e. such that $M \models T$ iff $M \models A$ for every $L$-structure $M$. ...
3
votes
1answer
351 views

Interpretations as morphisms

Model-theoretic interpretations seem to give rise to categories in which morphisms are not functions. To name just two small examples: the category of finite graphs with interpretations between them ...
3
votes
2answers
425 views

Cantor theorem on orders

It is "a well-known theorem of Cantor", said Sierpinski (circa 1920), that every countable total order can be imbedded in the rationals, and he proceeds to demonstrate that, assuming the continuum ...
2
votes
1answer
141 views

Feferman-Kreisel preservation theorem

I want to show the following theorem from Feferman and Kreisel: Let $\phi$ be such that there is a theorem $\sigma$ of ZFC so that for every transitive model $M$ of $\sigma$, we have: $\phi^M \to ...
7
votes
4answers
559 views

Reference Request: Non-Standard Models of PA

I am attempting to write an expository paper on non-standard models of PA that is accesible to students taking an introductory graduate course in mathematical logic (covering Godel's incompleteness ...
10
votes
2answers
708 views

A Model-Theoretic Helly's Theorem

There is a combinatorial question posed to me (or rather, posed near me) by my adviser. I am having quite a lot of difficulty proving it. It goes: For any NIP theory $T$ (complete with infinite ...
4
votes
6answers
2k views

A book about model theory

I am looking for a good book about model theory. As this is obviously too vague, let me explain what I am looking for and why. First I am interested about the basics and foundations of model theory. ...
3
votes
1answer
229 views

Reference wanted for the theory of pseudofinite models

If $\mathcal L$ is a first order language and $\mathcal T$ is theory over $\mathcal L$, then a model $\mathcal M$ of $\mathcal T$ is pseudofinite if it satisfies all sentences satisfied by all finite ...
5
votes
1answer
566 views

Is this a proper application of the Lowenheim-Skolem Theorem to a proper class?

Please don't get put off by the length, all the questions are quite simple, but given the quasi-mathematical context I tried to be precise with the formulation. The more mathematically interesting ...
4
votes
1answer
364 views

Which properties of ultrafilters on countable sets hold for filters in general?

Background/motivation: I'm investigating the construction of models for a first-order modal system (S5) as products of classical models. Since ultraproducts are all classical models and I need ...
2
votes
0answers
166 views

Semantics of neural network-like structures

Background Language (of mathematicians and most other people) has a sequential surface structure and a tree-like deep structure. So semantics usually is the semantics of such syntactical structures: ...
6
votes
3answers
741 views

metric spaces as algebraic systems

Let $(X, {\mathrm{dist}})$ be a metric space. In the paper by Kramer, Shelah, Tent and Thomas , they define an algebraic system $A(X)$ as the set $X$ with countably many binary relations $R_\alpha$, ...
12
votes
4answers
662 views

(Finite) Classification Theory

In the context of asking about the classification of finite simple groups, the question arose: what exactly is meant by a "classification"? Perhaps unsurprisingly, there is in fact a whole branch of ...
5
votes
1answer
512 views

Model theory stressing order type of universe.

In Appendix B to their Model Theory, Chang and Keisler list some problems and conjectures that, at the time of publication, were unsolved. A few of them take imperative form, for instance: "Develop a ...
2
votes
1answer
482 views

Reference: Countable Models of (Non-)Euclidean Geometry

Has there been a survey written on the model theory of first-order (non-)Euclidean geometry in the spirit of Hilbert and Tarski? I'm especially interested in two aspects of the model theory: ...
4
votes
1answer
301 views

Prime-ness checking for polynomial ideals over ACFs( algebraically closed fields).

Let $f_1,\ldots f_m \in k[X]$ have degrees bounded by $l$. and $I(\bar{f})$ be the ideal generated by $\bar{f}$. If $I(\bar{f})$ is not a prime ideal then its non-primeness is witnessed by polynomials ...
7
votes
5answers
1k views

Is it necessary that model of theory is a set?

From Model Theory article from wikipedia : "A theory is satisfiable if it has a model $ M\models T$ i.e. a structure (of the appropriate signature) which satisfies all the sentences in the set $T$". ...
6
votes
7answers
1k views

A few questions on model theory, especially model theory of rings

I have never really read anything proper about model theory, so I have a few questions: Someone told me that a school of logicians managed to give a very short proof of Falting's Theorem using model ...