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

6
votes
1answer
155 views

Is it possible to prove the axiom of infinity from the real number axioms?

What I mean by the title is whether, given that there is a class $\Bbb R$ and operations $+,\cdot,<$ that satisfy the ordered field axioms and the least upper bound axiom, you can prove the ...
3
votes
1answer
80 views

Showing there does not exist a formal proof of a formula $\phi$.

My problem:Suppose $R$ is a binary predicate and use the soundness theorem to show that there does not exist a formal proof of $$ \phi =\forall y\exists xR(x,y)\rightarrow \exists x\forall yR(x,y).$$ ...
5
votes
2answers
152 views

Finite Model Theory

It seems that finite model theory is regarded (in a sense) as a computer theoretic subject. Is this the case or are there questions of interest that are of interest to mathematical logicians or more ...
3
votes
1answer
93 views

“Syntactic models” and the proof of the Completeness Theorem

In Computational Complexity by Papadimitriou (page 107), he outlines the basic idea for a proof of the completeness theorem for first-order logic - namely, that given a consistent set $\Delta$ of ...
48
votes
8answers
4k views

How is the Gödel's Completeness Theorem not a tautology?

As a physicist trying to understand the foundations of modern mathematics (in particular Model Theory) $-$ I have a hard time coping with the border between syntax and semantics. I believe a lot would ...
3
votes
1answer
64 views

Non-isomorpic uncountable dense linear orderings (a textbook example)

We know that two countable dense open orderings are isomorphic, and we know that this is generally not true for uncountable structures. Now I quote from the textbook, that is "Model-Theoretic Logics": ...
3
votes
0answers
71 views

Finding a finite model

Hello I am having difficulty with this question, I am not even sure what strategy one would go about proving something like this: Suppose $L$ is a language which includes an infinite list ...
0
votes
2answers
75 views

Is there a name for models whose every element is named by (one or more) variable-free terms?

Let $T$ denote a first-order theory. Is there a name for those models $M$ of $T$ such that for all $x \in M$, there is a variable-free term in the language of $T$ whose interpretation under $M$ is ...
1
vote
3answers
160 views

ZFC Axioms to be extended?

