Annals of Pure and Applied Logic 165 (7-8):1263-1290 (2014)

Abstract
We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on ω. In particular we compare r.e. equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. For instance, we show that some of these partial ordered sets possess atoms, minimal and maximal elements. We also fully describe the isomorphism types of some of these partial orders
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2014.04.001
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,259
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Model Theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
Classifying Positive Equivalence Relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.

View all 16 references / Add more references

Citations of this work BETA

The Theory of Ceers Computes True Arithmetic.Uri Andrews, Noah Schweber & Andrea Sorbi - 2020 - Annals of Pure and Applied Logic 171 (8):102811.
Word Problems and Ceers.Valentino Delle Rose, Luca San Mauro & Andrea Sorbi - 2020 - Mathematical Logic Quarterly 66 (3):341-354.

Add more citations

Similar books and articles

Analytic Equivalence Relations and Bi-Embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
Maximal R.E. Equivalence Relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
On Nice Equivalence Relations on Λ2.Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (1):31-64.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Twilight Graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Thin Equivalence Relations and Effective Decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
? 0 N -Equivalence Relations.Andrea Sorbi - 1982 - Studia Logica 41 (4):351-358.
Classifying Positive Equivalence Relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
Graphs with ∏ 1 0 (K)Y-Sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.

Analytics

Added to PP index
2015-01-22

Total views
40 ( #285,578 of 2,518,489 )

Recent downloads (6 months)
2 ( #271,901 of 2,518,489 )

How can I increase my downloads?

Downloads

My notes