A Borel reductibility theory for classes of countable structures

DOI10.2307/2274750MaRDI QIDQ3033746zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3155247 (Why is no real title available?)
• scientific article; zbMATH DE number 3090999 (Why is no real title available?)
• Hodge cycles, motives, and Shimura varieties
• On the necessary use of abstract set theory
• Stability of nilpotent groups of class 2 and prime exponent
• Theories of linear order

Cited in

(only showing first 100 items - show all)

• A note on computable embeddings for ordinals and their reverses
• Completeness of the hyperarithmetic isomorphism equivalence relation
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Jump operations for Borel graphs
• Polish group actions: Dichotomies and generalized elementary embeddings
• The class of non-Desarguesian projective planes is Borel complete
• New jump operators on equivalence relations
• Reducibility of equivalence relations arising from nonstationary ideals under large cardinal assumptions
• A Descriptive View of Combinatorial Group Theory
• Borel structures and Borel theories
• A non-classification result for wild knots
• The complexity of the topological conjugacy problem for Toeplitz subshifts
• On the isomorphism problem for measures on Boolean algebras
• Borel Reductibility and Classification of von Neumann Algebras
• Torsion-free abelian groups are consistently $ {\rm a}\Delta ^1_2$-complete
• Anti-classification results for groups acting freely on the line
• On Σ¹ ₁ equivalence relations over the natural numbers
• The classification of countable models of set theory
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• Countable structures with a fixed group of automorphisms
• On the degree structure of equivalence relations under computable reducibility
• Computable transformations of structures
• The conjugacy problem for the automorphism group of the random graph
• The isomorphism problem for computable Abelian _p-groups of bounded length
• On the complexity of the isomorphism relation for finitely generated groups
• Computable embeddings and strongly minimal theories
• Minimal subspaces and isomorphically homogeneous sequences in a Banach space
• The prospects for mathematical logic in the twenty-first century
• Some dichotomy theorems for isomorphism relations of countable models
• Categoricity spectra for polymodal algebras
• On the classification of positions and complex structures in Banach spaces
• Classifying equivalence relations in the Ershov hierarchy
• On the reducibility of isomorphism relations
• scientific article; zbMATH DE number 1547008 (Why is no real title available?)
• Classification problems in continuum theory
• On \(\Sigma_1^1\)-completeness of quasi-orders on \(\kappa^\kappa\)
• CONTINUOUS LOGIC AND BOREL EQUIVALENCE RELATIONS
• Uncountable structures are not classifiable up to bi-embeddability
• 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
• Invariantly universal analytic quasi-orders
• Basis problem for turbulent actions. I: Tsirelson submeasures
• The complexity of classification problems for models of arithmetic
• The completeness of the isomorphism relation for countable Boolean algebras
• Borel equivalence relations and classifications of countable models
• On the classification of automorphisms of trees
• Categoricity of computable infinitary theories
• Degree spectra and computable dimensions in algebraic structures
• Turing computable embeddings of equivalences other than isomorphism
• Localized cohomology and some applications of Popa's cocycle superrigidity theorem
• Borel completeness of some \(\aleph_{0}\)-stable theories
• 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
• The computable embedding problem
• Classification from a Computable Viewpoint
• Equivalence of codes for countable sets of reals
• Primitive recursive equivalence relations and their primitive recursive complexity
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Characterizing the existence of a Borel complete expansion
• The bi-embeddability relation for countable abelian groups
• Borel reducibility as an additive property of domains
• Linear algebraic groups and countable Borel equivalence relations
• Classes of algebraic structures
• Comparing classes of finite sums
• The homeomorphism problem for countable topological spaces
• Learning algebraic structures with the help of Borel equivalence relations
• Comparing Borel reducibility and depth of an \(\omega\)-stable theory
• The classification problem for torsion-free abelian groups of finite rank
• Computable embeddability for algebraic structures
• The classification problem for von Neumann factors
• Invariant universality for quandles and fields
• Isomorphism relations on computable structures
• Polish groupoids and functorial complexity
• Structurable equivalence relations
• Turing computable embeddings
• scientific article; zbMATH DE number 5722527 (Why is no real title available?)
• Euclidean algorithm for a class of linear orders
• Borel reducibility and symmetric models
• 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
• Non-isomorphism invariant Borel quantifiers
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• A cofinal family of equivalence relations and Borel ideals generating them
• The classification problem for operator algebraic varieties and their multiplier algebras
• On the unique representation of families of sets
• MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
• Souslin quasi-orders and bi-embeddability of uncountable structures
• The tree of tuples of a structure
• Non-ergodic Banach spaces are near Hilbert
• The classification of hypersmooth Borel equivalence relations
• scientific article; zbMATH DE number 4106830 (Why is no real title available?)
• 2008 Annual Meeting of the Association for Symbolic Logic
• Isomorphism of homogeneous structures
• Borel sets, countable models
• On the isomorphism problem for some classes of computable algebraic structures

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)