Prefixed tableaus and nested sequents

DOI10.1016/j.apal.2011.09.004zbMath1241.03021OpenAlexW2146345041MaRDI QIDQ409323

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

zbMATH Keywords

modal logicdeep reasoningnested sequentprefixed tableau

Mathematics Subject Classification ID

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

Related Items

Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators, Linear Nested Sequents, 2-Sequents and Hypersequents, Nested Sequent Calculi for Conditional Logics, Labeled sequent calculus for justification logics, Hypersequent rules with restricted contexts for propositional modal logics, Labeled sequent calculi for modal logics and implicit contractions, Reflecting on social influence in networks, Cut Elimination for Extended Sequent Calculi, Unnamed Item, Nested sequents for intuitionistic logics, Maehara-style modal nested calculi, On Height and Happiness, Modal interpolation via nested sequents, Through an Inference Rule, Darkly, Proofs and countermodels in non-classical logics, Unnamed Item, Multicomponent proof-theoretic method for proving interpolation properties, Focused and Synthetic Nested Sequents, \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments, Inducing Syntactic Cut-Elimination for Indexed Nested Sequents, Efficient local reductions to basic modal logic, A general proof certification framework for modal logic, Local is best: efficient reductions to modal logic \textsf{K}, Local reductions for the modal cube

Cites Work

• First-order intensional logic
• The logic of proofs, semantically
• Proof analysis in modal logic
• Deep sequent systems for modal logic
• Proof methods for modal and intuitionistic logics
• First-order modal logic
• Single step tableaux for modal logics. Computational properties, complexity and methodology
• Tableau methods of proof for modal logics
• Explicit Provability and Constructive Semantics
• Introducing Justification into Epistemic Logic
• Tableaux and Hypersequents for Justification Logic
• Strongly analytic tableaux for normal modal logics
• Justification Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item