Decidable models

DOI10.1007/BF02757002zbMath0361.02067OpenAlexW3187762542MaRDI QIDQ1239318

Michael Morley

Publication date: 1976

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02757002

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other classical first-order model theory (03C68)

Related Items (21)

IN MEMORIAM: MICHAEL MORLEY, 1930–2020 ⋮ Recursive categoricity and recursive stability ⋮ On Decidable and Computable Models of Theories ⋮ Computable models of theories with few models ⋮ Criterion for strong constructivizability of a homogeneous model ⋮ Strong constructivizability of homogeneous models ⋮ A theory with two strongly constructivizable models ⋮ Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types ⋮ A note on decidable categoricity and index sets ⋮ Autostability of prime models under strong constructivizations ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals ⋮ A computable ℵ₀-categorical structure whose theory computes true arithmetic ⋮ Theories with recursive models ⋮ Degrees of autostability relative to strong constructivizations ⋮ The degree spectra of homogeneous models ⋮ Turing degrees of complete formulas of almost prime models ⋮ Degrees of Recursively Saturated Models ⋮ \(\mathsf{WKL}_0\) and induction principles in model theory ⋮ Countable algebra and set existence axioms ⋮ Generalizing classical and effective model theory in theories of operations and classes

Cites Work

• Unnamed Item
• On complete theories with a finite number of denumerable models
• Recursively presentable prime models

This page was built for publication: Decidable models