The following pages link to Internalizing labelled deduction (Q4952029):
Displayed 24 items.
- A family of Gödel hybrid logics (Q631082) (← links)
- Intuitionistic hybrid logic: introduction and survey (Q764256) (← links)
- Sequent calculi and decidability for intuitionistic hybrid logic (Q764257) (← links)
- Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere (Q817688) (← links)
- Axioms for classical, intuitionistic, and paraconsistent hybrid logic (Q851196) (← links)
- Pure extensions, proof rules, and hybrid axiomatics (Q863181) (← links)
- A proof-theoretic study of the correspondence of hybrid logic and classical logic (Q1006454) (← links)
- Natural deduction for first-order hybrid logic (Q1777372) (← links)
- Proofs and countermodels in non-classical logics (Q2254557) (← links)
- Intuitionistic hybrid logic (Q2506826) (← links)
- PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS (Q2804473) (← links)
- Higher-Order Syntax and Saturation Algorithms for Hybrid Logic (Q2867945) (← links)
- Testing XML constraint satisfiability (Q2867947) (← links)
- Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems (Q2867948) (← links)
- An efficient approach to nominal equalities in hybrid logic tableaux (Q2901189) (← links)
- Simple cut elimination proof for hybrid logic (Q2987759) (← links)
- Expressive Power and Decidability for Memory Logics (Q3511448) (← links)
- A Two-Dimensional Hybrid Logic of Subset Spaces (Q3601810) (← links)
- Truth-values as labels: a general recipe for labelled deduction (Q3643258) (← links)
- Why does the proof-theory of hybrid logic work so well? (Q3647283) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- A Hybrid Public Announcement Logic with Distributed Knowledge (Q4917078) (← links)
- Terminating Tableau Calculi for Hybrid Logics Extending K (Q4982112) (← links)
- Using tableau to decide description logics with full role negation and identity (Q5410334) (← links)