The Δ0α-Computable Enumerations of the Classes of Projective Planes


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

Studying computable representations of projective planes, for the classes K of pappian, desarguesian, and all projective planes, we prove that Kc/≃ admits no hyperarithmetical Friedberg enumeration and admits a Friedberg Δ0α+3-computable enumeration up to a Δ0α-computable isomorphism.

About the authors

A. K. Voĭtov

Novosibirsk State University

Author for correspondence.
Email: boutobahgpeu@gmail.com
Russian Federation, Novosibirsk

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.