Constructive models of complete solvable theories
From MaRDI portal
Publication:1843428
DOI10.1007/BF02219289zbMath0282.02018OpenAlexW1978521098MaRDI QIDQ1843428
A. T. Nurtazin, Sergei S. Goncharov
Publication date: 1974
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02219289
Model theory (03C99) Decidability of theories and sets of sentences (03B25) Computability and recursion theory (03D99)
Related Items
On Decidable and Computable Models of Theories, Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations, A note on decidable categoricity and index sets, Some Questions in Computable Mathematics, Index Sets of Constructive Models that are Autostable Under Strong Constructivizations, On complete theories with a finite number of denumerable models, FOUNDATIONS OF ONLINE STRUCTURE THEORY, The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one, Prime models of computably enumerable degree, On \(\Delta_2^0\)-categoricity of equivalence relations
Cites Work
