Prime models and almost decidability

DOI10.2307/2274064MaRDI QIDQ3760506zbMATH OpenOpenAlexFDO

Authors Terrence Millar

Publication date 1986

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

Full work available at URL https://doi.org/10.2307/2274064

zbMATH Keywords

almost decidable structurescomplete decidable theoryprime model

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models with special properties (saturated, rigid, etc.) (03C50)

Recommendations

• Prime models of computably enumerable degree
• On decidable categoricity and almost prime models
• Decidability and undecidability of theories with a predicate for the primes
• Constructivizability of a prime model
• Computable trees, prime models, and relative decidability
• Prime models of theories of computable linear orderings
• Decidability and classification of the theory of integers with primes
• scientific article; zbMATH DE number 4145891
• scientific article; zbMATH DE number 5901621

Cited in

(8)

• Decidability and the number of countable models
• Constructivizability of a prime model
• On decidable categoricity and almost prime models
• scientific article; zbMATH DE number 5901621 (Why is no real title available?)
• Computable trees, prime models, and relative decidability
• scientific article; zbMATH DE number 4108740 (Why is no real title available?)
• Effective prime uniqueness
• On decidable and computable models of theories

This page was built for publication: Prime models and almost decidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760506)