Best solving modal equations
From MaRDI portal
Classical propositional calculus enjoys the following property: for every formula \(A\), if there is a substitution \(\sigma\), such that \(\sigma(A)\) is provable, then there is ``the best substitution with this property. But for other logical calculi, for some modal calculi in particular, this property is not valid. However in many systems, like K4, S4, S4Grz, GL, etc., there are finitely many ``best substitutions for any formula admitting at least a unifier. In other words if an equation is solvable in the free algebra, then there are finitely many ``best solutions. The author shows that such solutions can be effectively computed.
Recommendations
Cites work
- A Resolution/Tableaux Algorithm for Projective Approximations in IPC
- Boolean unification - the story so far
- scientific article; zbMATH DE number 4014675 (Why is no real title available?)
- scientific article; zbMATH DE number 4055570 (Why is no real title available?)
- scientific article; zbMATH DE number 3679782 (Why is no real title available?)
- scientific article; zbMATH DE number 534879 (Why is no real title available?)
- Logics containing K4. Part I
- Logics containing K4. Part II
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- Semantics-Based Translation Methods for Modal Logics
- Unification in intuitionistic logic
- Unification theory
- Unification through projectivity
Cited in
(57)- Proof theory for admissible rules
- Equations in free topoboolean algebra
- About the unification type of \(\mathbf{K}+\square \square \bot\)
- Multiagent temporal logics, unification problems, and admissibilities
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Unification in pretabular extensions of S4
- Rules with parameters in modal logic. I.
- Admissibility via natural dualities
- Admissibility in De Morgan algebras
- Frege systems for extensible modal logics
- On rules
- Finitary unification in locally tabular modal logics characterized
- Admissible rules for six intuitionistic modal logics
- Hereditarily structurally complete intermediate logics: Citkin's theorem via duality
- Admissible bases via stable canonical rules
- A syntactic approach to unification in transitive reflexive modal logics
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
- A tableau method for checking rule admissibility in S4
- Contact logic is finitary for unification with constants
- scientific article; zbMATH DE number 4204319 (Why is no real title available?)
- UNIFICATION IN INTERMEDIATE LOGICS
- Admissibility and Unifiability in Contact Logics
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- Unification in the Description Logic $\mathcal{EL}$
- Canonical rules
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- On unification and admissible rules in Gabbay-de Jongh logics
- Unification in epistemic logics
- KD is nullary
- Checking admissibility using natural dualities
- Ideal Related Algebras and Their Logics Extended Abstract
- Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond
- The basic intuitionistic logic of proofs
- Filtering unification and most general unifiers in modal logic
- UNIFICATION IN SUPERINTUITIONISTIC PREDICATE LOGICS AND ITS APPLICATIONS
- Preservation of admissible rules when combining logics
- Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Dynamic temporal logical operations in multi-agent logics
- Admissibility and unification in the modal logics related to S4.2
- Admissible rules in the implication-negation fragment of intuitionistic logic
- Best unifiers in transitive modal logics
- About the unification types of modal logics
- Unification types and union splittings in intermediate logics
- Universal proof theory: feasible admissibility in intuitionistic modal logics
- Relative unification in intuitionistic logic: towards the provability logic of HA
- Unification in subsystems of polymodal provability logic GLP
- Computing most general unifiers in Euclidean modal logics
- Projective relative unification through duality
- On the unification problem for \(\operatorname{GLP} \)
- Undecidability of admissibility in the product of two \textbf{Alt} logics
- Unification in linear temporal logic LTL
- About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
- Logical equations in monadic logic
- Complexity of admissible rules
- Reflecting rules: a note on generalizing the deduction theorem
This page was built for publication: Best solving modal equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971794)
