Structures computable in polynomial time. II
DOI10.1007/S10469-018-9465-XzbMATH Open1420.03105OpenAlexW4245421229MaRDI QIDQ1644852FDOQ1644852
Publication date: 22 June 2018
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-018-9465-x
categoricitycomputable categoricitycomputable stable relationspolynomially computable stable relations
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Autostability of models
- Recursively Categorical Linear Orderings
- Polynomial-time versus recursive models
- 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
- Existence and uniqueness of structures computable in polynomial time
- Recursive isomorphism types of recursive Boolean algebras
- Structures computable in polynomial time. I
- Constructivizable models with a linear structure of algebraic reducibility
- Some properties of algebraic reducibility of constructivizations
- Inner homomorphisms and positive-conditional terms
- Relations Intrinsically Recursive in Linear Orders
Cited In (15)
- Constructing punctually categorical semigroups
- Structures computable in polynomial time. I
- Effective categoricity of automatic equivalence and nested equivalence structures
- Fields of algebraic numbers computable in polynomial time. II
- A second step toward the strong polynomial-time hierarchy
- Primitive recursive fields and categoricity
- Punctual dimension of algebraic structures in certain classes
- Non-density in punctual computability
- Graphs are not universal for online computability
- Punctual copies of algebraic structures
- Online presentations of finitely generated structures
- Title not available (Why is that?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Definable Subsets of Polynomial-Time Algebraic Structures
- A structure of punctual dimension two
This page was built for publication: Structures computable in polynomial time. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644852)
