_1¹-completeness of the computable categoricity problem for projective planes

DOI10.1007/S10469-016-9397-2zbMATH Open1402.03049OpenAlexW2550180195MaRDI QIDQ2364332FDOQ2364332

N. T. Kogabaev

Publication date: 18 July 2017

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

Full work available at URL: https://doi.org/10.1007/s10469-016-9397-2

zbMATH Keywords

computable dimensionprojective planecomputable categoricitycomputable structureDesarguesian projective planePappian projective plane

Mathematics Subject Classification ID

General theory of linear incidence geometry and projective geometries (51A05) Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of computable categoricity
• Degree spectra and computable dimensions in algebraic structures
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• The theory of projective planes is complete with respect to degree spectra and effective dimensions

This page was built for publication: \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes

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