Add to ORKG1.1. Degree Spectrum and Cospectrum of a structure. Let A = (N;R1; : : :; Rk) be a partial structure over the set of all natural numbers N,where each Ri is a subset of Nri and "= " and "6= " are among R1; : : : ; Rk. An enumeration f of A is a total mapping from N onto N
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
The spectrum of a graph is the spectrum of its adjacency matrix. Cospectral (or isospectral) graphs ...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
Abstract. Two properties of the Co-spectrum of the Joint spectrum of infinitely many abstract struct...
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
We survey known results on spectra of structures and on spectra of relations on computable structure...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
We analyze the degree spectra of structures in which different types of immunity conditions are enco...
Cobordism is one of the most basic notions of algebraic topology. This book is devoted to spectral s...
The spectrum S(G) of a graph G is defined as the sequence of eigenvalues of its adjacency matrix. Th...
A spectral sequence that relates the homology of a polyhedron to the homology preshea
In computable model theory, mathematical structures are studied on the basis of their computability ...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
The spectrum of a graph is the spectrum of its adjacency matrix. Cospectral (or isospectral) graphs ...
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all...
Abstract. Two properties of the Co-spectrum of the Joint spectrum of infinitely many abstract struct...
Abstract. We present a relativized version of the notion of a degree spectrum of a structure with re...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
We survey known results on spectra of structures and on spectra of relations on computable structure...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
We analyze the degree spectra of structures in which different types of immunity conditions are enco...
Cobordism is one of the most basic notions of algebraic topology. This book is devoted to spectral s...
The spectrum S(G) of a graph G is defined as the sequence of eigenvalues of its adjacency matrix. Th...
A spectral sequence that relates the homology of a polyhedron to the homology preshea
In computable model theory, mathematical structures are studied on the basis of their computability ...
Abstract. We study Turing degrees a for which there is a countable structure A whose degree spectrum...
Abstract. For any P ⊆ 2ω, define S(P), the degree spectrum of P, to be the set of all Turing degrees...
The spectrum of a graph is the spectrum of its adjacency matrix. Cospectral (or isospectral) graphs ...