\(\mathsf{WKL}_0\) and induction principles in model theory

DOI10.1016/j.apal.2015.04.001zbMath1369.03099OpenAlexW2081492908MaRDI QIDQ2344719

David R. Belanger

Publication date: 15 May 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2015.04.001

zbMATH Keywords

reverse mathematicsrecursive model theorybasic model theory

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Basic properties of first-order languages and structures (03C07)

Related Items (5)

Representations and the foundations of mathematics ⋮ Splittings and disjunctions in reverse mathematics ⋮ Primitive recursive reverse mathematics ⋮ Weak and strong versions of effective transfinite recursion ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong constructivizability of homogeneous models
• Model theory.
• Decidable models
• Computable structures and the hyperarithmetical hierarchy
• Periodic points and subsystems of second-order arithmetic
• REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS
• The degree spectra of homogeneous models
• The atomic model theorem and type omitting
• Indiscernibles and decidable models
• Degrees of Indiscernibles in Decidable Models
• A complete, decidable theory with two decidable models
• Foundations of recursive model theory
• Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

This page was built for publication: \(\mathsf{WKL}_0\) and induction principles in model theory