Building models of strongly minimal theories
From MaRDI portal
Publication:2039552
Recommendations
- Strongly minimal theories with recursive models
- Algorithmic complexity of countable models of strongly minimal theories
- On the computability-theoretic complexity of trivial, strongly minimal models
- On two problems of Turing complexity for strongly minimal theories
- scientific article; zbMATH DE number 1936725
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1405580 (Why is no real title available?)
- A new spectrum of recursive models using an amalgamation construction
- A new strongly minimal set
- Nonarithmetical ℵ0-categorical theories with recursive models
- On the computability-theoretic complexity of trivial, strongly minimal models
- Reals which compute little
- Strongly minimal theories with recursive models
- The degrees of categorical theories with recursive models
- Theories with recursive models
Cited in
(4)
This page was built for publication: Building models of strongly minimal theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039552)