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 ...

learn more… | top users | synonyms

2
votes
0answers
38 views

On the back and forth conditions for a set of partial isomorphisms

I've recently begun reading Poizat's A Course in Model Theory and already in the first pages I had some doubts. One odd (not necessarily bad) thing is that he defines notions such as isomorphism only ...
2
votes
1answer
82 views

Why is the powerset axiom more acceptable than the axiom of choice?

The key step in Zermelo's proof of the well ordering theorem is to use $\text{AC}$ to simultaneously choose the next elelment for all possible partial chains in prospective well orderings, but that ...
7
votes
1answer
92 views

Nonstandard complex numbers and categoricity

Let ${}^*\mathbb{C}$ be a nonstandard complex number field (given, for instance, as a countable ultrapower.) By the transfer principle ${}^*\mathbb{C}$ is algebraically closed of characteristic zero, ...
2
votes
1answer
103 views

Keisler Order: Saturated Ultrapowers

Keisler's paper "Ultraproducts which are not Saturated" states the following theorem as a corollary to a (much more) generalized theorem. However, I cannot figure out how to prove it for the specific ...
-1
votes
0answers
66 views

What is even meant by the “cardinality of a model?”

Please help me understand even the most basic ideas in model theory: When in model theory we speak of the cardinality of a model, what exactly is meant by that? I assume that when we say that the ...
3
votes
2answers
64 views

Clarifications on proof of compactness theorem

I've been reading through the following proof of compactness theorem: http://www.princeton.edu/~hhalvors/teaching/phi312_s2013/compactness.pdf One thing that struck me is that this proof seems to ...
2
votes
1answer
22 views

Density and Saturated Models.

Consider $(\mathbb{Q}; \leq)$ and let $T$ be the theory of dense linear orderings without endpoints. Let $\mathfrak{A}$ be the $\omega_1$ saturated model of $T$. Note that ...
2
votes
2answers
93 views

Countable structure with qe and not ultrahomogeneous

Here: The connection between quantifier elimination, $\omega$-categorical and ultrahomogenous I gave an example of an uncountable structure, that is not ultrahomogeneous but has quantifier ...
1
vote
1answer
52 views

Are order isomorphic real closed fields isomorphic?

There are counterexamples to order isomorphisms of ordered fields being field isomorphisms, see Is the multiplicative structure of a totally ordered field unique?. However, Wikipedia suggests that for ...
0
votes
0answers
25 views

When is the higher-order theory of a model categorical?

I'm interested in (classical) type theories $L$ with the following property. For $M$ any model of $L$ (in Set), let $T(M)$ be the type theory of $M$, i.e., the strongest extension of $L$ satisfied by ...
3
votes
0answers
23 views

Let $h: A \to B$ be a weak homomorphism. Is h$[A]$ a substructure of $B$?

A little bit more precise: let $\mathfrak{A}$ and $\mathfrak{B}$ be two structures. Define a weak homomorphism as a function $h: \mathfrak{A} \to \mathfrak{B}$ such that the folowing conditions are ...
1
vote
1answer
44 views

Consistent Set of Sentences is Consistent in Expanded Language

Suppose that we have a set $\Phi$ of sentences over a first-order language $\mathcal{L}$ and that $\Phi$ is consistent. Suppose we have another first-order language $\mathcal{L}'$ such that ...
5
votes
0answers
75 views

ind-completion and functors which are full with respect to isomorphisms

Let $C$ and $D$ be categories and $F:C\rightarrow D$ a faithful functor which is full with respect to isomorphisms. This means that if $a,b\in C$ and $f:F(a)\rightarrow F(b)$ is an isomorphism in $D$, ...
-1
votes
3answers
88 views

a theory $(x,+,\cdot)$ satisfies $x \cdot x=0$ and $x \cdot (y \cdot z)=(x\cdot y)\cdot z$ [closed]

I asked the question a theory that satisfies $x \cdot x=0$ and $x \cdot (y \cdot z)=(x\cdot y)\cdot z$, but I lost my account since then. So. I am posting my edit as a new question. Let there be a ...
2
votes
1answer
34 views

Compactness and Arithmetic Confusion

Let $T$ be some theory capable of arithmetic and construct a provability predicate (which we will call $Prb_T$). Let $\mathbb{N} \models T$. Expand our language to include a new constant symbol $c$. ...
6
votes
1answer
71 views

Using the compactness theorem to disprove axiomatizability

Another model-theoretic exercise from Smirnov's book. Problem: Construct infinite family of varieties such that their union is not axiomatizable. My solution: Denote by $\mathcal{A}_n$ the variety ...
3
votes
1answer
61 views

Best algebra text for Model Theory

