The following pages link to The classical decision problem. (Q5944231):
Displaying 35 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- The periodic domino problem revisited (Q410732) (← links)
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases (Q549726) (← links)
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- Tilings and submonoids of metabelian groups. (Q633769) (← links)
- Query languages for data exchange: beyond unions of conjunctive queries (Q639842) (← links)
- Trakhtenbrot theorem and first-order axiomatic extensions of MTL (Q897476) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- A critical reflection on optimal decision. (Q1417552) (← links)
- IPL: an integration property language for multi-model cyber-physical systems (Q2024345) (← links)
- \(Log_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions (Q2029709) (← links)
- Weak essentially undecidable theories of concatenation (Q2085573) (← links)
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates (Q2096446) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Embedding causal team languages into predicate logic (Q2172831) (← links)
- The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT (Q2251124) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Decidable subsets of open logic and an algorithm for R-calculus (Q2515454) (← links)
- Quasiperiodicity and Non-computability in Tilings (Q2946338) (← links)
- Ensuring Correctness of Model Transformations While Remaining Decidable (Q3179408) (← links)
- Approximations of Mappings (Q3295272) (← links)
- Combining Consistency and Confidentiality Requirements in First-Order Databases (Q3399206) (← links)
- Effective Closed Subshifts in 1D Can Be Implemented in 2D (Q3586005) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Combining Description Logics, Description Graphs, and Rules (Q3655191) (← links)
- On the classical decision problem (Q3971263) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- (Q5090984) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)
- VON NEUMANN’S CONSISTENCY PROOF (Q5737949) (← links)
- Are bundles good deals for first-order modal logic? (Q6116193) (← links)
- A weak theory of building blocks (Q6589164) (← links)
