Existence and uniqueness of structures computable in polynomial time

DOI10.1007/s10469-016-9377-6zbMath1361.03042OpenAlexW2394740678MaRDI QIDQ321268

P. E. Alaev

Publication date: 13 October 2016

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

Full work available at URL: https://doi.org/10.1007/s10469-016-9377-6

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (15)

Fields of algebraic numbers computable in polynomial time. II ⋮ Structures computable in polynomial time. II ⋮ Structures computable in polynomial time. I ⋮ The diversity of categoricity without delay ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Punctually presented structures I: Closure theorems ⋮ Categoricity for primitive recursive and polynomial Boolean algebras ⋮ Algebraic structures computable without delay ⋮ Eliminating unbounded search in computable algebra ⋮ The back-and-forth method and computability without delay ⋮ Punctual categoricity relative to a computable oracle ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision ⋮ Fields of algebraic numbers computable in polynomial time. I ⋮ Searching for applicable versions of computable structures

Cites Work

• Polynomial-time versus recursive models
• Algebraically nonequivalent constructivization for infinite-dimensional vector space
• Polynomial-time Abelian groups
• Complexity and categoricity
• Algorithmic degree of unars
• Algebraic dependences and reducibilities of constructivizations in universal domains
• Countability of widths of algebraic reducibility structures for models in some classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Existence and uniqueness of structures computable in polynomial time