Prime models and almost decidability

DOI10.2307/2274064zbMATH Open0623.03011OpenAlexW4237923603MaRDI QIDQ3760506

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

prime modelcomplete decidable theoryalmost decidable structures

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Constructivizability of a prime model 👍 👎
• On decidable categoricity and almost prime models 👍 👎
• Prime models of theories of computable linear orderings 👍 👎
• Decidability and undecidability of theories with a predicate for the primes 👍 👎
• Computable trees, prime models, and relative decidability 👍 👎
• DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES 👍 👎
• Prime models of computably enumerable degree 👍 👎

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)