Taming displayed tense logics using nested sequents with deep inference

DOI10.1007/978-3-642-02716-1_15MaRDI QIDQ3648731zbMATH OpenOpenAlexFDO

Authors Rajeev Goré, Linda Postniece, Alwen Tiu

Publication date 1 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02716-1_15

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Modal logic (including the logic of norms) (03B45) Structure of proofs (03F07)

Recommendations

• On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
• Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents
• Cut-free sequent calculi for some tense logics
• Sequentialising nested systems
• Cut-elimination and proof search for bi-intuitionistic tense logic

Cited in

(7)

• Cut-free sequent calculi for some tense logics
• From display to labelled proofs for tense logics
• Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents
• Cut-elimination and proof search for bi-intuitionistic tense logic
• On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
• Deep Inference in Bi-intuitionistic Logic
• scientific article; zbMATH DE number 4045714 (Why is no real title available?)

This page was built for publication: Taming displayed tense logics using nested sequents with deep inference

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