A Borel reductibility theory for classes of countable structures
DOI10.2307/2274750zbMATH Open0692.03022OpenAlexW2016314496MaRDI QIDQ3033746FDOQ3033746
Authors: Harvey M. Friedman, Lee J. Stanley
Publication date: 1989
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274750
Recommendations
Cantor spacelinear ordersBorel reducibilityBorel completenessBorel-measurable functionfields of characteristic 0invariant Borel class
Hierarchies of computability and definability (03D55) Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15) Other infinitary logic (03C75)
Cites Work
Cited In (only showing first 100 items - show all)
- Turing computable embeddings of equivalences other than isomorphism
- Borel completeness of some \(\aleph_{0}\)-stable theories
- Categoricity of computable infinitary theories
- Degree spectra and computable dimensions in algebraic structures
- Localized cohomology and some applications of Popa's cocycle superrigidity theorem
- Primitive recursive equivalence relations and their primitive recursive complexity
- Classification from a Computable Viewpoint
- The computable embedding problem
- Linear algebraic groups and countable Borel equivalence relations
- Borel reducibility as an additive property of domains
- Comparing classes of finite sums
- The classification problem for torsion-free abelian groups of finite rank
- Isomorphism relations on computable structures
- Comparing Borel reducibility and depth of an \(\omega\)-stable theory
- Turing computable embeddings
- Structurable equivalence relations
- Euclidean algorithm for a class of linear orders
- The classification problem for von Neumann factors
- Title not available (Why is that?)
- The Borel complexity of isomorphism for o-minimal theories
- The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes
- Using computability to measure complexity of algebraic structures and classes of structures
- Analytic equivalence relations and bi-embeddability
- The complexity of the classification problems of finite-dimensional continua
- The classification problem for operator algebraic varieties and their multiplier algebras
- On the unique representation of families of sets
- Turing computable embeddings, computable infinitary equivalence, and linear orders
- A cofinal family of equivalence relations and Borel ideals generating them
- The tree of tuples of a structure
- The classification of hypersmooth Borel equivalence relations
- Non-ergodic Banach spaces are near Hilbert
- 2008 Annual Meeting of the Association for Symbolic Logic
- The conjugacy problem for automorphism groups of countable homogeneous structures
- Isomorphism of homogeneous structures
- On the isomorphism problem for some classes of computable algebraic structures
- Infinite-time Turing machines and Borel reducibility
- Cofinal families of Borel equivalence relations and quasiorders
- Preserving categoricity and complexity of relations
- THE QUANDARY OF QUANDLES: A BOREL COMPLETE KNOT INVARIANT
- The classification of torsion-free abelian groups of finite rank up to isomorphism and up to quasi-isomorphism
- Countable structures, Ehrenfeucht strategies, and Wadge reductions
- On isometry and isometric embeddability between ultrametric Polish spaces
- A classification of orbits admitting a unique invariant measure
- The isomorphism problem for torsion-free abelian groups is analytic complete
- On the number of permutatively inequivalent basic sequences in a Banach space
- On the complexity of the relations of isomorphism and bi-embeddability
- On ‐complete equivalence relations on the generalized Baire space
- On Borel reducibility in generalized Baire space
- Title not available (Why is that?)
- Polish ultrametric Urysohn spaces and their isometry groups
- On the complexity of the classification problem for torsion-free Abelian groups of finite rank
- Polish metric spaces with fixed distance set
- Classifying singularities up to analytic extensions of scalars is smooth
- On the complexity of the isomorphism relation for fields of finite transcendence degree
- Borel equivalence relations induced by actions of the symmetric group
- Measuring the classification difficulty of countable torsion-free Abelian groups.
- Composites of algebraically closed fields
- Polish group actions: Dichotomies and generalized elementary embeddings
- Borel Reductibility and Classification of von Neumann Algebras
- On the isomorphism problem for measures on Boolean algebras
- The classification of countable models of set theory
- On Σ1 1 equivalence relations over the natural numbers
- Classes of Ulm type and coding rank-homogeneous trees in other structures
- On the degree structure of equivalence relations under computable reducibility
- The isomorphism problem for computable Abelian p-groups of bounded length
- Computable transformations of structures
- On the complexity of the isomorphism relation for finitely generated groups
- The conjugacy problem for the automorphism group of the random graph
- Minimal subspaces and isomorphically homogeneous sequences in a Banach space
- On the reducibility of isomorphism relations
- Title not available (Why is that?)
- Classification problems in continuum theory
- Classifying equivalence relations in the Ershov hierarchy
- Categoricity spectra for polymodal algebras
- On the classification of positions and complex structures in Banach spaces
- On \(\Sigma_1^1\)-completeness of quasi-orders on \(\kappa^\kappa\)
- Borel equivalence relations and classifications of countable models
- The completeness of the isomorphism relation for countable Boolean algebras
- A generalized Borel-reducibility counterpart of Shelah's main gap theorem
- The complexity of topological conjugacy of pointed Cantor minimal systems
- The complexity of isomorphism for complete theories of linear orders with unary predicates
- INTERPRETING A FIELD IN ITS HEISENBERG GROUP
- The complexity of continuous embeddability between dendrites
- The Complexity of the Collection of Countable Linear Orders of the form I + I
- Equivalence of codes for countable sets of reals
- Characterizing the existence of a Borel complete expansion
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
- The bi-embeddability relation for countable abelian groups
- Classes of algebraic structures
- The homeomorphism problem for countable topological spaces
- Learning algebraic structures with the help of Borel equivalence relations
- Computable embeddability for algebraic structures
- Polish groupoids and functorial complexity
- Invariant universality for quandles and fields
- Borel reducibility and symmetric models
- Non-isomorphism invariant Borel quantifiers
- MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
- Souslin quasi-orders and bi-embeddability of uncountable structures
- Title not available (Why is that?)
- Borel sets, countable models
This page was built for publication: A Borel reductibility theory for classes of countable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033746)