Abstract
Computable presentations for projective planes are studied. We prove that the problem of computable categoricity is ∏ 1 1 -complete for the following classes of projective planes: Pappian projective planes, Desarguesian projective planes, arbitrary projective planes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
