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
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
170 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
121 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
1 vote
1 answer
551 views

Natural Numbers

Let $L$ be a countable language and $M$ be a model of $L^N$ (the realization of $L$ in the natural numbers $N$) in which every recursive unary relation is expressible. Show that $M$ is not recursive.
Speltzu's user avatar
  • 265
13 votes
1 answer
2k views

Are some interesting mathematical statements minimal?

Gödel's set $\mathrm{L}$, of constructible sets, decides many interesting mathematical statements, as the Continuum hypothesis and the Axiom of Choice. Are some interesting mathematical questions, ...
Frode Alfson Bjørdal's user avatar
5 votes
1 answer
534 views

The "first-order theory of the second-order theory of $\mathrm{ZFC}$"

$\newcommand\ZFC{\mathrm{ZFC}}\DeclareMathOperator\Con{Con}$It is often interesting to look at the theory of all first-order statements that are true in some second-order theory, giving us things like ...
Mike Battaglia's user avatar
4 votes
1 answer
324 views

Expressiveness in arithmetic

Let $\mathcal{S}$ be a formal system for arithmetic (e.g. $P$ or $PA$), $f:N^q\rightarrow N^p$ a function of $N^q$ on $N^ p$ and $\alpha(\mathbf{x})$ a formula of $\mathcal{S}$ with $p$ free variables....
Speltzu's user avatar
  • 265
10 votes
1 answer
199 views

Is $(\mathbb R_{\mathrm{an}}, (x\mapsto x^r)_{r\in\mathbb R})$ still the largest known polynomially bounded o-minimal structure so far?

From Chris Miller's paper in 1995, the structure $(\mathbb R_{\mathrm{an}}, (x\mapsto x^r)_{r\in\mathbb R})$,is the largest known polynomially bounded o-minimal structure as of that time. I wonder if ...
user506835's user avatar
8 votes
0 answers
131 views

What is this quotient of the free product?

Previously asked at MSE. The construction here can generalize to arbitrary algebras (in the sense of universal algebra) in the same signature with the only needed tweak being the replacement of "...
Noah Schweber's user avatar
21 votes
1 answer
1k views

Are the real numbers isomorphic to a nontrivial ultraproduct of fields?

Let $K_1, K_2, \dots$ be a countable sequence of fields, and let $\prod_{\mathcal F} K_i$ be the ultraproduct with respect to some nonprincipal ultrafilter $\mathcal F$. Question: Can there be a field ...
Tim Campion's user avatar
  • 62.6k
1 vote
0 answers
68 views

Finitely presentable groups are residually finite if and only if they are universally pseudofinite

Suppose $G$ is finitely presentable. Then residual finiteness of $G$ is equivalent to $G$ satisfying the universal theory of finite groups (equivalently, to every existential statement true in $G$ ...
tomasz's user avatar
  • 1,248
6 votes
0 answers
222 views

Do maximal compact logics exist?

By "logic" I mean regular logic in the sense of abstract model theory (see e.g. the last section of Ebbinghaus/Flum/Thomas' book). My question is simple: Is there a logic $\mathcal{L}$ ...
Noah Schweber's user avatar
1 vote
1 answer
187 views

Gödel coding and the function $z(x)$

The function $z(x)$ that associates to each formula $\alpha$ of $P$ its Gödel number $z(\alpha)$ is external to the system. How then can expressions in which $z(x)$ be involved be expressed in $P$? ...
Speltzu's user avatar
  • 265

15 30 50 per page
1
2
3 4 5
82