Prefixed tableaus and nested sequents

DOI10.1016/J.APAL.2011.09.004zbMATH Open1241.03021OpenAlexW2146345041MaRDI QIDQ409323FDOQ409323

Authors: Melvin Fitting 

Publication date: 13 April 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2011.09.004

Recommendations

• Nested sequents for intuitionistic logics
• Modular sequent systems for modal logic
• Sequentialising nested systems
• On nested sequents for constructive modal logics
• Proof search in nested sequent calculi

zbMATH Keywords

modal logicdeep reasoningnested sequentprefixed tableau

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03) Structure of proofs (03F07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit provability and constructive semantics
• Handbook of modal logic
• The logic of proofs, semantically
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof analysis in modal logic
• First-order modal logic
• Tableau methods for modal and temporal logics
• Introducing Justification into Epistemic Logic
• Deep sequent systems for modal logic
• Proof methods for modal and intuitionistic logics
• Tableau methods of proof for modal logics
• Strongly analytic tableaux for normal modal logics
• Justification logic. Reasoning with reasons
• First-order intensional logic
• Single step tableaux for modal logics. Computational properties, complexity and methodology
• Tableaux and Hypersequents for Justification Logic

Cited In (26)

• Through an inference rule, darkly
• Inducing syntactic cut-elimination for indexed nested sequents
• Local reductions for the modal cube
• Tableaux and interpolation for propositional justification logics
• Maehara-style modal nested calculi
• Nested sequents for intuitionistic logics
• Focused and Synthetic Nested Sequents
• A general proof certification framework for modal logic
• A natural deduction calculus for \textbf{S4.2}
• Linear Nested Sequents, 2-Sequents and Hypersequents
• Algebra, proof theory and applications for a logic of propositions, actions and adjoint modal operators
• Labeled sequent calculus for justification logics
• Proofs and countermodels in non-classical logics
• Cut Elimination for Extended Sequent Calculi
• Efficient local reductions to basic modal logic
• Multicomponent proof-theoretic method for proving interpolation properties
• Hypersequent rules with restricted contexts for propositional modal logics
• On height and happiness
• Modal interpolation via nested sequents
• Title not available (Why is that?)
• \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
• Local is best: efficient reductions to modal logic \textsf{K}
• Certification of prefixed tableau proofs for modal logic
• Reflecting on social influence in networks
• Labeled sequent calculi for modal logics and implicit contractions
• Nested sequent calculi for conditional logics

This page was built for publication: Prefixed tableaus and nested sequents

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