Classifying positive equivalence relations

1983 ◽  
Vol 48 (3) ◽  
pp. 529-538 ◽  
Author(s):  
Claudio Bernardi ◽  
Andrea Sorbi
Keyword(s):  
Topological Space ◽  
Equivalence Relation ◽  
Recursive Function ◽  
Equivalence Classes ◽  
Point Of View ◽  
Classification Theorem ◽  
Equivalence Relations ◽  
Natural Numbers ◽  
Uniformity Property

AbstractGiven two (positive) equivalence relations ~1, ~2 on the set ω of natural numbers, we say that ~1 is m-reducible to ~2 if there exists a total recursive function h such that for every x, y ∈ ω, we have x ~1y iff hx ~2hy. We prove that the equivalence relation induced in ω by a positive precomplete numeration is complete with respect to this reducibility (and, moreover, a “uniformity property” holds). This result allows us to state a classification theorem for positive equivalence relations (Theorem 2). We show that there exist nonisomorphic positive equivalence relations which are complete with respect to the above reducibility; in particular, we discuss the provable equivalence of a strong enough theory: this relation is complete with respect to reducibility but it does not correspond to a precomplete numeration.From this fact we deduce that an equivalence relation on ω can be strongly represented by a formula (see Definition 8) iff it is positive. At last, we interpret the situation from a topological point of view. Among other things, we generalize a result of Visser by showing that the topological space corresponding to a partition in e.i. sets is irreducible and we prove that the set of equivalence classes of true sentences is dense in the Lindenbaum algebra of the theory.

scholarly journals Global aspects of measure preserving equivalence relations and graphs

10.53733/96 ◽  
2021 ◽  
Vol 52 ◽  
pp. 691-726
Author(s):  
Alexander Kechris
Keyword(s):  
Topological Space ◽  
Equivalence Relation ◽  
Point Of View ◽  
Equivalence Relations ◽  
Global Theory ◽  
Descriptive Set

This paper is an introduction and survey of a “global” theory of measure preserving equivalence relations and graphs. In this theory one views a measure preserving equivalence relation or graph as a point in an appropriate topological space and then studies the properties of this space from a topological, descriptive set theoretic and dynamical point of view.

Universal recursion theoretic properties of r.e. preordered structures

1985 ◽  
Vol 50 (2) ◽  
pp. 397-406 ◽  
Author(s):  
Franco Montagna ◽  
Andrea Sorbi
Keyword(s):  
Equivalence Relation ◽  
Point Of View ◽  
Main Concern ◽  
Natural Numbers ◽  
Axiomatic Theory ◽  
Recursive Functions ◽  
Theoretic Point

When dealing with axiomatic theories from a recursion-theoretic point of view, the notion of r.e. preordering naturally arises. We agree that an r.e. preorder is a pair = 〈P, ≤P〉 such that P is an r.e. subset of the set of natural numbers (denoted by ω), ≤P is a preordering on P and the set {〈;x, y〉: x ≤Py} is r.e.. Indeed, if is an axiomatic theory, the provable implication of yields a preordering on the class of (Gödel numbers of) formulas of .Of course, if ≤P is a preordering on P, then it yields an equivalence relation ~P on P, by simply letting x ~Py iff x ≤Py and y ≤Px. Hence, in the case of P = ω, any preordering yields an equivalence relation on ω and consequently a numeration in the sense of [4]. It is also clear that any equivalence relation on ω (hence any numeration) can be regarded as a preordering on ω. In view of this connection, we sometimes apply to the theory of preorders some of the concepts from the theory of numerations (see also Eršov [6]).Our main concern will be in applications of these concepts to logic, in particular as regards sufficiently strong axiomatic theories (essentially the ones in which recursive functions are representable). From this point of view it seems to be of some interest to study some remarkable prelattices and Boolean prealgebras which arise from such theories. It turns out that these structures enjoy some rather surprising lattice-theoretic and universal recursion-theoretic properties.After making our main definitions in §1, we examine universal recursion-theoretic properties of some r.e. prelattices in §2.

