Copying One of a Pair of Structures

Journal of Symbolic Logic 87 (3):1201-1214 (2022)
  Copy   BIBTEX


We ask when, for a pair of structures $\mathcal {A}_1,\mathcal {A}_2$, there is a uniform effective procedure that, given copies of the two structures, unlabeled, always produces a copy of $\mathcal {A}_1$. We give some conditions guaranteeing that there is such a procedure. The conditions might suggest that for the pair of orderings $\mathcal {A}_1$ of type $\omega _1^{CK}$ and $\mathcal {A}_2$ of Harrison type, there should not be any such procedure, but, in fact, there is one. We construct an example for which there is no such procedure. The construction involves forcing. On the way to constructing our example, we prove a general result on modifying Cohen generics.



    Upload a copy of this work     Papers currently archived: 77,805

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

Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
In Praise of Copying.Marcus Boon - 2010 - Harvard University Press.
An example related to Gregory’s Theorem.J. Johnson, J. F. Knight, V. Ocasio & S. VanDenDriessche - 2013 - Archive for Mathematical Logic 52 (3-4):419-434.
Pseudo-finite sets, pseudo-o-minimality.Nadav Meir - 2021 - Journal of Symbolic Logic 86 (2):577-599.
On $q$-Runge pairs.Mihnea Colţoiu - 2003 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 2 (2):231-235.
Indiscernibles, EM-Types, and Ramsey Classes of Trees.Lynn Scow - 2015 - Notre Dame Journal of Formal Logic 56 (3):429-447.
On lovely pairs of geometric structures.Alexander Berenstein & Evgueni Vassiliev - 2010 - Annals of Pure and Applied Logic 161 (7):866-878.
Categoricity Spectra for Rigid Structures.Ekaterina Fokina, Andrey Frolov & Iskander Kalimullin - 2016 - Notre Dame Journal of Formal Logic 57 (1):45-57.
You are simple.David Barnett - 2010 - In Robert C. Koons & George Bealer (eds.), The Waning of Materialism. Oxford University Press. pp. 161--174.


Added to PP

9 (#945,379)

6 months
9 (#106,925)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.

Add more references