REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS

DOI10.1017/JSL.2014.32zbMath1353.03006OpenAlexW2074818280MaRDI QIDQ2933684

David R. Belanger

Publication date: 5 December 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/8669023

zbMATH Keywords

reverse mathematicsnumber of modelseffective model theory

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)

Related Items (4)

Primitive recursive reverse mathematics ⋮ Effective prime uniqueness ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ \(\mathsf{WKL}_0\) and induction principles in model theory

Cites Work

• Unnamed Item
• A complete, decidable theory with two decidable models
• Vaught's theorem recursively revisited

This page was built for publication: REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS