Computable Structure Theory
From MaRDI portal
Recommendations
Cited in
(45)- Computable structures and the hyperarithmetical hierarchy
- The computable dimension of ordered abelian groups
- Turing computability: structural theory
- Learning families of algebraic structures from informant
- Generalization of Shapiro's theorem to higher arities and noninjective notations
- scientific article; zbMATH DE number 6536307 (Why is no real title available?)
- A Complete Axiomatization of Computer Arithmetic
- scientific article; zbMATH DE number 41858 (Why is no real title available?)
- scientific article; zbMATH DE number 1984268 (Why is no real title available?)
- scientific article; zbMATH DE number 1531922 (Why is no real title available?)
- Definable Subsets of Polynomial-Time Algebraic Structures
- DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
- An introduction to the Scott complexity of countable structures and a survey of recent results
- The tree of tuples of a structure
- COPYING ONE OF A PAIR OF STRUCTURES
- INTERPRETING A FIELD IN ITS HEISENBERG GROUP
- scientific article; zbMATH DE number 5267925 (Why is no real title available?)
- ON COHESIVE POWERS OF LINEAR ORDERS
- Avoiding Medvedev reductions inside a linear order
- Polynomial-time axioms of choice and polynomial-time cardinality
- The 𝜔-Vaught’s conjecture
- Punctually presented structures I: Closure theorems
- Families of permutations and ideals of Turing degrees
- Every \(\Delta^0_2\) Polish space is computable topological
- On learning down-sets in quasi-orders, and ideals in Boolean algebras
- Scott sentence complexities of linear orderings
- \(L_{\omega \omega }, L_{\omega_1\omega }\), and the Wadge hierarchy
- On learning existentially definable subsets in a computable structure
- Computable categoricity relative to a C.E. degree
- Failure modes for structural highness notions
- Classifying different criteria for learning algebraic structures
- Relations enumerable from positive information
- Indivisibility and uniform computational strength
- Scott analysis, linear orders, and almost periodic functions
- The metamathematics of separated determinacy
- A characterization of strongly computable finite factorization domains
- Degrees of relations on canonically ordered natural numbers and integers
- Punctually presented structures. II: Comparing presentations.
- Permutation groups and ideals of Turing degrees
- Structures of finite punctual dimension \(n>2\)
- The structural complexity of models of arithmetic
- Punctual presentability in certain classes of algebraic structures
- Étale structures and the Joyal-Tierney representation theorem in countable model theory
- On computability-theoretic universality of Boolean-valued models
- Optimal syntactic definitions of back-and-forth types
This page was built for publication: Computable Structure Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002107)
