The algebraic structure of the isomorphic types of tally, polynomial time computable sets

DOI10.1007/S001530100117zbMath1022.03020OpenAlexW1988279238MaRDI QIDQ1407537

Yongge Wang

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530100117

zbMATH Keywords

lattice structuredegree structurepolynomial time computable setspolynomial time isomorphic type structuretally bi-dense setstally cofinite setstally finite sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

This page was built for publication: The algebraic structure of the isomorphic types of tally, polynomial time computable sets