Strongly minimal theories with recursive models

DOI10.4171/JEMS/793zbMATH Open1437.03127OpenAlexW2803365029WikidataQ129796069 ScholiaQ129796069MaRDI QIDQ1644487FDOQ1644487

Authors: Uri Andrews, J. F. Knight 

Publication date: 21 June 2018

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/jems/793

Recommendations

• On the computability-theoretic complexity of trivial, strongly minimal models
• Algorithmic complexity of countable models of strongly minimal theories
• On two problems of Turing complexity for strongly minimal theories
• A new spectrum of recursive models
• New spectra of strongly minimal theories in finite languages

zbMATH Keywords

strongly minimal theorycomputable modelsrecursive models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cited In (8)

• On two problems of Turing complexity for strongly minimal theories
• Trivial, strongly minimal theories are model complete after naming constants
• Effective model theory vs. recursive model theory
• Building models of strongly minimal theories
• IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE
• Title not available (Why is that?)
• New spectra of strongly minimal theories in finite languages
• Model-theoretic Elekes–Szabó in the strongly minimal case

This page was built for publication: Strongly minimal theories with recursive models

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