The classical decision problem.
computational complexity of decidable problemsdecidabilitydecidable classesfirst-order logicsurveytiling problemsundecidabilityundecidable classes
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35) Analysis of algorithms and problem complexity (68Q25)
For a review of the original edition (Springer, Berlin, 1997) see Zbl 0865.03004.
- scientific article; zbMATH DE number 965572
- scientific article; zbMATH DE number 8775
- Decision theory.
- scientific article; zbMATH DE number 6009884
- A decision problem for decision problems
- On decision-making in possibility theory.
- An introduction to decision theory.
- An Introduction to Decision Theory
- Barrett and Arntzenius's infinite decision puzzle.
- Canonization for two variables and puzzles on the square
- A critical reflection on optimal decision.
- IPL: an integration property language for multi-model cyber-physical systems
- \(\mathit{Log}_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions
- Weak essentially undecidable theories of concatenation
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Embedding causal team languages into predicate logic
- The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
- On the parameterized complexity of graph modification to first-order logic properties
- Combining answer set programming with description logics for the semantic web
- FLP answer set semantics without circular justifications for general logic programs
- Decidable subsets of open logic and an algorithm for R-calculus
- Quasiperiodicity and non-computability in tilings
- A logical approach to locality in pictures languages
- Ensuring correctness of model transformations while remaining decidable
- Approximations of mappings
- Combining Consistency and Confidentiality Requirements in First-Order Databases
- Effective closed subshifts in 1D can be implemented in 2D
- From Philosophical to Industrial Logics
- Combining description logics, description graphs, and rules
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module
- scientific article; zbMATH DE number 8775 (Why is no real title available?)
- The periodic domino problem revisited
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
- Bundled fragments of first-order modal logic: (un)decidability
- Languages, Decidability, and Complexity
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
- On reasoning about structural equality in XML: a description logic approach
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- VON NEUMANN’S CONSISTENCY PROOF
- Are bundles good deals for first-order modal logic?
- Tilings and submonoids of metabelian groups.
- Query languages for data exchange: beyond unions of conjunctive queries
- A weak theory of building blocks
- Automated reasoning for mathematics
- Trakhtenbrot theorem and first-order axiomatic extensions of MTL
This page was built for publication: The classical decision problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944231)
