# Structural Highness Notions

@inproceedings{Calvert2021StructuralHN, title={Structural Highness Notions}, author={Wesley Calvert and Johanna N. Y. Franklin and Daniel Turetsky}, year={2021} }

We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and several other problems related to computing isomorphisms. These other problems include Scott analysis (in the form of backand-forth relations), jump hierarchies, and computing descending sequences in linear orders.

#### References

SHOWING 1-10 OF 31 REFERENCES

Degrees that Are Low for Isomorphism

- Mathematics, Computer Science
- Comput.
- 2014

It is shown that while there is no clear-cut relationship between this property and other properties related to computational weakness, the low-forisomorphism degrees contain all Cohen 2-generics and are disjoint from the Martin-Lof randoms. Expand

Isomorphism relations on computable structures

- Computer Science, Mathematics
- The Journal of Symbolic Logic
- 2012

The notion of FF-reducibility introduced in [9] is used to show completeness of the isomorphism relation on many familiar classes in the context of all equivalence relations on hyperarithmetical subsets of ω. Expand

Lowness for isomorphism, countable ideals, and computable traceability

- Mathematics, Computer Science
- Math. Log. Q.
- 2020

It is shown that within the hyperimmune-free degrees, lowness for isomorphism is entirely independent of computable traceability. Expand

1 1 relations and paths through O

- Mathematics
- 2004

When bounds on complexity of some aspect of a structure are preserved under isomorphism, we refer to them as intrinsic. Here, building on work of Soskov [33], [34], we give syntactical conditions… Expand

Degrees of and lowness for isometric isomorphism

- Computer Science, Mathematics
- J. Log. Anal.
- 2020

It is shown that lowness for isomorphism coincides with lownes for isometry of metric spaces, and certain restricted notions of lownedness for isometric is morphism with respect to fixed computable presentations are examined. Expand

Taking the path computably traveled

- Mathematics, Computer Science
- J. Log. Comput.
- 2019

It is proved that lowness for paths in Baire space and lownedess forpaths in Cantor space are equivalent and, furthermore, that these notions are also equivalent to lownes for isomorphism. Expand

LOWNESS AND HIGHNESS PROPERTIES FOR RANDOMNESS NOTIONS

- Mathematics
- 2009

Given two relativizable classes R and P and a real A, we say that A is in Low(R,P) if R P A and that A is in High(R,P) if R A P. In this paper, we survey the current results on highness and lowness… Expand

Computable structures and the hyperarithmetical hierarchy

- Mathematics
- 2000

Preface. Computability. The arithmetical hierarchy. Languages and structures. Ordinals. The hyperarithmetical hierarchy. Infinitary formulas. Computable infinitary formulas. The Barwise-Kreisel… Expand

Computable trees of Scott rank ω1CK, and computable approximation

- Mathematics, Computer Science
- Journal of Symbolic Logic
- 2006

This work shows that there are computable trees of Scott rank ω1CK, and introduces a notion of “rank homogeneity”, in which orbits of tuples can be understood relatively easily in rank homogeneous trees. Expand

A degree-theoretic definition of the ramified analytical hierarchy

- Mathematics
- 1976

Let D be the set of all (Turing) degrees, < the usual partial ordering of D and j the (Turing) jump operator on D. The following relations are shown to be first-order definable in the structure D =… Expand