Existence and uniqueness of structures computable in polynomial time

DOI10.1007/S10469-016-9377-6MaRDI QIDQ321268zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3934393 (Why is no real title available?)
• scientific article; zbMATH DE number 58131 (Why is no real title available?)
• scientific article; zbMATH DE number 1202105 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• scientific article; zbMATH DE number 1534573 (Why is no real title available?)
• Algebraic dependences and reducibilities of constructivizations in universal domains
• Algebraically nonequivalent constructivization for infinite-dimensional vector space
• Algorithmic degree of unars
• Complexity and categoricity
• Countability of widths of algebraic reducibility structures for models in some classes
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models

Cited in

(16)

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

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

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