The following pages link to (Q5610986):
Displaying 50 items.
- Gentzen reduction revisited (Q1140640) (← links)
- Categorical De Morgan laws (Q1164129) (← links)
- Nonmonotonic reasoning, preferential models and cumulative logics (Q1174512) (← links)
- Existential instantiation and normalization in sequent natural deduction (Q1198828) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Quantifier-complete categories (Q1238805) (← links)
- Relevant analytic tableaux (Q1257473) (← links)
- The structure of multiplicatives (Q1264140) (← links)
- Structured calculational proof (Q1267033) (← links)
- Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
- The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
- Combining type disciplines (Q1319505) (← links)
- Hybrid reasoning using universal attachment (Q1329365) (← links)
- On the relative merits of path dissolution and the method of analytic tableaux (Q1331929) (← links)
- Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic (Q1337604) (← links)
- Dual-intuitionistic logic (Q1355125) (← links)
- New Curry-Howard terms for full linear logic (Q1390952) (← links)
- Encoding transition systems in sequent calculus (Q1398474) (← links)
- Self-adjunctions and matrices. (Q1408350) (← links)
- A binary modal logic for the intersection types of lambda-calculus. (Q1427854) (← links)
- Balzano's theory of ground and consequence (Q1430991) (← links)
- What is a (non-constructive) non-monotone logical system? (Q1575268) (← links)
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- Proof finding algorithms for implicational logics (Q1575928) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- Bilateralism does not provide a proof theoretic treatment of classical logic (for technical reasons) (Q1693600) (← links)
- A note on Gentzen's ordinal assignment (Q1734262) (← links)
- Gödel's natural deduction (Q1744008) (← links)
- Semantic bootstrapping of type-logical grammar (Q1778102) (← links)
- Generating plans in linear logic. I: Actions as proofs (Q1802077) (← links)
- Generating plans in linear logic. II: A geometry of conjunctive actions (Q1802078) (← links)
- On the logic of unification (Q1823935) (← links)
- Paraconsistent logics and translations (Q1840969) (← links)
- On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions (Q1854404) (← links)
- Consequence and confirmation (Q1906665) (← links)
- Productive use of failure in inductive proof (Q1915134) (← links)
- Herbrand's fundamental theorem in the eyes of Jean van Heijenoort (Q1942097) (← links)
- Grammar induction by unification of type-logical lexicons (Q1959226) (← links)
- The calculus of natural calculation (Q2062198) (← links)
- Intuitionism: an inspiration? (Q2065727) (← links)
- Falsification-aware semantics and sequent calculi for classical logic (Q2078978) (← links)
- Embedding friendly first-order paradefinite and connexive logics (Q2079706) (← links)
- An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi (Q2084568) (← links)
- Maximum segments as natural deduction images of some cuts (Q2084573) (← links)
- ``Gaisi Takeuti's finitist standpoint'' and its mathematical embodiment (Q2097064) (← links)
- Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq (Q2142084) (← links)
- Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning (Q2155493) (← links)
- Essential structure of proofs as a measure of complexity (Q2183713) (← links)
- The explosion calculus (Q2186694) (← links)
- Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic (Q2186695) (← links)
