Isomorphism relations on computable structures
From MaRDI portal
Recommendations
Cites work
- \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
- A Borel reductibility theory for classes of countable structures
- Analytic equivalence relations and bi-embeddability
- Classes of Ulm type and coding rank-homogeneous trees in other structures
- Comparing Classes of Finite Structures
- Complete analytic equivalence relations
- Computable categoricity and the Ershov hierarchy
- Computable structures and the hyperarithmetical hierarchy
- Computable trees of Scott rank ω1CK, and computable approximation
- Effective categoricity of equivalence structures
- Equivalence Relations on Classes of Computable Structures
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3090999 (Why is no real title available?)
- Invariant descriptive set theory
- New Directions in Descriptive Set Theory
- On the Equimorphism Types of Linear Orderings
- Recursive Pseudo-Well-Orderings
- The classification of hypersmooth Borel equivalence relations
- The computable embedding problem
- The effective theory of Borel equivalence relations
- The isomorphism problem for torsion-free abelian groups is analytic complete
- The isomorphism relation on countable torsion free abelian groups
- Turing computable embeddings
- Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups
Cited in
(60)- Turing degrees of certain isomorphic images of computable relations
- Jumps of computably enumerable equivalence relations
- Computable transformations of structures
- Enumerating classes of effective quasi-Polish spaces
- Completeness of the hyperarithmetic isomorphism equivalence relation
- The theory of ceers computes true arithmetic
- Classifying equivalence relations in the Ershov hierarchy
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies
- Using computability to measure complexity of algebraic structures and classes of structures
- On computably enumerable structures
- Computable isomorphisms of distributive lattices
- Graphs realised by r.e. equivalence relations
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Computable abelian groups
- Classes of structures with no intermediate isomorphism problems
- Comparing classes of finite sums
- On ^0_1-classification of relations on computable structures
- Equivalence relations that are ^0_3 complete for computable reducibility (extended abstract)
- Rice sequences of relations
- Isomorphism of abstract knowledge decompositions
- A survey on universal computably enumerable equivalence relations
- Strong isomorphism reductions in complexity theory
- The relation of recursive isomorphism for countable structures
- ISOMORPHISM ON HYP
- Equivalence Relations on Classes of Computable Structures
- scientific article; zbMATH DE number 1302479 (Why is no real title available?)
- Torsion-free abelian groups with optimal Scott families
- Computable topological groups and Pontryagin duality
- Procedural isomorphism, analytic information and -conversion by value
- The completeness of isomorphism
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
- Primitive recursive equivalence relations and their primitive recursive complexity
- Souslin quasi-orders and bi-embeddability of uncountable structures
- Assigning an isomorphism type to a hyperdegree
- Bi‐embeddability spectra and bases of spectra
- Isomorphism and classification for countable structures
- Relatively Hyperimmune Relations on Structures
- Classes of structures with universe a subset of \(\omega _{1}\)
- Isomorphism of Computable Structures and Vaught's Conjecture
- Isomorphisms and definable relations on computable models
- Comparing Classes of Finite Structures
- Computable embeddability for algebraic structures
- Agreement reducibility
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- STRUCTURAL HIGHNESS NOTIONS
- Failure modes for structural highness notions
- The isomorphism problem for classes of computable fields
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Computable structure theory of partial combinatory algebras
- Limit learning equivalence structures
- Complexity of the isomorphism problem for computable free projective planes of finite rank
- Reducibilities among equivalence relations induced by recursively enumerable structures
This page was built for publication: Isomorphism relations on computable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388722)
