Prime models of finite computable dimension

DOI10.2178/JSL/1231082315MaRDI QIDQ3616356zbMATH OpenOpenAlexFDO

Authors Pavel Semukhin

Publication date 25 March 2009

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

Full work available at URL https://doi.org/10.2178/jsl/1231082315

zbMATH Keywords

computable modelfirst-order theoryprime model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Recommendations

• On spectra of computable models
• Finite computable dimension does not relativize
• Spectra of computable models for Ehrenfeucht theories
• Prime models of computably enumerable degree
• Constructivizability of a prime model

Cites work

• A computably categorical structure whose expansion by a constant has infinite computable dimension
• Computable isomorphisms, degree spectra of relations, and Scott families
• Degree spectra and computable dimensions in algebraic structures
• The possible Turing degree of the nonzero member in a two element degree spectrum

Cited in

(8)

• Finite computable dimension does not relativize
• A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
• Prime models of theories of computable linear orderings
• Computable dimension for ordered fields
• On spectra of computable models
• Irreducibles and Primes in Computable Integral Domains
• Bounding prime models
• A family with a single minimal but not least numbering

This page was built for publication: Prime models of finite computable dimension

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