The theory of projective planes is complete with respect to degree spectra and effective dimensions

DOI10.1007/s10469-015-9360-7zbMath1375.03038OpenAlexW2339732449MaRDI QIDQ5965134

N. T. Kogabaev

Publication date: 2 March 2016

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-015-9360-7

zbMATH Keywords

projective planecategoricity spectrumcomputable structureautomorphism spectrumcomputable dimensiondegree spectrum of relationdegree spectrum of structurePappian projective plane

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) General theory of linear incidence geometry and projective geometries (51A05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

\(\prod_1^1\)-completeness of the computable categoricity problem for projective planes, Freely generated projective planes with finite computable dimension, The embedding problem for computable projective planes, Effective categoricity for distributive lattices and Heyting algebras, On the effective universality of mereological theories, HKSS-completeness of modal algebras, Categoricity spectra for polymodal algebras, Categoricity spectra of computable structures, Degree spectra of structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Noncomputability of classes of Pappian and Desarguesian projective planes
• Theory of projective planes
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Uncountable degree spectra
• The possible Turing degree of the nonzero member in a two element degree spectrum
• Computable isomorphisms, degree spectra of relations, and Scott families
• Degree spectra and computable dimensions in algebraic structures
• Degree spectra of relations on structures of finite computable dimension
• Nilpotent groups of finite algorithmic dimension
• Degrees of categoricity and the hyperarithmetic hierarchy
• Simple structures with complex symmetry
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of computable structures
• Spectra of highn and non-lown degrees
• Spectra of degrees of some structures
• Degrees coded in jumps of orderings
• Computably categorical structures and expansions by constants
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Degrees of Structures