On Computability Theoretic Properties of Structures and Their Cartesian Products

Mathematical Logic Quarterly 46 (4):467-476 (2000)
  Copy   BIBTEX

Abstract

In this paper we show that for any set X ⊆ ω there exists a structure [MATHEMATICAL SCRIPT CAPITAL A] that has no presentation computable in X such that [MATHEMATICAL SCRIPT CAPITAL A]2 has a computable presentation. We also show that there exists a structure [MATHEMATICAL SCRIPT CAPITAL A] with infinitely many computable isomorphism types such that [MATHEMATICAL SCRIPT CAPITAL A]2 has exactly one computable isomorphism type

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 102,020

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Universal functions in partial structures.Maurizio Negri - 1992 - Mathematical Logic Quarterly 38 (1):253-268.
Computability of graphs.Zvonko Iljazović - 2020 - Mathematical Logic Quarterly 66 (1):51-64.
Computable dimension for ordered fields.Oscar Levin - 2016 - Archive for Mathematical Logic 55 (3-4):519-534.
Cohesive powers of structures.Valentina Harizanov & Keshav Srinivasan - 2024 - Archive for Mathematical Logic 63 (5):679-702.
Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.

Analytics

Added to PP
2013-12-01

Downloads
14 (#1,295,259)

6 months
8 (#635,425)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references