Freely generated projective planes with finite computable dimension

DOI10.1007/S10469-017-9418-9MaRDI QIDQ2401538zbMATH OpenOpenAlexFDO

Authors N. T. Kogabaev

Publication date 4 September 2017

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

Full work available at URL https://doi.org/10.1007/s10469-017-9418-9

zbMATH Keywords

computable dimensioncomputable structuredegree spectrum of relationdegree spectrum of structurefreely generated projective planeprojective plane

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) General theory of linear incidence geometry and projective geometries (51A05)

Recommendations

• The class of projective planes is noncomputable
• The theory of projective planes is complete with respect to degree spectra and effective dimensions
• Computable dimensions of Pappusian and Desarguesian projective planes
• scientific article; zbMATH DE number 56016
• On freely generated projective planes

Cites work

• A computable functor from graphs to fields
• A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
• Computable isomorphisms, degree spectra of relations, and Scott families
• Computably categorical structures and expansions by constants
• Degree spectra and computable dimensions in algebraic structures
• Degree spectra of relations on structures of finite computable dimension
• Degrees coded in jumps of orderings
• Degrees of Structures
• Enumerations, countable structures and Turing degrees
• scientific article; zbMATH DE number 3747093 (Why is no real title available?)
• scientific article; zbMATH DE number 3421490 (Why is no real title available?)
• Nilpotent groups of finite algorithmic dimension
• On freely generated projective planes
• Relative to any nonrecursive set
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Spectra of degrees of some structures
• Spectra of high_n and non-low_n degrees
• The class of projective planes is noncomputable
• The possible Turing degree of the nonzero member in a two element degree spectrum
• The theory of projective planes is complete with respect to degree spectra and effective dimensions
• Theory of projective planes
• Uncountable degree spectra
• Undecidability of the theory of projective planes

Cited in

(10)

• On closure of configurations in freely generated projective planes
• Categoricity spectra of computable structures
• On the -theories of free projective planes
• Systems of Diophantine equations over finite configurations
• The class of projective planes is noncomputable
• Homomorphisms of freely generated projective planes
• On the effective universality of mereological theories
• Computable Heyting algebras with distinguished atoms and coatoms
• Computable dimensions of Pappusian and Desarguesian projective planes
• On freely generated projective planes

This page was built for publication: Freely generated projective planes with finite computable dimension

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