scientific article; zbMATH DE number 3074068
From MaRDI portal
Publication:5813181
zbMath0047.25002MaRDI QIDQ5813181
Publication date: 1952
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
A propositional fragment of Leśniewski's ontology and its formulation by the tableau method ⋮ Proof-functional connectives and realizability ⋮ Constant-only multiplicative linear logic is NP-complete ⋮ Coherence in SMCCs and equivalences on derivations in IMML with unit ⋮ Semantical Completeness Theorems in Logic and Algebra ⋮ Mechanising Gödel-Löb provability logic in HOL light ⋮ Brouwer and Euclid ⋮ On the cut operation in Gentzen calculi ⋮ Upper and lower bounds for the height of proofs in sequent calculus for intuitionistic logic ⋮ Solvable classes of pseudoprenex formulas ⋮ Coherence for closed categories with biproducts ⋮ Three faces of natural deduction ⋮ A new reduction sequence for arithmetic ⋮ Theorem prover for intuitionistic logic based on the inverse method ⋮ A coherence theorem for canonical morphisms in Cartesian closed categories ⋮ A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms ⋮ A constructive version of Tarski's geometry ⋮ Forum: A multiple-conclusion specification logic ⋮ On the intuitionistic force of classical search (Extended abstract) ⋮ A proof-theoretic study of the correspondence of classical logic and modal logic ⋮ Existential instantiation and normalization in sequent natural deduction ⋮ Correct Answers for First Order Logic ⋮ Resolution is cut-free ⋮ Proof Transformations and Structural Invariance ⋮ A specialization of the form of deductions in Gentzen calculi and its applications ⋮ A proof-theoretic study of the correspondence of hybrid logic and classical logic ⋮ Coherence in linear predicate logic ⋮ Coherence in Cartesian closed categories and the generality of proofs ⋮ A solver for QBFs in negation normal form ⋮ Axiom Directed Focusing ⋮ Representing scope in intuitionistic deductions ⋮ Permutability of proofs in intuitionistic sequent calculi ⋮ Termination of permutative conversions in intuitionistic Gentzen calculi ⋮ Elimination of cut-type rules from the Robinson and Presburger axiomatic systems ⋮ On the intuitionistic force of classical search ⋮ Correspondences between classical, intuitionistic and uniform provability ⋮ Theorem proving as constraint solving with coherent logic
This page was built for publication:
