Computable dimensions of Pappusian and Desarguesian projective planes
From MaRDI portal
(Redirected from Publication:694236)
Recommendations
- Noncomputability of classes of Pappian and Desarguesian projective planes
- The class of projective planes is noncomputable
- \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
- Freely generated projective planes with finite computable dimension
- The complexity of the isomorphism problem for computable projective planes
Cites work
- scientific article; zbMATH DE number 195120 (Why is no real title available?)
- scientific article; zbMATH DE number 1390542 (Why is no real title available?)
- scientific article; zbMATH DE number 3421490 (Why is no real title available?)
- Computably categorical fields via Fermat's last theorem
- Definability and decision problems in arithmetic
- Theory of projective planes
Cited in
(8)- On automaton presentations of projective planes
- \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
- Noncomputability of classes of Pappian and Desarguesian projective planes
- Freely generated projective planes with finite computable dimension
- Undecidability of the theory of projective planes
- The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes
- The class of projective planes is noncomputable
- The complexity of the isomorphism problem for computable projective planes
This page was built for publication: Computable dimensions of Pappusian and Desarguesian projective planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694236)