The following pages link to Display logic (Q1838471):
Displaying 50 items.
- Current trends in substructural logics (Q266641) (← links)
- Paraconsistent logic (Q266659) (← links)
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Understanding negation implicationally in the relevant logic R (Q514515) (← links)
- Implications-as-rules vs. implications-as-links: an alternative implication-left schema for the sequent calculus (Q626494) (← links)
- Algebraic proof theory: hypersequents and hypercompletions (Q730091) (← links)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
- Simple consequence relations (Q809992) (← links)
- Cut elimination inside a deep inference system for classical predicate logic (Q817702) (← links)
- Towards a semantic characterization of cut-elimination (Q817704) (← links)
- Deep sequent systems for modal logic (Q834716) (← links)
- Combining linear-time temporal logic with constructiveness and paraconsistency (Q975875) (← links)
- Display calculi and other modal calculi: a comparison (Q987468) (← links)
- Types as graphs: Continuations in type logical grammar (Q1006443) (← links)
- On purported Gentzen formulations of two positive relevant logics (Q1071751) (← links)
- A perspective on modal sequent logic (Q1187165) (← links)
- Displaying and deciding substructural logics. I: Logics with contraposition (Q1267081) (← links)
- Indexed systems of sequents and cut-elimination (Q1372944) (← links)
- Proof search and co-NP completeness for many-valued logics (Q1697337) (← links)
- Restall's proof-theoretic pluralism and relevance logic (Q1706756) (← links)
- Multimodal linguistic inference (Q1923840) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- Bunched logics displayed (Q1935559) (← links)
- Cut-elimination for weak Grzegorczyk logic Go (Q2016062) (← links)
- A generalized proof-theoretic approach to logical argumentation based on hypersequents (Q2021565) (← links)
- A cut-elimination proof in positive relevant logic with necessity (Q2046880) (← links)
- A proof-theoretic approach to negative translations in intuitionistic tense logics (Q2082257) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082) (← links)
- Knowledge, belief, normality, and introspection (Q2218706) (← links)
- Normal proofs, cut free derivations and structural rules (Q2259009) (← links)
- Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
- A survey of nonstandard sequent calculi (Q2259014) (← links)
- Bilattice logic properly displayed (Q2328914) (← links)
- Disentangling structural connectives or life without display property (Q2421521) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Judgmental subtyping systems with intersection types and modal types (Q2510384) (← links)
- Logicality, double-line rules, and modalities (Q2631645) (← links)
- Non-normal modal logics and conditional logics: semantic analysis and proof theory (Q2672662) (← links)
- Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information (Q2805170) (← links)
- Focused and Synthetic Nested Sequents (Q2811354) (← links)
- Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi (Q2817943) (← links)
- A Multi-type Calculus for Inquisitive Logic (Q2820696) (← links)
- Strong and Weak Quantifiers in Focused NL$$_{\text {CL}}$$ (Q2964000) (← links)
- Hypersequent Calculi for S5: The Methods of Cut Elimination (Q2987741) (← links)
- Craig Interpolation in Displayable Logics (Q3010362) (← links)
- A Unified Display Proof Theory for Bunched Logic (Q3178253) (← links)
- Machine-Checked Proof-Theory for Propositional Modal Logics (Q3305555) (← links)
- On a multilattice analogue of a hypersequent S5 calculus (Q3387898) (← links)
- (Q4558785) (← links)
