Comparing Classes of Finite Structures

DOI10.1023/B:ALLO.0000048827.30718.2czbMath1097.03026arXiv0803.3291OpenAlexW2964175971MaRDI QIDQ5476777

Sara Miller, D. F. Cummins, Wesley Calvert, Julia F. Knight

Publication date: 18 July 2006

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.3291

zbMATH Keywords

finite structurefinite modele-reducibilitycomputable transformation of the class of structures

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (28)

Index set of structures with two equivalence relations that are autostable relative to strong constructivizations ⋮ Comparing classes of finite sums ⋮ On functors enumerating structures ⋮ Computable embeddings of classes of structures under enumeration and Turing operators ⋮ INTERPRETING A FIELD IN ITS HEISENBERG GROUP ⋮ Agreement reducibility ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ On the effective universality of mereological theories ⋮ Classes of algebraic structures ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS ⋮ Learning families of algebraic structures from informant ⋮ Isomorphism relations on computable structures ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ Turing computable embeddings of equivalences other than isomorphism ⋮ Scott sentences for certain groups ⋮ Categoricity spectra for polymodal algebras ⋮ Equivalence Relations on Classes of Computable Structures ⋮ The computable embedding problem ⋮ 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 ⋮ Ranked structures and arithmetic transfinite recursion ⋮ Index sets for some classes of structures ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ Computable embeddings for pairs of linear orders ⋮ On Σ¹ ₁ equivalence relations over the natural numbers ⋮ A note on computable embeddings for ordinals and their reverses

This page was built for publication: Comparing Classes of Finite Structures