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

2
votes
1answer
163 views

Mal'cev “rational equivalence” and model theory

In Universal Algebra, it is possible to say that two presentations denote the "same" kind of algebraic structures, if the two corresponding varieties are "rationally equivalent" (Mal'cev 1958). In ...
4
votes
1answer
262 views

Does PA+Con(PA) entail the existence of non-standard models of PA?

Does $\textsf{PA}$+Con($\textsf{PA}$) entail the existence of non-standard models of $\textsf{PA}$? Is there a reasonable way in which to code, inside $\textsf{PA}$, the statement that $\textsf{PA}$ ...
1
vote
0answers
58 views

Counting models in first order logics without existencial quantifiers

My question is about the posibility of to construct a parameter space of models in a first order theory, finitely presented, with out existencial quantifiers (parameter space in the sense of ...
2
votes
1answer
80 views

Representable cylindric algebras and correspondence with first-order models

The class $\textsf{Cs}_{\omega}^{reg}\cap \textsf{Lf}_{\omega}$ of locally finite and regular cylindric set algebras (of dimension $\omega$) can be seen as the algebraic counterpart of first-order ...
2
votes
0answers
145 views

Automorphisms of $\mathbb{C}$ and meromorphic functions

Let $F$ be a meromorphic function on $\mathbb{C}$, and assume that the first-order theory of $(\mathbb{C},F)$ defines $\mathbb{Z}$, which means that there exists a formula $\varphi(z)$ (in the ...
1
vote
1answer
94 views

Relationship between a first-order theory and its model companion

Given a first-order theory $T$ its model companion $T^*$ can be considered. Under relatively weak assumptions on $T$ we have that $T^*$ is the theory of the class of the existentially closed models ...
8
votes
3answers
273 views

Model-theoretic accounts of feasibility in bounded arithmetic and related systems

Various weak theories of arithmetic have been partially motivated by a concern with numbers (or functions/proofs) that are feasible. This concern is sometimes connected to an interest in strictly ...
12
votes
6answers
734 views

Application of Fraïssé construction in set theory

As you know Fraïssé limit construction and its generalization, Hrushovski's construction, have many applications in model theory to build models with interesting property. Now I would like to know ...
6
votes
0answers
77 views

Is there a ``Ladner's Theorem" for the PH-vs-PSPACE scenario?

Like a statement of the kind, ``If the Polynomial Hierarchy (PH) $\neq$ PSPACE then there exists $L \in PSPACE \backslash PH$ which is not PSPACE-complete"? Or is there something else that states ...
12
votes
2answers
1k views

Do the real numbers “know” that they are countable in a larger model?

(This was first posted to math.stackexchange but had no answers there after several days): Let ${\mathbb R}$ be the set of real numbers in whatever is your favorite model of $ZFC$. Then (by Levy ...
2
votes
0answers
61 views

Potentiality classes and Borel reductions

In a 1998 paper by Hjorth, Kechris, and Louveau, there was a definition given of a "potentiality class." That is, given an invariant equivalence relation $E$ on a standard Borel space $X$, we say $E$ ...
5
votes
1answer
163 views

Uncountably categorical theories which are interpretable in a strongly minimal

Definition: Let $\lambda$ be a cardinal. An $\mathcal{L}$-theory $T$ is called $\lambda$-categorical whenever every two models of $T$ of cardinality $\lambda$ are isomorphic. Definition: An ...
-2
votes
0answers
30 views

Underlying Set in Model Theory [migrated]

In model theory a structure has an underlying set. In addition to the interpreted relations, are there (implicit) assumptions made about possible operations on this set? For example, is it assumed to ...
6
votes
1answer
112 views

Chains of forking extension in stable theories

Let $T$ be an stable theory. Further we work in the monster model of $T^{eq}$. We say that a chain of types of the form $$tp(a_1/A_1)\subset tp(a_2/A_2) ... \subset tp(a_n/A_n)$$ is a forking chain ...
6
votes
1answer
372 views

Alternate proof of Morley's theorem?

I'm trying to understand the result given in the first box at slide 45 of this talk. Specifically: 1) What is the source cited? I have not been able to find any article by Keisler, Chudnovsky and/or ...
12
votes
2answers
783 views

nonstandard models and mathematical theorems

Is there a first order statement about the natural numbers (not nonstandard analysis) such that the truth of the statement is easier to see in a nonstandard model? In other words, do nonstandard ...
-1
votes
1answer
98 views

types and elementary extensions [closed]

Let $\mathcal{M}$ and $\mathcal{N}$ be two $\mathcal{L}$-structures and suppose that for n-tupls $\bar{a}\in M^n$ and $\bar{b}\in N^n$, $tp^\mathcal{M}(\bar{a})=tp^\mathcal{N}(\bar{b})$ where ...
8
votes
0answers
199 views

Is there a notion analogous to separability but requiring definable rather than countable sets?

Among models of $\lambda$-calculus, some like the Bohm tree model have the property that every element is a directed sup of definable elements, whereas others like the $D_\infty$ and $P(\omega)$ ...
2
votes
0answers
71 views

Uniqueness of an embedding theorem for Real differential fields

I will follow a preliminary exposition for the problem in question, which will essentially follow the format on http://www4.ncsu.edu/~singer/papers/model_diff_fields.pdf [pg. 87]: Let $K$ be a real ...
10
votes
1answer
530 views

Is forcing computable?

By results similar to Tennenbaum's theorem we know that there exist no computable models of $ZF$. But suppose we are given, as a sort of oracle, access to some model of $ZF$ (e.g. we can make oracle ...
3
votes
1answer
130 views

Formal systems needed to formalize relative independence results

We know that Con(ZF) implies Con(ZFC+GCH), Con(ZF+neg(AC)) and Con(ZFC+neg(CH)). But what are some weak theories in which these relative independence results are provable? In particular, are they ...
6
votes
2answers
177 views

Formal languages with non-unique interpretations of terms

In mathematical logic and model theory, one considers interpretations of syntactic expressions: terms without free variables are interpreted as elements of some structure, formulas without free ...
15
votes
2answers
1k views

Is non-existence of the hyperreals consistent with ZF?

I know that it is possible to construct the hyperreal number system in ZFC by using the axiom of choice to obtain a non-principal ultrafilter. Would the non-existence of a set of hyperreals be ...
10
votes
2answers
445 views

Can a parent and child node have the same type in a well-founded digraph tree?

$\newcommand\toward{\rightharpoonup}$It would help me to understand something in a current research project if someone could provide an example of directed graph $\langle G,\toward\rangle$ with the ...
6
votes
1answer
101 views

Is nfcp equivalent to stable + eliminates $\exists^\infty$?

Let $T$ be a complete first-order theory. Recall that a formula $\phi(\overline{x},\overline{y})$ has the finite cover property (fcp) if for all $n$, there exist $\overline{a}_1,\dots,\overline{a}_n$ ...
12
votes
1answer
478 views

Is there a nonstandard model of arithmetic having precisely one inductive truth predicate?

$\newcommand\Tr{\text{Tr}}$My question is whether there can be a nonstandard model of PA having a unique inductive truth predicate. Background. If $\mathcal{N}=\langle N,+,\cdot,0,1,<\rangle$ is ...
3
votes
1answer
319 views

Are there sets which are computable in one model, but uncomputable in another?

Suppose we have two models of set theory, $U$ and $V$ which have the same $\Bbb N$. Is it possible that there is a set $A\subseteq\Bbb N$ such that, in $U$, this set is computable, i.e. there is a ...
6
votes
1answer
191 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 ...
10
votes
2answers
439 views

Is every order type of a PA model the \omega of some ZFC model?

Let $N$ be a model of first-order Peano arithmetic, and let $\sigma$ be its order-type. Does it follow that there is a (non-transitive, expect when $M$ is the standard model) $ZFC$-model $M$ such that ...
3
votes
0answers
92 views

motivic integration and jacobian ideal

When we consider the change of variables in motivic integration, we have a birational map $f:Y\rightarrow X$ with Y smooth and we have to consider two invariants the order of the Jacobian ideal of $X$ ...
1
vote
1answer
103 views

Saturated models and definable substructures

Let $M$ be a saturated model of a theory $T$ in a first-order language $\mathcal{L}$, and let $N$ be a submodel of $M$. Is it possible to have a substructure $A\neq N$ of $M$ such that $N \subset A ...
1
vote
1answer
167 views

Two questions about axiomatic rank of groups

Let $G$ be a group and $V=Var(G)$ be the variety generated by $G$. Suppose the axiomatic rank of $V$ is $n$. Let $Id(V)$ be the set of all identities of $V$. 1- Can we say that every element of ...
1
vote
0answers
85 views

Real algebraic groups and pseudo-finiteness

What is the relationship between pseudo-finite groups and real algebraic groups? Could you provide an example of a pseudo-finite real algebraic group and of a non pseudo-finite one, if any? Thank ...
8
votes
1answer
353 views

Groups and pregeometries

Definition. For an infinite structure $\mathcal{A}$ and $cl : P(dom(\mathcal{A})) \longrightarrow P(dom(\mathcal{A}))$ , we say that $(\mathcal{A}, cl)$ is a structure carrying an $\omega$-homogeneous ...
2
votes
0answers
59 views

Characterization of externally definable sets

Let $\cal U$ be a saturated model of inaccessible cardinality $\kappa$. For arbitrary $\cal D\subseteq U$ denote by $\langle\cal U,D\rangle$ the expansion of $\cal U$ with a new predicate for $\cal ...
5
votes
3answers
296 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 ...
4
votes
1answer
141 views

Are there superexponential Pfaffian functions?

This question is motivated by model theory, but it's really an analysis question (which means it may have an easy analysis answer that I just don't have the background for). Here's the main question, ...
13
votes
3answers
658 views

Can Suslin (or Aronszajn) lines ever be orderings of abelian groups?

I am interested in realizing linear orders as orderings of abelian groups. In particular, can Suslin lines (and other classes of line) be realised in this way? Let $\mathcal{C}$ be a class of ...
1
vote
1answer
94 views

dual (p,q)-property

If the set system $(X,S)$ has the $(p,q)$-property does its dual system also have the property? (Possibly, for different $p$ and $q$.) Explicitly, I am asking about the equivalence of the following ...
8
votes
1answer
288 views

Saturated Ultrapowers

I posted it on MSE and didn't receive any comments or answers, so I thought I would post it here. (See http://math.stackexchange.com/questions/895549/keisler-order-saturated-ultrapowers) Keisler's ...
0
votes
0answers
54 views

Representation of piecewise functions using variational inequalities

I need some help about how to represent piecewise smooth functions defined over N subintervals by using variational inequalities. From a paper I'm analyzing I get: "If we can find a function ...
2
votes
1answer
161 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 ...
1
vote
0answers
71 views

definable relations in finite structures

Let $\mathcal{L}$ be a first order language and $M$ be a finite $\mathcal{L}$-structure. I want to know which relations $R\subseteq M^n$ are definable in $\mathcal{L}$? If I apply the well-known ...
3
votes
1answer
94 views

Is quasivariety generated by all perfect graphs finitely axiomatizable?

Fix logic $L$ with equality and a binary relation symbol $E$. The class of graphs can be identified with the class of models of the universal first-order Horn $L$-sentences $\forall x,y\; E(x,y) ...
4
votes
1answer
173 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 ...
5
votes
1answer
301 views

How do we know if Vaught's Conjecture is Absolute?

Please note that this might be some confusion on my part about the work surrounding Vaught's conjecture. First of all, Vaught Conjecture states that if a first-order complete theory $T$ in a ...
12
votes
1answer
362 views

Main Gap Phenomenon

Shelah's Main Gap Theorem states that for all first-order, complete theories, T, in a countable language, we have that either $$I(T,\aleph_\alpha)=2^{\aleph_\alpha}$$ or ...
3
votes
2answers
554 views

A double centralizing theorem for finite groups

I have a proof for the following assertion which employs Model Theory. It has certainly a pure group theoretic proof, but what is such a proof? Is the assertion trivial? Theorem Let $G$ be a finite ...
4
votes
1answer
193 views

Elementary chains of $\aleph_1$-saturated models

If $X$ and $Y$ are two sets linearily ordered by $<$, $X$ is called cofinal in $Y$ if $X \subseteq Y$ and and for every $y \in Y$, there is a $x \in X$ with $y < x$. If $M$ is some model and ...
4
votes
1answer
260 views

What axioms (other than choice) have a taming effect on the ordering of cardinalities?

Axiom of choice arranges all cardinalities into a well-ordered chain but without it their ordering can be wild in general ZF models, e.g. two cardinalities may not even have inf or sup. However, ...