A Borel reductibility theory for classes of countable structures
From MaRDI portal
Publication:3033746
DOI10.2307/2274750zbMath0692.03022OpenAlexW2016314496MaRDI QIDQ3033746
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
linear ordersCantor spaceBorel reducibilityBorel completenessfields of characteristic 0Borel-measurable functioninvariant Borel class
Descriptive set theory (03E15) Other infinitary logic (03C75) Model theory of denumerable and separable structures (03C15) Hierarchies of computability and definability (03D55)
Related Items (only showing first 100 items - show all)
Degree spectra and computable dimensions in algebraic structures ⋮ The classification problem for torsion-free abelian groups of finite rank ⋮ The homeomorphism problem for countable topological spaces ⋮ Comparing classes of finite sums ⋮ The Complexity of Classification Problems for Models of Arithmetic ⋮ DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS ⋮ Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ New jump operators on equivalence relations ⋮ Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ Countable structures, Ehrenfeucht strategies, and Wadge reductions ⋮ Some equivalence relations which are Borel reducible to isomorphism between separable Banach spaces ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ There is no classification of the decidably presentable structures ⋮ Complete groups are complete co-analytic ⋮ The complexity of the topological conjugacy problem for Toeplitz subshifts ⋮ On Borel reducibility in generalized Baire space ⋮ Dynamical simplices and Borel complexity of orbit equivalence ⋮ Can we classify complete metric spaces up to isometry? ⋮ Souslin quasi-orders and bi-embeddability of uncountable structures ⋮ Preserving categoricity and complexity of relations ⋮ INTERPRETING A FIELD IN ITS HEISENBERG GROUP ⋮ On the reducibility of isomorphism relations ⋮ Polish ultrametric Urysohn spaces and their isometry groups ⋮ The conjugacy problem for automorphism groups of countable homogeneous structures ⋮ The conjugacy problem for the automorphism group of the random graph ⋮ The classification problem for operator algebraic varieties and their multiplier algebras ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ Anti-classification results for groups acting freely on the line ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ The classification of countable models of set theory ⋮ Classifying singularities up to analytic extensions of scalars is smooth ⋮ Measuring the classification difficulty of countable torsion-free Abelian groups. ⋮ Composites of algebraically closed fields ⋮ Borel reducibility and symmetric models ⋮ Invariant universality for quandles and fields ⋮ On $\Sigma _1^1$-completeness of quasi-orders on $\kappa ^\kappa $ ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ JUMP OPERATIONS FOR BOREL GRAPHS ⋮ Equivalence of codes for countable sets of reals ⋮ The Prospects for Mathematical Logic in the Twenty-First Century ⋮ On isometry and isometric embeddability between ultrametric Polish spaces ⋮ A Descriptive View of Combinatorial Group Theory ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ The bi-embeddability relation for countable abelian groups ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ Categoricity spectra for polymodal algebras ⋮ Minimal subspaces and isomorphically homogeneous sequences in a Banach space ⋮ Some dichotomy theorems for isomorphism relations of countable models ⋮ On the classification of positions and complex structures in Banach spaces ⋮ Polish group actions: Dichotomies and generalized elementary embeddings ⋮ Actions of rigid groups on UHF-algebras ⋮ The complexity of topological conjugacy of pointed Cantor minimal systems ⋮ The complexity of isomorphism for complete theories of linear orders with unary predicates ⋮ Infinite-Time Turing Machines and Borel Reducibility ⋮ Localized cohomology and some applications of Popa's cocycle superrigidity theorem ⋮ The computable embedding problem ⋮ On the isomorphism problem for measures on Boolean algebras ⋮ Polish metric spaces with fixed distance set ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Computable transformations of structures ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ On ‐complete equivalence relations on the generalized Baire space ⋮ Universality of embeddability relations for coloured total orders ⋮ On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank ⋮ The class of non-Desarguesian projective planes is Borel complete ⋮ The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes ⋮ On the number of permutatively inequivalent basic sequences in a Banach space ⋮ The Complexity of the Collection of Countable Linear Orders of the form I + I ⋮ Non-ergodic Banach spaces are near Hilbert ⋮ 2008 Annual Meeting of the Association for Symbolic Logic ⋮ The isomorphism problem for computable Abelian p-groups of bounded length ⋮ Categoricity of computable infinitary theories ⋮ Reducibility of equivalence relations arising from nonstationary ideals under large cardinal assumptions ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\) ⋮ Analytic equivalence relations and bi-embeddability ⋮ The classification problem for von Neumann factors ⋮ Borel Reductibility and Classification of von Neumann Algebras ⋮ Computable embeddings for pairs of linear orders ⋮ THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES ⋮ On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups ⋮ Countable structures with a fixed group of automorphisms ⋮ Invariantly universal analytic quasi-orders ⋮ The complexity of the classification problems of finite-dimensional continua ⋮ On Σ1 1 equivalence relations over the natural numbers ⋮ Borel equivalence relations induced by actions of the symmetric group ⋮ On the complexity of the isomorphism relation for finitely generated groups ⋮ Classification from a Computable Viewpoint ⋮ Universality of group embeddability ⋮ A cofinal family of equivalence relations and Borel ideals generating them ⋮ Linear algebraic groups and countable Borel equivalence relations ⋮ A note on computable embeddings for ordinals and their reverses ⋮ Relative primeness and Borel partition properties for equivalence relations ⋮ On the classification of automorphisms of trees ⋮ Higher-dimensional obstructions for star reductions ⋮ The relation of recursive isomorphism for countable structures ⋮ The completeness of the isomorphism relation for countable Boolean algebras
Cites Work
This page was built for publication: A Borel reductibility theory for classes of countable structures
