Skip to main content

Questions tagged [model-theory]

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

1 vote
0 answers
43 views

Are "equi-expressivity" relations always congruences on Post's lattice?

Given a clone $\mathcal{C}$ over the set $\{\top,\perp\}$, let $\mathsf{FOL}^\mathcal{C}$ be the version of first-order logic with (symbols corresponding to) elements of $\mathcal{C}$ replacing the ...
Noah Schweber's user avatar
-3 votes
1 answer
216 views

Two equivalent statements about formulas projected onto an Ultrafilter

Question 1: In the same language, let $ X $ be a nonempty set, and let $ \{ (\forall x_{x(i)} f(i)) \ | \ i \in X \} $ be a set of formulas. We use $ x(i) $ to denote the index of the variable on ...
Stanley sun's user avatar
1 vote
0 answers
72 views

Whence compactness of automorphism quantifiers?

The following question arose while trying to read Shelah's papers Models with second-order properties I-V. For simplicity, I'm assuming a much stronger theory here than Shelah: throughout, we work in $...
Noah Schweber's user avatar
6 votes
0 answers
70 views

Is there a substructure-preservation result for FOL in finite model theory?

It's well-known$^*$ that the Los-Tarski theorem ("Every substructure-preserved sentence is equivalent to a $\forall^*$-sentence") fails for $\mathsf{FOL}$ in the finite setting: we can find ...
Noah Schweber's user avatar
3 votes
0 answers
129 views

Inevitable consistency strength, take 2

This is an attempt to repair this old question of mine. Say that a good candidate is a first-order sentence $\varphi$ in a language $\{<,...\}$ containing a distinguished binary relation symbol $&...
Noah Schweber's user avatar
8 votes
0 answers
147 views

Which sentences are "strategically preserved"?

Below, everything is first-order. Say that a sentence $\varphi$ is strategically preserved iff player 2 has a winning strategy in the following game: Players 1 and 2 alternately build a sequence of ...
Noah Schweber's user avatar
2 votes
0 answers
197 views

Is there a computable model of HoTT?

Among the various models of homotopy type theory (simplicial sets, cubical sets, etc.), is there a computable one? Can the negative follow from the Gödel-Rosser incompleteness theorem? If there is no ...
user avatar
17 votes
6 answers
2k views

Book recommendation introduction to model theory

Next semester I will be teaching model theory to master students. The course is designed to be "soft", with no ambition of getting to the very hardcore stuff. Currently, this is the syllabus....
Ivan Di Liberti's user avatar
4 votes
0 answers
103 views

Is there an abstract logic satisfying the Löwenhein-Skolem property for single sentences but not for countable sets of sentences?

An abstract logic satisfies the LS property for single sentences if each satisfiable sentence has a countable model. Similarly, the LS property for countable sets of sentences holds if every ...
Rodrigo Freire's user avatar
5 votes
1 answer
193 views

What is the theory of computably saturated models of ZFC with an *externally well-founded* predicate?

For any model of $M$ of ZFC, we can extend it to a model $M_{ew}$ with an "externally well-founded" predicate $ew$. For $x \in M$, We say that $M_{ew} \vDash ew(x)$ when there is no infinite ...
Christopher King's user avatar
1 vote
0 answers
98 views

Effortless automated proofs for "simple" formulae?

From small cases to all of them. This is in the spirit of 15 theorem see https://en.wikipedia.org/wiki/15_and_290_theorems EXAMPLE : Suppose you have the following problem: P(a) For any fixed non ...
Jérôme JEAN-CHARLES's user avatar
7 votes
1 answer
167 views

Is Presburger arithmetic in stronger logics still complete?

Originally asked at MSE: Let $\Sigma=\{+,<,0,1\}$ be the usual language of Presburger arithmetic. Given a "reasonable" logic $\mathcal{L}$, let $\mathbb{Pres}(\mathcal{L})$ be the $\...
Noah Schweber's user avatar
3 votes
0 answers
119 views

Comparing two fragments of SOL with the downward Lowenheim-Skolem property

For $S$ a set of (parameter-free) second-order formulas and $\mathfrak{A},\mathfrak{B}$ structures, write $\mathfrak{A}\trianglelefteq^S\mathfrak{B}$ iff $\mathfrak{A}$ is a substructure of $\mathfrak{...
Noah Schweber's user avatar
4 votes
1 answer
172 views

Can we have external automorphisms over intersectional models?

Is the following inconsistent: By "intersectional" set I mean a set having the intersectional set of every nonempty subset of it, being an element of it. $\forall S \subset M: S\neq \...
Zuhair Al-Johar's user avatar
4 votes
0 answers
159 views

In finite model theory, is "invariant FOL with $\varepsilon$-operator" unavoidably second-order?

Throughout, all structures are finite. Say that a class of finite structures $\mathbb{K}$ is $\mathsf{FOL}_\varepsilon^\text{inv}$-elementary iff it is the class of finite models of a sentence in the ...
Noah Schweber's user avatar

15 30 50 per page
1
2 3 4 5
82