Relative enumerability in the difference hierarchy

1998 ◽  
Vol 63 (2) ◽  
pp. 411-420 ◽  
Author(s):  
Marat M. Arslanov ◽  
Geoffrey L. Laforte ◽  
Theodore A. Slaman
Keyword(s):  
Natural Generalization ◽  
Difference Hierarchy ◽  
The Difference ◽  
Relative Enumerability

AbstractWe show that the intersection of the class of 2-REA degrees with that of the ω-r.e. degrees consists precisely of the class of d.r.e. degrees. We also include some applications and show that there is no natural generalization of this result to higher levels of the REA hierarchy.

Equivalence structures and isomorphisms in the difference hierarchy

2009 ◽  
Vol 74 (2) ◽  
pp. 535-556 ◽  
Author(s):  
Douglas Cenzer ◽  
Geoffrey Laforte ◽  
Jeffrey Remmel
Keyword(s):  
Equivalence Relations ◽  
Computable Categoricity ◽  
Difference Hierarchy ◽  
The Difference

AbstractWe examine the effective categoricity of equivalence structures via Ershov's difference hierarchy. We explore various kinds of categoricity available by distinguishing three different notions of isomorphism available in this hierarchy. We prove several results relating our notions of categoricity to computable equivalence relations: for example, we show that, for such relations, computable categoricity is equivalent to our notion of weak ω-c.e. categoricity, and that -categoricity is equivalent to our notion of graph-ω-c.e. categoricity.

scholarly journals Towards a descriptive theory of cb0-spaces

2016 ◽  
Vol 27 (8) ◽  
pp. 1553-1580 ◽  
Author(s):  
VICTOR SELIVANOV
Keyword(s):  
Set Theory ◽  
Descriptive Set Theory ◽  
Difference Hierarchy ◽  
Descriptive Theory ◽  
Wadge Hierarchy ◽  
The Difference ◽  
Descriptive Set

The paper tries to extend some results of the classical Descriptive Set Theory to as many countably basedT0-spaces (cb0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we also consider the more general case ofk-partitions. In particular, we investigate the difference hierarchy ofk-partitions and the fine hierarchy closely related to the Wadge hierarchy.

Analytic determinacy and 0#

1978 ◽  
Vol 43 (4) ◽  
pp. 685-693 ◽  
Author(s):  
Leo Harrington
Keyword(s):  
Borel Sets ◽  
Difference Hierarchy ◽  
The Difference

Martin [12] has shown that the determinacy of analytic games is a consequence of the existence of sharps. Our main result is the converse of this:Theorem. If analytic games are determined, then x2 exists for all reals x.This theorem answers question 80 of Friedman [5]. We actually obtain a somewhat sharper result; see Theorem 4.1. Martin had previously deduced the existence of sharps from 3 − Π11-determinacy (where α − Π11 is the αth level of the difference hierarchy based on − Π11 see [1]). Martin has also shown that the existence of sharps implies < ω2 − Π11-determinacy.Our method also produces the following:Theorem. If all analytic, non-Borel sets of reals are Borel isomorphic, then x* exists for all reals x.The converse to this theorem had been previously proven by Steel [7], [18].We owe a debt of gratitude to Ramez Sami and John Steel, some of whose ideas form basic components in the proofs of our results.For the various notation, definitions and theorems which we will assume throughout this paper, the reader should consult [3, §§5, 17], [8], [13] and [14, Chapter 16].Throughout this paper we will concern ourselves only with methods for obtaining 0# (rather than x# for all reals x). By relativizing our arguments to each real x, one can produce x2.

Bounded query classes and the difference hierarchy

1989 ◽  
Vol 29 (2) ◽  
pp. 69-84 ◽  
Author(s):  
Richard Beigel ◽  
William I. Gasarch ◽  
Louise Hay
Keyword(s):  
Difference Hierarchy ◽  
The Difference

scholarly journals Walk-modularity and community structure in networks

2015 ◽  
Vol 3 (3) ◽  
pp. 348-360 ◽  
Author(s):  
DAVID MEHRLE ◽  
AMY STROSSER ◽  
ANTHONY HARKIN
Keyword(s):  
Community Structure ◽  
Social Science ◽  
Community Detection ◽  
Practical Interest ◽  
Graph Model ◽  
Natural Generalization ◽  
Expected Number ◽  
Random Graph Model ◽  
Modularity Maximization ◽  
The Difference

AbstractModularity maximization has been one of the most widely used approaches in the last decade for discovering community structure in networks of practical interest in biology, computing, social science, statistical mechanics, and more. Modularity is a quality function that measures the difference between the number of edges found within clusters minus the number of edges one would statistically expect to find based on some equivalent random graph model. We explore a natural generalization of modularity based on the difference between the actual and expected number of walks within clusters, which we refer to as walk-modularity. Walk-modularity can be expressed in matrix form, and community detection can be performed by finding the leading eigenvector of the walk-modularity matrix. We demonstrate community detection on both synthetic and real-world networks and find that walk-modularity maximization returns significantly improved results compared to traditional modularity maximization.

Splitting and non-splitting in the difference hierarchy

2016 ◽  
Vol 28 (3) ◽  
pp. 384-391
Author(s):  
MARAT ARSLANOV
Keyword(s):  
Difference Hierarchy ◽  
Open Questions ◽  
The Difference

In this paper, we investigate splitting and non-splitting properties in the Ershov difference hierarchy, in which area major contributions have been made by Barry Cooper with his students and colleagues. In the first part of the paper, we give a brief survey of his research in this area and discuss a number of related open questions. In the second part of the paper, we consider a splitting of 0′ with some additional properties.

Sign in / Sign up

Export Citation Format

Share Document