The following pages link to Proof analysis in modal logic (Q812101):
Displaying 50 items.
- Modal logics, justification logics, and realization (Q286591) (← links)
- Analytic rules for mereology (Q300557) (← links)
- Labeled sequent calculus for justification logics (Q331048) (← links)
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Labeled sequent calculi for modal logics and implicit contractions (Q377468) (← links)
- Does the deduction theorem fail for modal logic? (Q383061) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- Non-classical elegance for sequent calculus enthusiasts (Q519853) (← links)
- On graph calculi for multi-modal logics (Q530865) (← links)
- Cut elimination in coalgebraic logics (Q618171) (← links)
- Reasoning about collectively accepted group beliefs (Q652734) (← links)
- Proof analysis in intermediate logics (Q661286) (← links)
- Sequent calculi and decidability for intuitionistic hybrid logic (Q764257) (← links)
- A more unified approach to free logics (Q830379) (← links)
- Deep sequent systems for modal logic (Q834716) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Multicomponent proof-theoretic method for proving interpolation properties (Q1799040) (← links)
- Recapturing dynamic logic of relation changers via bounded morphisms (Q2021560) (← links)
- A generalized proof-theoretic approach to logical argumentation based on hypersequents (Q2021565) (← links)
- Kripke semantics for intuitionistic Łukasiewicz logic (Q2021569) (← links)
- Proof-theoretic analysis of the logics of agency: the deliberative STIT (Q2046875) (← links)
- Validity, dialetheism and self-reference (Q2054126) (← links)
- Paraconsistent Gödel modal logic (Q2104534) (← links)
- On the proof theory of infinitary modal logic (Q2106873) (← links)
- From axioms to synthetic inference rules via focusing (Q2120974) (← links)
- A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082) (← links)
- Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq (Q2142084) (← links)
- Herzberger's limit rule with labelled sequent calculus (Q2193976) (← links)
- Labelled sequent calculi for Lewis' non-normal propositional modal logics (Q2243546) (← links)
- Proofs and countermodels in non-classical logics (Q2254557) (← links)
- Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
- Circular proofs for the Gödel-Löb provability logic (Q2343897) (← links)
- Modular sequent calculi for classical modal logics (Q2350219) (← links)
- A connection-based characterization of bi-intuitionistic validity (Q2351153) (← links)
- On a graph calculus for modalities (Q2358703) (← links)
- Disentangling structural connectives or life without display property (Q2421521) (← links)
- The Church-Fitch knowability paradox in the light of structural proof theory (Q2443327) (← links)
- Full classical S5 in natural deduction with weak normalization (Q2478553) (← links)
- Logicality, double-line rules, and modalities (Q2631645) (← links)
- A deep inference system for the modal logic S5 (Q2642520) (← links)
- Metainferential reasoning on strong Kleene models (Q2679577) (← links)
- Metasequents and tetravaluations (Q2679584) (← links)
- The intensional side of algebraic-topological representation theorems (Q2695032) (← links)
- Neutral free logic: motivation, proof theory and models (Q2698548) (← links)
- GEOMETRISATION OF FIRST-ORDER LOGIC (Q2795295) (← links)
- PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS (Q2804473) (← links)
- Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information (Q2805170) (← links)
- Focused and Synthetic Nested Sequents (Q2811354) (← links)
- Inducing Syntactic Cut-Elimination for Indexed Nested Sequents (Q2817941) (← links)
- VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED (Q2890695) (← links)
