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)

• 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
• Universality of group embeddability
• Preserving categoricity and complexity of relations
• Actions of rigid groups on UHF-algebras
• Infinite-time Turing machines and Borel reducibility
• scientific article; zbMATH DE number 54531 (Why is no real title available?)
• Relative primeness and Borel partition properties for equivalence relations
• What is \(\ldots\) a Borel reduction?
• A classification of ordinals up to Borel isomorphism
• Cofinal families of Borel equivalence relations and quasiorders
• Complete groups are complete co-analytic
• Some equivalence relations which are Borel reducible to isomorphism between separable Banach spaces
• Countable structures, Ehrenfeucht strategies, and Wadge reductions
• THE QUANDARY OF QUANDLES: A BOREL COMPLETE KNOT INVARIANT
• Higher-dimensional obstructions for star reductions
• A classification of orbits admitting a unique invariant measure
• Universality of embeddability relations for coloured total orders
• On isometry and isometric embeddability between ultrametric Polish spaces
• The relation of recursive isomorphism for countable structures
• The classification of torsion-free abelian groups of finite rank up to isomorphism and up to quasi-isomorphism
• The isomorphism problem for torsion-free abelian groups is analytic complete
• On the number of permutatively inequivalent basic sequences in a Banach space
• Computable embeddings for pairs of linear orders
• On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite \(p\)-groups
• On the complexity of the relations of isomorphism and bi-embeddability
• Borel complexity and potential canonical Scott sentences
• There is no classification of the decidably presentable structures
• Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\)
• DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
• COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
• On ‐complete equivalence relations on the generalized Baire space
• On Borel reducibility in generalized Baire space
• Polish ultrametric Urysohn spaces and their isometry groups
• Can we classify complete metric spaces up to isometry?
• Classifying singularities up to analytic extensions of scalars is smooth
• Polish metric spaces with fixed distance set
• On the complexity of the classification problem for torsion-free Abelian groups of finite rank
• Borel equivalence relations induced by actions of the symmetric group
• scientific article; zbMATH DE number 2204765 (Why is no real title available?)
• Dynamical simplices and Borel complexity of orbit equivalence
• Measuring the classification difficulty of countable torsion-free Abelian groups.
• On the complexity of the isomorphism relation for fields of finite transcendence degree
• Composites of algebraically closed fields

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)