? 0 N -equivalence relations
Studia Logica 41 (4):351-358 (1982)
Abstract
In this paper we study the reducibility order m (defined in a natural way) over n 0 -equivalence relations. In particular, for every n> 0 we exhibit n 0 -equivalence relations which are complete with respect to m and investigate some consequences of this fact (see Introduction).DOI
10.1007/bf00403335
My notes
Similar books and articles
Right-based morality and hohfeld's relations.Hugh Upton - 2000 - The Journal of Ethics 4 (3):237-256.
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
Cofinal families of Borel equivalence relations and quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
Maximal R.e. Equivalence relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Computably enumerable equivalence relations.Su Gao & Peter Gerdes - 2001 - Studia Logica 67 (1):27-59.
Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
Analytics
Added to PP
2009-01-28
Downloads
43 (#273,687)
6 months
1 (#449,844)
2009-01-28
Downloads
43 (#273,687)
6 months
1 (#449,844)
Historical graph of downloads
References found in this work
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
The relation of a to $\operatorname{prov} \ulcorner a \urcorner$ in the lindenbaum sentence algebra.C. F. Kent - 1973 - Journal of Symbolic Logic 38 (2):295 - 298.
