Computable Structure Theory
From MaRDI portal
Publication:5002107
DOI10.1017/9781108525749OpenAlexW4211106290MaRDI QIDQ5002107
Publication date: 26 July 2021
Full work available at URL: https://doi.org/10.1017/9781108525749
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)
Related Items (14)
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 ⋮ 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 ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ Learning families of algebraic structures from informant
This page was built for publication: Computable Structure Theory
