scientific article; zbMATH DE number 1507188

MaRDI QIDQ4503908zbMATH OpenFDO

Authors Stéphane Demri, Rajeev Goré

Publication date 17 January 2001

zbMATH Keywords

decidable fragments of classical first-order logicembeddingguarded fragmentprovability logic

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• scientific article; zbMATH DE number 1414298
• On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic
• Transitivity and equivalence in decidable fragments of first-order logic: a survey
• First-order satisfiability in Gödel logics: an NP-complete fragment
• Completeness and decidability of general first-order logic (with a detour through the guarded fragment)
• The decidability of the intensional fragment of classical linear logic
• Decidable fragments of many-sorted logic
• Decidable Fragments of Many-Sorted Logic
• Capturing complexity classes by fragments of second-order logic
• The Exact Complexity of the First-Order Logic Definability Problem

Cited in

(1)

• Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators

This page was built for publication:

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