Document is current

∏ 1 1 -Completeness of the Computable Categoricity Problem for Projective Planes

Crossref DOI link: https://doi.org/10.1007/s10469-016-9397-2

Published Online: 2016-11-10

Published Print: 2016-09

Update policy: https://doi.org/10.1007/springer_crossmark_policy