The following pages link to (Q4716271):
Displaying 50 items.
- Consequence relations and admissible rules (Q300835) (← links)
- Labeled sequent calculus for justification logics (Q331048) (← links)
- Natural deduction calculi and sequent calculi for counterfactual logics (Q332082) (← links)
- A short proof of Glivenko theorems for intermediate predicate logics (Q377463) (← links)
- On unification and admissible rules in Gabbay-de Jongh logics (Q386639) (← links)
- Loop-free calculus for modal logic S4. I (Q392988) (← links)
- Conservativity for logics of justified belief: two approaches (Q408535) (← links)
- Proof theory and mathematical meaning of paraconsistent C-systems (Q420832) (← links)
- On defining the notion of complete and immediate formal grounding (Q513936) (← links)
- Propositional team logics (Q526967) (← links)
- Cut elimination in coalgebraic logics (Q618171) (← links)
- Hybrid logic with the difference modality for generalisations of graphs (Q631090) (← links)
- A minimal classical sequent calculus free of structural rules (Q636359) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- Exception tracking in an open world (Q724930) (← links)
- Sequent calculi and decidability for intuitionistic hybrid logic (Q764257) (← links)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
- Proof analysis in modal logic (Q812101) (← links)
- Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere (Q817688) (← links)
- Gentzen calculi for the existence predicate (Q817698) (← links)
- Deep sequent systems for modal logic (Q834716) (← links)
- Simplifying proofs in Fitch-style natural deduction systems (Q851139) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Variable declarations in natural deduction (Q861825) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Interacting explicit evidence systems (Q929292) (← links)
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- Resolution is cut-free (Q972424) (← links)
- \(\mathcal {BCDL}\): Basic constructive description logic (Q972431) (← links)
- Common knowledge does not have the Beth property (Q987837) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- Counting proofs in propositional logic (Q1014285) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- The many faces of interpolation (Q1024113) (← links)
- Normal derivations and sequent derivations (Q1029828) (← links)
- Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
- Commuting conversions vs. the standard conversions of the ``good'' connectives (Q1037589) (← links)
- Normal functors, power series and \(\lambda\)-calculus (Q1103618) (← links)
- On the shape of mathematical arguments (Q1188723) (← links)
- Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
- Algebraic proofs of cut elimination (Q1349247) (← links)
- Harmony and autonomy in classical logic (Q1568714) (← links)
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Doing logic by computer: Interpolation in fragments of intuitionistic propositional logic (Q1577480) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- Natural deduction for bi-intuitionistic logic (Q1693596) (← links)
- On constructing a logic for the notion of complete and immediate formal grounding (Q1709100) (← links)
- Uniform interpolation and sequent calculi in modal logic (Q1712936) (← links)
- The Skolemization of prenex formulas in intermediate logics (Q1740611) (← links)