A General Framework for Priority Arguments

1995 ◽  
Vol 1 (2) ◽  
pp. 189-201 ◽  
Author(s):  
Steffen Lempp ◽  
Manuel Lerman
Keyword(s):  
Information Content ◽  
Equivalence Relation ◽  
Decision Problem ◽  
General Framework ◽  
Equivalence Classes ◽  
Partial Ordering ◽  
Decision Problems ◽  
Natural Numbers ◽  
Relative Complexity ◽  
Degrees Of Unsolvability

The degrees of unsolvability were introduced in the ground-breaking papers of Post [20] and Kleene and Post [7] as an attempt to measure theinformation contentof sets of natural numbers. Kleene and Post were interested in the relative complexity of decision problems arising naturally in mathematics; in particular, they wished to know when a solution to one decision problem contained the information necessary to solve a second decision problem. As decision problems can be coded by sets of natural numbers, this question is equivalent to: Given a computer with access to an oracle which will answer membership questions about a setA, can a program (allowing questions to the oracle) be written which will correctly compute the answers to all membership questions about a setB? If the answer is yes, then we say thatBisTuring reducibletoAand writeB≤TA. We say thatB≡TAifB≤TAandA≤TB. ≡Tis an equivalence relation, and ≤Tinduces a partial ordering on the corresponding equivalence classes; the poset obtained in this way is called thedegrees of unsolvability, and elements of this poset are calleddegrees.Post was particularly interested in computability from sets which are partially generated by a computer, namely, those for which the elements of the set can be enumerated by a computer.

scholarly journals EQUIVALENCE RELATIONS WHICH ARE BOREL SOMEWHERE

2017 ◽  
Vol 82 (3) ◽  
pp. 893-930 ◽  
Author(s):  
WILLIAM CHAN
Keyword(s):  
Equivalence Relation ◽  
Polish Space ◽  
Equivalence Classes ◽  
Equivalence Relations ◽  
Proper Forcing ◽  
Image Position

AbstractThe following will be shown: Let I be a σ-ideal on a Polish space X so that the associated forcing of I+${\bf{\Delta }}_1^1$ sets ordered by ⊆ is a proper forcing. Let E be a ${\bf{\Sigma }}_1^1$ or a ${\bf{\Pi }}_1^1$ equivalence relation on X with all equivalence classes ${\bf{\Delta }}_1^1$. If for all $z \in {H_{{{\left( {{2^{{\aleph _0}}}} \right)}^ + }}}$, z♯ exists, then there exists an I+${\bf{\Delta }}_1^1$ set C ⊆ X such that E ↾ C is a ${\bf{\Delta }}_1^1$ equivalence relation.

Thin equivalence relations and effective decompositions

1993 ◽  
Vol 58 (4) ◽  
pp. 1153-1164 ◽  
Author(s):  
Greg Hjorth
Keyword(s):  
Equivalence Relation ◽  
Equivalence Classes ◽  
Equivalence Relations ◽  
Perfect Set

AbstractLet E be a equivalence relation for which there does not exist a perfect set of inequivalent reals. If 0* exists or if V is a forcing extension of L, then there is a good well-ordering of the equivalence classes.

scholarly journals Trees and amenable equivalence relations

1990 ◽  
Vol 10 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Scot Adams
Keyword(s):  
Equivalence Class ◽  
Equivalence Relation ◽  
Measure Space ◽  
Polynomial Growth ◽  
Finite Measure ◽  
Equivalence Classes ◽  
Equivalence Relations ◽  
Borel Equivalence Relation

AbstractLet R be a Borel equivalence relation with countable equivalence classes on a measure space M. Intuitively, a ‘treeing’ of R is a measurably-varying way of makin each equivalence class into the vertices of a tree. We make this definition rigorous. We prove that if each equivalence class becomes a tree with polynomial growth, then the equivalence relation is amenable. We prove that if the equivalence relation is finite measure-preserving and amenable, then almost every tree (i.e., equivalence class) must have one or two ends.

