scientific article; zbMATH DE number 1302879

MaRDI QIDQ4249365zbMATH OpenFDO

Authors Douglas Cenzer, Jeffrey Remmel

Publication date 27 July 2000

zbMATH Keywords

Boolean algebrascomplexity-theoretic algebracomplexity-theoretic model theoryfeasible modelsp-time modelsrecursive modelssurveyvector space

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 1302871
• Complexity-theoretic algebra. II: Boolean algebras
• Computability-Theoretic Complexity of Countable Structures
• scientific article; zbMATH DE number 4087025
• Computational complexity in algebraic systems

Cited in

(35)

• 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
• Feasible graphs with standard universe
• Complexity and categoricity
• Categoricity for primitive recursive and polynomial Boolean algebras
• Primitively recursively categorical linear orderings
• Non-density in punctual computability
• On bi-embeddable categoricity of algebraic structures
• Finitely generated structures computable in polynomial time
• Quotient structures and groups computable in polynomial time
• Searching for applicable versions of computable structures
• Fields of algebraic numbers computable in polynomial time. II
• Graphs are not universal for online computability
• Online presentations of finitely generated structures
• Polynomially computable structures with finitely many generators
• Structures computable in polynomial time. I
• The isomorphism problem on classes of automatic structures with transitive relations
• Existence and uniqueness of structures computable in polynomial time
• scientific article; zbMATH DE number 176212 (Why is no real title available?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• Rogers semilattices of punctual numberings
• A structure of punctual dimension two
• Foundations of online structure theory. II: The operator approach
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Metric structures and probabilistic computation
• Applications of Kolmogorov complexity to computable model theory
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Computable embeddability for algebraic structures
• Primitive recursive reverse mathematics
• A criterion for P-computability of structures
• The complexity of inversion in groups
• Description of structures computable in polynomial time
• Defining algorithmically presented structures in first order logic
• Online and feasible presentability: from trees to modal algebras
• Fields of algebraic numbers computable in polynomial time. I

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249365)