The following pages link to (Q5610986):
Displaying 50 items.
- Current trends in substructural logics (Q266641) (← links)
- An extension of the omega-rule (Q283132) (← links)
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps (Q429596) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- General-elimination stability (Q526738) (← links)
- Yet another bijection between sequent calculus and natural deduction (Q530853) (← links)
- A symbolic model for timed concurrent constraint programming (Q530859) (← links)
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus (Q530864) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- An experimental logic based on the fundamental deduction principle (Q580998) (← links)
- A minimal classical sequent calculus free of structural rules (Q636359) (← links)
- A focused approach to combining logics (Q639671) (← links)
- The consistency of arithmetic (Q666895) (← links)
- Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- A logic for category theory (Q685421) (← links)
- Theo: An interactive proof development system (Q688727) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- Truth-value semantics and functional extensions for classical logic of partial terms based on equality (Q740205) (← links)
- Coherence in Cartesian closed categories and the generality of proofs (Q750442) (← links)
- The structure of free closed categories (Q803265) (← links)
- Simple consequence relations (Q809992) (← links)
- Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion (Q830398) (← links)
- The enduring scandal of deduction. Is propositional logic really uninformative? (Q833033) (← links)
- Reduction rules for intuitionistic \(\lambda\rho\)-calculus (Q897480) (← links)
- Reflecting rules: a note on generalizing the deduction theorem (Q898771) (← links)
- A typed calculus based on a fragment of linear logic (Q908909) (← links)
- Hilbert's epsilon as an operator of indefinite committed choice (Q946570) (← links)
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
- External and internal syntax of the \(\lambda \)-calculus (Q968531) (← links)
- Resolution is cut-free (Q972424) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Graded consequence revisited (Q983060) (← links)
- On reduction rules, meaning-as-use, and proof-theoretic semantics (Q1005958) (← links)
- Phase transitions for Gödel incompleteness (Q1006619) (← links)
- Harmonious logic: Craig's interpolation theorem and its descendants (Q1024116) (← links)
- Logical structures and genus of proofs (Q1035649) (← links)
- Dual systems of tableaux and sequents for PLTL (Q1035676) (← links)
- Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- A proof-theoretic characterization of observational equivalence (Q1060006) (← links)
- On sequence-conclusion natural deduction systems (Q1062053) (← links)
- A cut elimination theorem for stationary logic (Q1095904) (← links)
- A cut-free Gentzen-type system for the logic of the weak law of excluded middle (Q1100191) (← links)
- The linear abstract machine (Q1105351) (← links)
- The semantics and proof theory of linear logic (Q1106836) (← links)
- A note on sequent calculi intermediate between LJ and LK (Q1115420) (← links)
- An answer to an open problem of Urquhart (Q1129262) (← links)