I'm looking for an algebra book that is tailored towards some of the ideas in Model Theory, I'm currently slogging through Hodges' Model Theory. I'm a bit rusty with my algebra and was curious if ...
4
votes
1answer
74 views

How can I imagine a model of $\mathsf{(ZF-Inf)} + \neg \mathsf{Con(ZF-Inf)}$?

Gödel's second incompleteness theorem states that if $\mathsf{ZF-Inf}$ is consistent, then $\mathsf{ZF-Inf} \nvdash \mathsf{Con(ZF-Inf)}$. Moreover, if $\mathsf{(ZF-Inf)} + \neg \mathsf{Con(ZF-Inf)}$ ...
3
votes
1answer
59 views

real closure of an archimedean field

my question is: Is an archimedean field dense in its real closure? I know that in the non-archimedean case, this does not have to be true (e.g., rational fucntions). Thanks!
2
votes
2answers
87 views

Uncountable models for integers

Part of Asaf Karagila's brilliant answer to one of my other questions puzzles me a lot. Namely, I find it hard to understand how there can be a model for ZFC with uncountably many integers. My ...
2
votes
1answer
89 views

Maximal model for $\Bbb R$?

I have not dealt professionally with set theory, so excuse me if my way of formulating this question does not completely follow standard terminology. Actually, my question is about whether or not the ...
3
votes
1answer
71 views

Relations between Theories and Categories

I'm just toying around with some thoughts, trying to grock some concepts: It seems that every formal theory induces a locally small category via interpretations: its objects are structures that ...
4
votes
1answer
37 views

When a subgroup of automorphism group of a structure is in the form of automorphism group of a substructure?

Question 1: Is the following statement true? ($*$) Let $\mathcal{L}$ be a first order language and $\mathcal{M}$ a $\mathcal{L}$-structure and $H\leq Aut(\mathcal{M})$ then there exists a ...
8
votes
1answer
148 views

Is “PA has no non-standard models” consistent with ZF?

I have seen several proofs that there exist nonstandard models of arithmetic, but they all seem to rely on the compactness theorem, which is not implied by ZF. So are there any proofs in ZF that ...
-2
votes
0answers
59 views

Can we consider each first order structure as a pure set?

Pure sets are the simplest kind of first order structures in the language $\mathcal{L}=\emptyset$. As same as any other generalization, the notion of a first order structure preserves some properties ...
3
votes
1answer
48 views

A question about second-order logic and inaccessible cardinals.

Let $\kappa$ denote an inaccessible cardinal, and suppose $T \in V_\kappa$ is a second-order theory. Now consider some mathematical structure $X \in V_\kappa$. Then I think it is clear that $X \models ...
3
votes
1answer
34 views

Elementary equivalence of models

I'm quite new to model theory, so please correct me if I'm using wrong terminology. I need help with an exercise from Smirnov's book "Varieties of algebras" (In Russian). Problem: Assume that a ...
1
vote
1answer
33 views

Relative Interpretations alla Kunen

at the moment I try to figure out some details of Kunen's "Relative Interpretation" Definition (within the 2013 Edition of his "Set Theory", p. 99 to 100): Definition If $\Lambda$ is some axioms ...
4
votes
1answer
66 views

Decision and the Uncountable Spectrum

In 2000, Hart, Hrushovski, and Laskowski classified all complete first order theories in a countable language up to their uncountable spectra. However, does this also imply that given a $any$ ...
1
vote
1answer
58 views

Are algebraic structures required to satisfy axioms?

Is it a requirement for algebraic structures, when studying universal algebra, to satisfy axioms? The reason I ask is because algebraic structures are only defined by a underlying set, a signature, ...
6
votes
1answer
109 views

Elementary equivalence of free groups

This must be known inside out by model theorists by I have no cluse whether the following is true or not: Denote by $F_n$ the free group on $n$ generators. Suppose that $n\neq m$. Are the groups ...
1
vote
2answers
68 views

An Uncountable language , A Model of $\mathbb{N}$, A Problem.

Edit 1: I messed up my original question, but Arthur Fischer answered my question anyway. Edit 2: We can actually restrict $L$ to the language in arithmetic with the prdicate $P_{\mathbb{P}}$. ...
2
votes
3answers
239 views

Upper bound on cardinality of a field

Is there an upper bound on the cardinality of a field? The "biggest" fields I know are the field of real numbers, or the field of complex numbers. Is there a field with cardinality greater than ...
5
votes
1answer
68 views

Is infinitary logics $\mathcal{L}_{\infty\omega}$ an abstract logic?

Infinitary logics $\mathcal{L}_{\infty\omega}$ is an extension of first-order logics such that $\bigvee\Phi \in \mathcal{L}_{\infty\omega}$ if $\Phi$ is a set of ...
1
vote
1answer
27 views

Is “constructible from” a transitive relation?

