WKL₀ and induction principles in model theory
From MaRDI portal
Publication:2344719
Recommendations
- Reverse mathematics of first-order theories with finitely many models
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- scientific article; zbMATH DE number 2236645
- The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
Cites work
- A complete, decidable theory with two decidable models
- Computable structures and the hyperarithmetical hierarchy
- Decidable models
- Degrees of Indiscernibles in Decidable Models
- Foundations of recursive model theory
- scientific article; zbMATH DE number 3670442 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- Indiscernibles and decidable models
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Model theory.
- Periodic points and subsystems of second-order arithmetic
- Reverse mathematics of first-order theories with finitely many models
- Strong constructivizability of homogeneous models
- Subsystems of second order arithmetic
- The atomic model theorem and type omitting
- The degree spectra of homogeneous models
Cited in
(10)- Representations and the foundations of mathematics
- Splittings and disjunctions in reverse mathematics
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
- Weak and strong versions of effective transfinite recursion
- Reverse mathematics of first-order theories with finitely many models
- On the strength of the finite intersection principle
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Primitive recursive reverse mathematics
- Weihrauch complexity for elementary embeddings into countable saturated models
- Weihrauch degrees of elementary embeddings for prime and saturated models
This page was built for publication: \(\mathsf{WKL}_0\) and induction principles in model theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344719)