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

• Borel structures and Borel theories
• scientific article; zbMATH DE number 54531
• A generalized Borel-reducibility counterpart of Shelah's main gap theorem
• Borel equivalence relations and classifications of countable models
• Borel complexity and potential canonical Scott sentences

zbMATH Keywords

Cantor spacelinear ordersBorel reducibilityBorel completenessBorel-measurable functionfields of characteristic 0invariant Borel class

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15) Other infinitary logic (03C75)

Cites Work

• Title not available (Why is that?)
• Hodge cycles, motives, and Shimura varieties
• Title not available (Why is that?)
• Theories of linear order
• Stability of nilpotent groups of class 2 and prime exponent
• On the necessary use of abstract set theory

Cited In (only showing first 100 items - show all)

• 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
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• The bi-embeddability relation for countable abelian groups
• 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
• Souslin quasi-orders and bi-embeddability of uncountable structures
• Borel sets, countable models
• Universality of group embeddability
• Title not available (Why is that?)
• A classification of ordinals up to Borel isomorphism
• What is \(\ldots\) a Borel reduction?
• Actions of rigid groups on UHF-algebras
• Some equivalence relations which are Borel reducible to isomorphism between separable Banach spaces
• Complete groups are complete co-analytic
• Universality of embeddability relations for coloured total orders
• The relation of recursive isomorphism for countable structures
• Computable embeddings for pairs of linear orders
• Borel complexity and potential canonical Scott sentences
• There is no classification of the decidably presentable structures
• COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
• DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
• Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\)
• Can we classify complete metric spaces up to isometry?
• Dynamical simplices and Borel complexity of orbit equivalence
• CODING IN GRAPHS AND LINEAR ORDERINGS
• A note on computable embeddings for ordinals and their reverses
• Completeness of the hyperarithmetic isomorphism equivalence relation
• The class of non-Desarguesian projective planes is Borel complete
• A non-classification result for wild knots
• A Descriptive View of Combinatorial Group Theory
• Borel structures and Borel theories
• Reducibility of equivalence relations arising from nonstationary ideals under large cardinal assumptions
• The complexity of the topological conjugacy problem for Toeplitz subshifts
• Anti-classification results for groups acting freely on the line
• Countable structures with a fixed group of automorphisms
• Computable embeddings and strongly minimal theories
• The prospects for mathematical logic in the twenty-first century
• Some dichotomy theorems for isomorphism relations of countable models
• CONTINUOUS LOGIC AND BOREL EQUIVALENCE RELATIONS
• Basis problem for turbulent actions. I: Tsirelson submeasures
• Invariantly universal analytic quasi-orders
• The complexity of classification problems for models of arithmetic
• On the classification of automorphisms of trees
• Characterizing the existence of a Borel complete expansion
• Classes of algebraic structures
• MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
• Title not available (Why is that?)
• Relative primeness and Borel partition properties for equivalence relations
• Higher-dimensional obstructions for star reductions
• On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite \(p\)-groups
• Jump operations for Borel graphs
• New jump operators on equivalence relations
• Torsion-free abelian groups are consistently $ {\rm a}\Delta ^1_2$-complete
• Uncountable structures are not classifiable up to bi-embeddability
• 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
• 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

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)