scientific article; zbMATH DE number 1302879
From MaRDI portal
Publication:4249365
zbMath0941.03035MaRDI QIDQ4249365
Douglas Cenzer, Jeffery B. Remmel
Publication date: 27 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyBoolean algebrasvector spacerecursive modelsp-time modelscomplexity-theoretic algebracomplexity-theoretic model theoryfeasible models
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items
Definable Subsets of Polynomial-Time Algebraic Structures, Rogers semilattices of punctual numberings, Fields of algebraic numbers computable in polynomial time. II, Existence and uniqueness of structures computable in polynomial time, Structures computable in polynomial time. I, Complexity and categoricity, Graphs are not universal for online computability, Primitive recursive reverse mathematics, A criterion for P-computability of structures, A structure of punctual dimension two, The complexity of inversion in groups, Online presentations of finitely generated structures, Polynomially computable structures with finitely many generators, Categoricity for primitive recursive and polynomial Boolean algebras, Primitively recursively categorical linear orderings, Metric structures and probabilistic computation, Non-density in punctual computability, Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007, Space complexity of abelian groups, FOUNDATIONS OF ONLINE STRUCTURE THEORY, On bi-embeddable categoricity of algebraic structures, The isomorphism problem on classes of automatic structures with transitive relations, Fields of algebraic numbers computable in polynomial time. I, Feasible graphs with standard universe, Finitely generated structures computable in polynomial time, Unnamed Item, Quotient structures and groups computable in polynomial time, PUNCTUAL CATEGORICITY AND UNIVERSALITY, Computable embeddability for algebraic structures, Searching for applicable versions of computable structures
