Some undecidability results in strong algebraic languages

DOI10.2307/2274149zbMath0586.03036OpenAlexW2026872222MaRDI QIDQ3712328

Cornelia Kalfa

Publication date: 1984

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

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

zbMATH Keywords

algorithmcompletenessmodel-completenessrecursive fieldnontrivial modelsrecursive sets of equations

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Base-undecidable properties of universal varieties
• Unsolvable problems for equational theories
• Unnamed Item