Complexity, decidability and completeness
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45)
Recommendations
- Complexity and decidability
- Definability, decidability, complexity
- scientific article; zbMATH DE number 4011938
- Compositionality, computability, and complexity
- scientific article; zbMATH DE number 994428
- Computability and complexity theory
- scientific article; zbMATH DE number 2072508
- Expressive completeness and decidability
Cites work
- Class groups of integral group rings
- Complexity-theoretic algebra. II: Boolean algebras
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Fast Multiple-Precision Evaluation of Elementary Functions
- Feasible Graphs and Colorings
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Polynomial-time Abelian groups
- Polynomial-time versus recursive models
- Recursively presented games and strategies
Cited in
(10)- Completeness proofs for propositional logic with polynomial-time connectives
- Decidability and complexity analysis by basic paramodulation
- Complexity of terms, composition, and hypersubstitution
- Expressive completeness and decidability
- Turing-Completeness Totally Free
- Consistency and optimality
- scientific article; zbMATH DE number 3596249 (Why is no real title available?)
- scientific article; zbMATH DE number 1302671 (Why is no real title available?)
- Consistency, optimality, and incompleteness
- Computing and Combinatorics
This page was built for publication: Complexity, decidability and completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480615)
