The tree of tuples of a structure

Journal of Symbolic Logic 87 (1):21-46 (2022)
  Copy   BIBTEX

Abstract

Our main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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

Set Mappings on $4$ -Tuples. [REVIEW]Shahram Mohsenipour & Saharon Shelah - 2018 - Notre Dame Journal of Formal Logic 59 (3):405-416.
Structure with Fast Elimination of Quantifiers.Mihai Prunescu - 2006 - Journal of Symbolic Logic 71 (1):321 - 328.
Propositions as interpreted abstracta.Thomas Hodgson - 2022 - In Chris Tillman & Adam R. Murray (eds.), The Routledge Handbook of Propositions. Routledge. pp. 256-267.
Gap structure after forcing with a coherent Souslin tree.Carlos Martinez-Ranero - 2013 - Archive for Mathematical Logic 52 (3-4):435-447.
On the existence of indiscernible trees.Kota Takeuchi & Akito Tsuboi - 2012 - Annals of Pure and Applied Logic 163 (12):1891-1902.
Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.

Analytics

Added to PP
2020-09-07

Downloads
17 (#742,076)

6 months
1 (#1,040,386)

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

Definability and Computability.Yuri L. Ershov - 1998 - Studia Logica 61 (3):439-441.

Add more references