In Jech's Set Theory, exercise 13.27, it is hinted that $X \in L[Y]$ and $Y \in L[X]$ together imply $L[X]=L[Y]$. I tried to prove this fact without success, although I suspect the proof is simple. ...
6
votes
1answer
84 views

Construction of Ultrafilters

I've been doing a lot of work with ultrapowers and saturation recently. In particular, I am reading chapter 6 of Chang and Keisler as well as Keisler's paper on "Ultraproducts which are not ...
1
vote
1answer
47 views

Is there an algebraic ω-categorical structure with quantifier eli., that is not ultrahomogenous?

The following result holds for relational structures: If $A$ is a countable structure, with an $\omega$−categorical theory $Th(A)$, that admits quantifier elimination, then $A$ is ultrahomogeneous. ...
2
votes
1answer
51 views

Why is $\alpha \mapsto L_{\alpha}[A]$ $\Delta_{1}$?

On page 187 of Jech's Set Theory, there is a proof sketch of the fact that $\alpha \mapsto L_{\alpha}$ is $\Delta_{1}$. As far as I can tell, Jech's argument only shows that this operation is ...
0
votes
0answers
37 views

Sets Constructible Relative To A Unary Predicate

The class $L$ of constructible sets is defined by recursion using the operation def$(M)=\{x \subset M: x$ is definable over $(M, \in) \}$. By adding a unary predicate, $P$, to our language, we can ...
1
vote
0answers
40 views

Model-theory : questions regarding back-and-forth sets

See my previous post for the basic definitions from Jouko Väänänen, Models and Games (2011), page 54-on. See page 64 for : Definition 5.14 Suppose $\mathcal A$ and $\mathcal B$ are ...
1
vote
1answer
48 views

Model-theory : questions regarding partial isomorphism

I'm having problems with the first pages of Bruno Poizat, A Course in Model: Theory An Introduction to Contemporary Mathematical Logic (ed or 1985), specifically with local isomorphism and back- and ...
2
votes
1answer
80 views

The connection between quantifier elimination, $\omega$-categorical and ultrahomogenous

A relational structure $A$ with an $\omega-$categorical theory $Th(A)$ is ultrahomogenous iff $Th(A)$ admits quantifier elimination. (*) I was wondering wether the structure $A$ has to be ...
7
votes
1answer
157 views

Gödel's way of teaching non-standard models to Takeuti.

In Memoirs of a Proof Theorist, Gaisi Takeuti relates how Gödel taught him about nonstandard models in an "interesting" way: It went as follows. Let T be a theory with a nonstandard model. By ...
1
vote
1answer
82 views

Is for every ultrahomogenous structure M the theory Th(M) model complete?

A structure M is ultrahomogenous if every isomorphism between finitely generated substructures of M can be extended to an automorphism of M. A theory is model complete if every embedding between ...
1
vote
1answer
70 views

Show that if $L$ is countable and contains a two-place predicate symbol, there are $2^{2^{\aleph_0}}$ classes of $L$-structures closed under $\equiv$

We say that a class of structures $K$ is closed under elementary equivalence ($\equiv$) if for all $A, B$, if $A \in K$ and $A \equiv B$, then $B \in K$. How to show that if $L$ (as a set of specific ...
4
votes
1answer
74 views

Model of complete extension of Zermelo set theory

Chang and Keisler's Model theory gives the following exercise problem: Prove that there is a complete extension $T$ of Zermelo set theory which has arbitrary large natural models. (A model ...
0
votes
1answer
52 views

Why are there $\leq$ $2^{\operatorname{card}(\operatorname{Form}(L))}$ elementarily nonequivalent structures for $L$?

Let $L$ be a set of specific symbols and $\operatorname{Form}(S)$ be the set of all first-order formulas over $L$. Why are there $\leq$ $2^{\operatorname{card}(\operatorname{Form}(L))}$ ...
2
votes
1answer
57 views

How to prove that $max(\aleph_{0}, card(X)) = max(\aleph_{0}, card(L(X)))$?

I struggle with the following problem. Let $X$ be a set of elementary sentences and $L(X)$ be the smallest elementary language in which we can express all the sentences from $X$. How to prove that ...
2
votes
1answer
107 views

Cardinalities of Collections of Models

Let $T$ be a complete theory in a countable language (with only infinite models). Recall the spectrum function: $I(\aleph_\alpha,T)=$ the number of non-isomorphic models of $T$ of cardinality ...
4
votes
1answer
49 views

A model which has only one undefinable element over a language with only a finite number of symbols

I try to solve the problem 1.3.14 in Chang and Keisler's Model theory: For each $n\in\omega$, find a model $\mathfrak{A}_n$ for $\mathcal{L}$ a language with only a finite number of symbols, which ...