Sorry if this is going to be a really loaded question. I was told several times that for virtually all theorems/corollaries/propositions of mathematics (except those cases not compatible with ZFC ...
1
vote
1answer
144 views

Definable subsets of the natural numbers using only the successor function

Consider the first-order language whose only nonlogical symbol is the unary function symbol $S$, and the structure $\mathfrak{N} = ( \mathbb{N} , S )$, where $S$ denotes the successor function. Why ...
0
votes
0answers
35 views

First-Order Logic: Non-Normal Model of Sentences True in all Normal Models?

Let $\mathcal{L}$ be a first-order language with quantifier $\forall$, connectives $\neg$ and $\rightarrow$, a two-place predicate $E$ and a one-place function symbol $f$. There are no other ...
3
votes
2answers
164 views

Model-theory and Proof-theory in Propositional Logic

I'm trying to link results of model theory and proof-theory in propositional language. Here i will use $\models$ to denote logical consequence, in the model-theory sense. Being $x,y$ two formulas of ...
2
votes
2answers
84 views

Which constructions on a category are still interesting for a groupoid?

By a groupoid, I mean a (small) category in which every morphism is an isomorphism. It looks to me that constructions on a category like the opposite ("dual") category or products and (co-)limits ...
3
votes
1answer
131 views

Is a homomorphism expected to be a (structure-preserving) map?

Is a homomorphism a special type of morphism, namely a structure-preserving map? For a morphism (of a category), it is clear that we can't always expect that a morphism is necessarily a ...
11
votes
2answers
237 views

Putting down axioms for some symbols. Playing with their consequences qualitatively and symbolically. Building theories. The book?

I am interested in the design and building of theories. By building theories, I mean putting down axioms of various kinds, over various fields, exploring their perhaps interesting, or probably boring, ...
0
votes
1answer
86 views

Peano's theory of arithmetic and Gödel's 1st Incompleteness Theorem

Let $\mathcal{N}$ be Peano's 1st order theory of arithmetic and $\mathscr{A}$ it's standard model (which we assume exists). Infer from Gödel's 1st Incompleteness Theorem that there exists a closed ...
0
votes
1answer
37 views

Can I say something about the cadinality of this model?

Let $L$ be some first-order language. Suppose $A$ is existentially closed in $K$, a class of $L$-structures whose age is at most countable, and age($A$) is at most countable set . Can we say anything ...
2
votes
2answers
129 views

I would like some textbook recommendations for model theory

I am a 3rd year undergraduate math student and would like to study model theory. . I have some background with set theory, ordinals etc and also with mathematical logic. This is purely for self study ...
8
votes
1answer
147 views

Can all theorems of $\sf ZFC$ about the natural numbers be proven in $\sf ZF$?

I know a proof of Hindman's theorem that uses ultrafilters on the natural numbers, and ultimately, the axiom of choice. But the theorem itself is essentially a combinatorial property of the natural ...
1
vote
1answer
96 views

Example of two finitely isomorphic structures (or $\omega$-isomorphic) that are not partially isomorphic?

One can define several maps between given structures in order to portray similarities or differences. The concept of isomorphism displays a deep structural overlapping, while for instance an ...
1
vote
1answer
60 views

A Question About Tennebaum's Theorem?

Tennenbaum's theorem proves there are no countable recursive nonstandard models of Peano arithmetic. It is a proof by contradiction. If our countable, nonstandard model is recursive, then, given a ...
2
votes
1answer
61 views

Ax-Kochen theorem

I'm following the proof of Ax-Kochen theorem by this paper: http://arxiv.org/abs/1308.3897 I have two question in the proof of Ax-Kochen Principle: In the page 49, I didn't understend the ...
1
vote
2answers
146 views

An exercise on (isolated) types

I am currently working through a model theory course and am doing some exercises from Marker's book. I am currently attempting exercise 4.5.2. Which states the following: Let $T$ be the theory ...
3
votes
1answer
132 views

Non forking extensions of types as extensions of filters

Given a set of parameters $A$ a type in $S_n(A)$ may be thought of as a maximal filter on the monster model which can be constructed from $A$-definable subsets. Given a type $q\in S_n(B)$ saying that ...
1
vote
1answer
60 views

Show that every existential sentence is preserved upwards

A sentence is existential if it is of the form $\exists x_1 ... \exists x_nR$ and $R$ has no further quantifiers. A sentence is preserved upwards if and only if whenever it is true in an ...
4
votes
3answers
118 views

How are models constructed?

As I understand, a model $\langle S,\sim\rangle$ of $\mathsf{ZFC}$ is a set $S$ coupled with some binary operation $\sim$, in which the axioms of $\mathsf{ZFC}$ hold (please correct me if I am wrong). ...
0
votes
1answer
32 views

Prove $\{e\}$ is a model of group theory

In group theory one learns that there is exactly one trivial group of size 1, namely $\{e\}$. In addition to the axioms of the group theory, this group is uniquely determined by the axiom: DIM1 ...
1
vote
1answer
36 views

Definition of dicrete ordering

What means by "discrete ordering"?
0
votes
1answer
63 views

The definition of interpretation in a Kripke model collides with my intuition of what it should do

In Lindröm and Segerberg (2007) exposition of a Kripke model, with frame $F= \langle W,D,R,E,w_0\rangle$, they define an interpretation $I$ as a family of functions $I_w$, where $w$ ranges over ...
2
votes
1answer
42 views

Are all theorems of minimal arithmetic theorems of a given theory?

I am working on some metamathematics revision and the following question came up. Let the theory $R_0$ be axiomatized by the following axiom schemata which hold for all $n,m \in \mathbb{N}$: ...
0
votes
0answers
59 views

The unique model of cardinal $\kappa$ of a $\kappa$-categorical countable theory is saturated.

Let $T$ be a $\kappa$-categorical ($\kappa \geq \aleph_1$) first-order theory in a countable language $\mathcal L$. I try to prove that its unique (up to isomorphism) model of cardinal $\kappa$ is ...
1
vote
1answer
91 views

What is the definition of “Winning Strategy” in an Ehrenfeucht-Fraïssé game?

I've read many descriptions and applications of a Winning Strategy, as much as many for a Strategy tout court, but when a formal, algebraic definition is called upon, I've found close to no input. I ...
0
votes
1answer
110 views

What is the use of Tarski-Vaught test?

As title says, what is the use of Tarski-Vaught test? I do understand that it is necessary and sufficient criteria for $N$ to be an elementary substructure of $M$, but beside that I don't see how this ...
1
vote
2answers
40 views

What exactly is $L$-terms in model theory?

I got confused after seeing the inductive definition of $L$-terms in model theory. So I do get that there are variables and constants, and when function $f$ is applied to the term, the resulting thing ...
1
vote
1answer
46 views

Clarification regarding inner model, standard model, transitive model and Mostowski

After reading books before lectures, here's my thought regarding inner models and so on. Correct me if I am wrong. So there's universe $V$, which we assume to be the true universe. By Gödel's ...
5
votes
2answers
73 views

Removing sets from models of set theory

I have a naive and open-ended question: How can one remove a set from a model of set theory in such a way that the result is again a model of set theory? Directly related: what kinds of sets can ...
0
votes
1answer
106 views

A finite set of wffs has an independent equivalent subset

This seems to be a common exercise among many books (cf. Enderton, p. 28, van Dalen, p. 45, Hinman, p. 51, Chang and Keisler, p. 18), with some minor variations among them. The idea is simple. Say ...
2
votes
1answer
47 views

If $\phi$ is satisfiable and $\mathscr{S}$ is countable, then the set of all models of $\phi$ has the cardinality of the continuum

I have just started reading Chang and Keisler and I'm already stuck in an exercise. Let $\mathscr{S}$ be a countable set of sentence letters (i.e. $\mathscr{S} = \{S_0, S_1, S_2, \dots\}$ or some ...
1
vote
1answer
92 views

Is there a first order theory for equivalences classes?

Question will be a bit naive, so please, be kind. Consider a first order theory, $\Gamma$ . Let $\mathcal{M}$ be the category of models for $\Gamma$. Consider $\sim$ an equivalence relation on ...
3
votes
1answer
97 views

isomorphism between divisible, totally ordered, abelian groups

Let $G$, $H$ be divisible, abelian, linearly ordered groups, whose cardinalities are equal and satisfy $\mu := |G|=|H|>\aleph_{0}$. These are supposed to be (order!) isomorphic. And just about ...
4
votes
3answers
126 views

Ultrapower and hyperreals

The construction I've seen of the field of hyperreal numbers considers a non-principal ultrafilter $\mathcal{U}$ on $\mathbb{N}$, then takes the quotient of $\mathbb{R}^{\mathbb{N}}$ by equivalence ...
4
votes
1answer
95 views

Infinite linear order with endpoints which is non-dense

In the process of answering questions about normal models, I had to prove the following: Any normal model of $\chi$ is a non-dense linear order with a least and greatest element. The next question ...
2
votes
1answer
79 views

Extending Henkin's Theorem to Completeness in Marker's Text

In Marker's Model Theory, starting on p. 35, he proves the following: Theorem [Henkin]: If $T$ is finitely satisfiable, then $T$ is satisfiable. He also mentions Theorem [Goedel]: If $T$ is ...
2
votes
1answer
74 views

Why Quantifier Free Formulas define Linear Functions.

How do you prove that functions definable by quantifier-free formulas must be linear? I am interested for the structure $\langle Q,+,0\rangle$.
2
votes
2answers
87 views

Omitting types and real closed fields

Let $T$ be a theory in a language $L$ such that a model of $T$ defines a real closed field. Can we apply the omitting types theorem in order to show the existence of atomic models of $T$? i.e. does ...
1
vote
1answer
42 views

Propositional S5: is there a consistent set requiring continuously many worlds?

A recent question asked whether in systems of modal propositional logic having the "finite model property" there are consistent sets of sentences that were not satisfied by a finite model. @Carl ...
5
votes
0answers
163 views

Gödel's Completeness Theorem and logical consequence

At the end of a long process of "rumination" on "old" math log textbooks, I've found the "missing link" - from my personal point of view - between some issues I've raised in the previous months : (i) ...
0
votes
1answer
84 views

Propositional modal logic: infinite models required in systems with finite model property?

A system of propositional modal logic has the "finite model property" if any consistent sentence is satisfiable at a model with finitely many possible worlds. Some systems have this property and ...
2
votes
1answer
89 views

Countable transitive model of ZFC that is well-founded externally

As I am studying set theory, I came to realize that there exists a countable "well-founded" model of ZFC. But I am curious whether countable models can ever be well-founded externally. What would be ...
12
votes
3answers
395 views

On Pudlak's “Life in an Inconsistent World”

In his Logical Foundation of Mathematics and Computational Complexity (2013), Pavel Pudlak invites the readers to ponder about fictitious people whose natural numbers are nonstandard. His exposition ...