Building models of strongly minimal theories
From MaRDI portal
Publication:2039552
DOI10.1016/J.AIM.2021.107802OpenAlexW3166477158MaRDI QIDQ2039552FDOQ2039552
Authors: Uri Andrews, Steffen Lempp, Noah Schweber
Publication date: 5 July 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2021.107802
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
recursive presentationcomputable presentationstrongly minimaldegree of modeldegree of presentationSolovay theory
Cites Work
- Title not available (Why is that?)
- A new strongly minimal set
- Theories with recursive models
- Nonarithmetical ℵ0-categorical theories with recursive models
- Reals which compute little
- A new spectrum of recursive models using an amalgamation construction
- On the computability-theoretic complexity of trivial, strongly minimal models
- The degrees of categorical theories with recursive models
- Strongly minimal theories with recursive models
- Title not available (Why is that?)
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)