Pages that link to "Item:Q3546127"
From MaRDI portal
The following pages link to The class of projective planes is noncomputable (Q3546127):
Displaying 9 items.
- Noncomputability of classes of Pappian and Desarguesian projective planes (Q350846) (← links)
- Computable dimensions of Pappusian and Desarguesian projective planes (Q694236) (← links)
- The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes (Q721363) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms (Q893075) (← links)
- Undecidability of the theory of projective planes (Q1957347) (← links)
- \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes (Q2364332) (← links)
- Freely generated projective planes with finite computable dimension (Q2401538) (← links)
- The class of non-Desarguesian projective planes is Borel complete (Q4683539) (← links)