Proof Search in Nested Sequent Calculi

DOI10.1007/978-3-662-48899-7_39zbMath1471.03079OpenAlexW2286252794WikidataQ57850726 ScholiaQ57850726MaRDI QIDQ3460084

Björn Lellmann, Elaine Pimentel

Publication date: 12 January 2016

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48899-7_39

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (7)

Hypersequent rules with restricted contexts for propositional modal logics ⋮ Logical analysis of emotions in text from natural language ⋮ A fresh view of linear logic as a logical framework ⋮ Labelled sequent calculi for Lewis' non-normal propositional modal logics ⋮ Focused and Synthetic Nested Sequents ⋮ A general proof certification framework for modal logic ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

This page was built for publication: Proof Search in Nested Sequent Calculi