Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 1946

Model theory is the branch of mathematical logic which deals with the connection between a formal language and its interpretations, or models.

3 votes
Accepted

Saturated models and definable substructures

Yes. Let $T$ be the theory of an endless discrete order, which is a complete theory. Let $M=\mathbb{Z}\cdot\mathbb{Q}$ consist of $\mathbb{Q}$ copies of the $\mathbb{Z}$ order, which is a countable sa …
Joel David Hamkins's user avatar
1 vote

galois correspondence for hyperimaginaries

The answer is not necessarily. For a counterexample, consider the first-order structure $M$ consisting of a naked set with exactly two points $M=\{a,b\}$, in the first order language having just equ …
Joel David Hamkins's user avatar
1 vote

Ultraproduct $\prod_p \mathbb{F}_p/\sim$ and $\mathbb{Q}^*$

Regarding your edit, of course any ultrapower $\Pi\mathbb{Q}/U$ of $\mathbb{Q}$ itself is a nonstandard model of the theory of $\mathbb{Q}$ (in whatever language you choose). So this version of $\math …
Joel David Hamkins's user avatar
11 votes
Accepted

Can an ultraproduct be infinite countable?

Yes, but the existence of such ultrafilters is a large cardinal hypothesis; it is equivalent to the existence of a measurable cardinal. If each $A_i$ is countably infinite and $\cal U$ is countably c …
Joel David Hamkins's user avatar
3 votes
Accepted

Number of non-isomorphic models

Under the global choice principle (which asserts that there is a class well-ordering of the set-theoretic universe), then every theory $T$ has rank $0$ as you define it, regardless of the number of mo …
Joel David Hamkins's user avatar
5 votes
Accepted

A proper class of formulas with every set-sized (but no proper-class-sized) subcollection sa...

Let me give a few examples. Example 1. Let us work in Gödel-Bernays set theory, and assume that $T\subset {}^{<\text{Ord}}2$ is a proper class tree of height Ord, but there is no cofinal branch. (Th …
Joel David Hamkins's user avatar
3 votes
Accepted

When can we have "each subtheory is satisfiable iff it is recursively axiomatizable"?

Perhaps this is the kind of example for which you are searching. Let's use the logic $L_{\omega_1,\omega}$, which allows for countable conjunctions and disjunctions. Let $A\subset\mathbb{N}$ be any i …
Joel David Hamkins's user avatar
2 votes

How to show certain theories are not existentially closed

Let me begin by mentioning that the idea of existential closure for models of set theory arises in the context of forcing axioms. Thomas Johnstone and I, for example, discuss this idea in our paper J. …
Joel David Hamkins's user avatar
8 votes
Accepted

When does an infinite model have a proper class-sized elementary extension?

The answer to your main question is that in ZFC there is always such a proper-class elementary-extension. Theorem. In ZFC, every set-sized model in a set-sized first-order language has a proper-clas …
Joel David Hamkins's user avatar
5 votes
Accepted

Least inner model of ZF without power set axiom

Your intuition is correct, for we have $L^-=L$. Inside any model $V$ of $\text{ZF}^-$, we can still build $L$. You don't need the power set axiom to construct $L$. And furthermore, the resulting inne …
Joel David Hamkins's user avatar
2 votes

Can one satisfaction class code another?

A model of ZFC can indeed have two satisfaction classes. This is a result going back to Krajewski 1974, and you can find an account of it and some and some other related matters in my paper, J. D. Ham …
Joel David Hamkins's user avatar
6 votes
Accepted

$\mathcal A\equiv\mathcal B\implies \mathcal A\cong\mathcal B$ for finite $\mathcal L$-struc...

Yes. If they are not isomorphic, then for each bijection of $A$ with $B$, there is an atomic formula that the bijection does not respect, that is, a reason that it is not an isomorphism. Since there …
Joel David Hamkins's user avatar
3 votes

Existentially closed partial orders

A model $M$ of a theory $T$ is existentially closed with respect to that theory, if for any quantifier-free formula $\varphi$ and any objects $\vec a$ in $M$, if there is model $N$ of the theory $T$ e …
Joel David Hamkins's user avatar
2 votes
Accepted

Elementary chains of $\aleph_1$-saturated models

The answer is not necessarily. Let me describe how to make a counterexample. First, notice that your requirement that $\varphi(M_i)$ is cofinal in $\varphi(M_{i+1})$ is equivalent merely to the as …
Joel David Hamkins's user avatar
3 votes
Accepted

dual (p,q)-property

The properties are not equivalent. Let $S$ consist of (at least two) subsets of $X$, which have one point entirely in common, but which are otherwise disjoint (and which have other points than that co …
Joel David Hamkins's user avatar

1
2 3 4 5
16
15 30 50 per page