scholarly journals On the cardinality of a factor set in the symmetric group

2014 ◽  
Vol 07 (02) ◽  
pp. 1450027
Author(s):  
Krasimir Yordzhev
Keyword(s):  
Positive Integer ◽  
Symmetric Group ◽  
Equivalence Relation ◽  
Combinatorial Problem ◽  
Oriented Graph ◽  
Equivalence Classes ◽  
Natural Numbers ◽  
Factor Set

Let n be a positive integer, σ be an element of the symmetric group [Formula: see text] and let σ be a cycle of length n. The elements [Formula: see text] are σ-equivalent, if there are natural numbers k and l, such that σk α = βσl, which is the same as the condition to exist natural numbers k1 and l1, such that α = σk1 βσl1. In this work, we examine some properties of the so-defined equivalence relation. We build a finite oriented graph Γn with the help of which is described an algorithm for solving the combinatorial problem for finding the number of equivalence classes according to this relation.

scholarly journals An Ulm-type classification theorem for equivalence relations in Solovay model

1997 ◽  
Vol 62 (4) ◽  
pp. 1333-1351 ◽  
Author(s):  
Vladimir Kanovei
Keyword(s):  
Equivalence Relation ◽  
Binary Sequences ◽  
Classification Theorem ◽  
Equivalence Relations ◽  
Equality Relation ◽  
Solovay Model ◽  
Type Classification

AbstractWe prove that in the Solovay model, every OD equivalence relation, Ε, over the reals, either admits an OD reduction to the equality relation on the set of all countable (of length < ω1) binary sequences, or continuously embeds Ε0, the Vitali equivalence.If Ε is a (resp. ) relation then the reduction above can be chosen in the class of all Δ1 (resp. Δ2) functions.The proofs are based on a topology generated by OD sets.

scholarly journals Homotopy and Isotopy Properties of Topological Spaces

1961 ◽  
Vol 13 ◽  
pp. 167-176 ◽  
Author(s):  
Sze-Tsen Hu
Keyword(s):  
Topological Space ◽  
Equivalence Relation ◽  
Classification Problem ◽  
Equivalence Classes ◽  
Topological Classification ◽  
Topological Spaces ◽  
The Family ◽  
Important Notion

The most important notion in topology is that of ahomeomorphism f: X→Yfrom a topological spaceXonto a topological spaceY. If a homeomorphism f:X→Yexists, then the topological spaces X andFare said to behomeomorphic(ortopologically equivalent), in symbols,X ≡ Y.The relation ≡ among topological spaces is obviously reflexive, symmetric, and transitive; hence it is an equivalence relation. For an arbitrary familyFof topological spaces, this equivalence relation ≡ divides /Mnto disjoint equivalence classes called thetopology typesof the familyF. Then, the main problem in topology is the topological classification problem formulated as follows.The topological classification problem:Given a familyF oftopological spaces, find an effective enumeration of the topology types of the familyFand exhibit a representative space in each of these topology types.

scholarly journals The Laczkovich-Komjáth property for coanalytic equivalence relations

2010 ◽  
Vol 75 (3) ◽  
pp. 1091-1101 ◽  
Author(s):  
Su Gao ◽  
Steve Jackson ◽  
Vincent Kieftenbeld
Keyword(s):  
Equivalence Relation ◽  
Polish Space ◽  
Equivalence Classes ◽  
Equivalence Relations ◽  
Perfect Set

AbstractLet E be a coanalytic equivalence relation on a Polish space X and (An)n∈ω a sequence of analytic subsets of X. We prove that if lim supn∈kAn meets uncountably many E-equivalence classes for every K ∈ [ω]ω, then there exists K ∈ [ω]ω such that ∩n∈kAn contains a perfect set of pairwise E-inequivalent elements.

Sign in / Sign up

Export Citation Format

Share Document