Pages that link to "Item:Q1317905"
From MaRDI portal
The following pages link to Cut-free sequent calculi for some tense logics (Q1317905):
Displayed 38 items.
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Deep sequent systems for modal logic (Q834716) (← links)
- Display calculi and other modal calculi: a comparison (Q987468) (← links)
- Syntactic cut-elimination for common knowledge (Q1024553) (← links)
- Multicomponent proof-theoretic method for proving interpolation properties (Q1799040) (← links)
- A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082) (← links)
- Nested sequents for intuitionistic modal logics via structural refinement (Q2142093) (← links)
- A pure view of ecumenical modalities (Q2148808) (← links)
- Proofs and countermodels in non-classical logics (Q2254557) (← links)
- Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
- A survey of nonstandard sequent calculi (Q2259014) (← links)
- Nested sequents for intuitionistic logics (Q2443118) (← links)
- Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach (Q2679583) (← 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)
- Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators (Q3178281) (← links)
- The Proof Theory of Common Knowledge (Q3299587) (← links)
- On Height and Happiness (Q3299847) (← links)
- Through an Inference Rule, Darkly (Q3305631) (← links)
- The Method of Tree-Hypersequents for Modal Propositional Logic (Q3600562) (← links)
- Deep Inference in Bi-intuitionistic Logic (Q3638293) (← links)
- (Q4558785) (← links)
- POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION (Q4933590) (← links)
- Syntactic Cut-elimination for Common Knowledge (Q4982123) (← links)
- MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description) (Q5049018) (← links)
- (Q5090950) (← links)
- A general proof certification framework for modal logic (Q5236558) (← links)
- Power and Limits of Structural Display Rules (Q5277918) (← links)
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK (Q5346691) (← links)
- A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY (Q5850981) (← links)
- A linear logic framework for multimodal logics (Q5889307) (← links)
- Provability multilattice logic (Q6040535) (← links)
- Mechanising Gödel-Löb provability logic in HOL light (Q6050769) (← links)
- An ecumenical notion of entailment (Q6067097) (← links)
- Focus-style proofs for the two-way alternation-free \(\mu \)-calculus (Q6118696) (← links)
- Nested sequents for intermediate logics: the case of Gödel-Dummett logics (Q6172067) (← links)