Question

Direct proof of a strongly $\lambda$-homogeneous elementary extension

score 207 · Answer 1 · 2019-11-12 00:34:34

207

Views

Direct proof of a strongly $\lambda$-homogeneous elementary extension

Published on 12 Nov 2019 - 0:34

score 293 · Answer 2 · 2019-11-14 13:17:30

293

Views

What are the axioms of the class of lattices?

Published on 14 Nov 2019 - 13:17

score 61 · Answer 3 · 2019-11-16 17:47:43

61

Views

If $N$ is embedded in $M$, then there exists a superstructure $N \subset N' \cong M$

Published on 16 Nov 2019 - 17:47

score 322 · Answer 4 · 2019-11-16 20:04:32

322

Views

definable function

Published on 16 Nov 2019 - 20:04

score 486 · Answer 5 · 2026-03-26 12:47:53

486

Views

Help me understand the proof that usual ordering $\leq$ is not first-order definable in the structure $\left(\mathbb{N};s\right)$.

Published on 26 Mar 2026 - 12:47

score 149 · Answer 6 · 2026-03-24 23:54:57

149

Views

Developing model theory in the language of PA

Published on 24 Mar 2026 - 23:54

score 125 · Answer 7 · 2019-11-18 13:36:50

125

Views

On non-principal Ultrafilter

Published on 18 Nov 2019 - 13:36

score 168 · Answer 8 · 2019-11-19 10:00:10

168

Views

Model theory/topology/type theory

Published on 19 Nov 2019 - 10:00

score 53 · Answer 9 · 2019-11-19 18:43:01

53

Views

Models in predicate logic

Published on 19 Nov 2019 - 18:43

score 135 · Answer 10 · 2019-11-20 14:18:58

135

Views

One can't construct ultrafilters

Published on 20 Nov 2019 - 14:18

score 53 · Answer 11 · 2019-11-20 20:40:22

53

Views

Why does classification theory restrict to complete first-order theories?

Published on 20 Nov 2019 - 20:40

score 311 · Answer 12 · 2019-11-21 16:09:03

311

Views

Distinction between Built-in and Definable Skolem Functions

Published on 21 Nov 2019 - 16:09

score 53 · Answer 13 · 2019-11-22 16:34:12

53

Views

On Types and quantifier free formulas

Published on 22 Nov 2019 - 16:34

score 134 · Answer 14 · 2019-11-23 20:36:43

134

Views

$\mathcal{A} \vDash T_\forall$ iff there exists $\mathcal{M} \supseteq \mathcal{A}$ such that $\mathcal{M} \vDash T$

Published on 23 Nov 2019 - 20:36

score 89 · Answer 15 · 2019-11-24 05:32:33

89

Views

Decidability of Finite Extensions

Published on 24 Nov 2019 - 5:32

List Question

Direct proof of a strongly $\lambda$-homogeneous elementary extension

What are the axioms of the class of lattices?

If $N$ is embedded in $M$, then there exists a superstructure $N \subset N' \cong M$

definable function

Help me understand the proof that usual ordering $\leq$ is not first-order definable in the structure $\left(\mathbb{N};s\right)$.

Developing model theory in the language of PA

On non-principal Ultrafilter

Model theory/topology/type theory

Models in predicate logic

One can't construct ultrafilters

Why does classification theory restrict to complete first-order theories?

Distinction between Built-in and Definable Skolem Functions

On Types and quantifier free formulas

$\mathcal{A} \vDash T_\forall$ iff there exists $\mathcal{M} \supseteq \mathcal{A}$ such that $\mathcal{M} \vDash T$

Decidability of Finite Extensions

Trending Questions

Popular # Hahtags

Popular Questions