scientific article; zbMATH DE number 3333259

Publication date: 1969

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Biography scientific work English translations

Collected or selected works; reprintings or translations of classics (01A75) History of mathematical logic and foundations (03-03) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Collections of translated articles of miscellaneous specific interest (00B55)

Related Items (only showing first 100 items - show all)

Current trends in substructural logics ⋮ Hybrid reasoning using universal attachment ⋮ On the relative merits of path dissolution and the method of analytic tableaux ⋮ An extension of the omega-rule ⋮ Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic ⋮ The enduring scandal of deduction. Is propositional logic really uninformative? ⋮ Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq ⋮ A cut elimination theorem for stationary logic ⋮ A cut-free Gentzen-type system for the logic of the weak law of excluded middle ⋮ Dual-intuitionistic logic ⋮ The linear abstract machine ⋮ Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning ⋮ The semantics and proof theory of linear logic ⋮ Consequence and confirmation ⋮ A note on sequent calculi intermediate between LJ and LK ⋮ Productive use of failure in inductive proof ⋮ An answer to an open problem of Urquhart ⋮ Semantics and proof-theory of depth bounded Boolean logics ⋮ Essential structure of proofs as a measure of complexity ⋮ New Curry-Howard terms for full linear logic ⋮ The explosion calculus ⋮ Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic ⋮ Gentzen reduction revisited ⋮ Canonical signed calculi with multi-ary quantifiers ⋮ Encoding transition systems in sequent calculus ⋮ Reduction rules for intuitionistic \(\lambda\rho\)-calculus ⋮ Bilateralism does not provide a proof theoretic treatment of classical logic (for technical reasons) ⋮ Reflecting rules: a note on generalizing the deduction theorem ⋮ Herbrand's fundamental theorem in the eyes of Jean van Heijenoort ⋮ Self-adjunctions and matrices. ⋮ \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps ⋮ A minimal classical sequent calculus free of structural rules ⋮ A typed calculus based on a fragment of linear logic ⋮ A focused approach to combining logics ⋮ Categorical De Morgan laws ⋮ Grammar induction by unification of type-logical lexicons ⋮ Bounded memory Dolev-Yao adversaries in collaborative systems ⋮ A binary modal logic for the intersection types of lambda-calculus. ⋮ Balzano's theory of ground and consequence ⋮ Nonmonotonic reasoning, preferential models and cumulative logics ⋮ A note on Gentzen's ordinal assignment ⋮ The consistency of arithmetic ⋮ Duality and the completeness of the modal \(\mu\)-calculus ⋮ Hilbert's epsilon as an operator of indefinite committed choice ⋮ Gödel's natural deduction ⋮ Logical foundations for programming semantics ⋮ A logic for category theory ⋮ Existential instantiation and normalization in sequent natural deduction ⋮ Theo: An interactive proof development system ⋮ General-elimination stability ⋮ Yet another bijection between sequent calculus and natural deduction ⋮ A symbolic model for timed concurrent constraint programming ⋮ Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus ⋮ A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs ⋮ Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi ⋮ External and internal syntax of the \(\lambda \)-calculus ⋮ Resolution is cut-free ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ Graded consequence revisited ⋮ PNL to HOL: from the logic of nominal sets to the logic of higher-order functions ⋮ Semantic bootstrapping of type-logical grammar ⋮ Modal logics for communicating systems ⋮ An experimental logic based on the fundamental deduction principle ⋮ Quantifier-complete categories ⋮ On reduction rules, meaning-as-use, and proof-theoretic semantics ⋮ Phase transitions for Gödel incompleteness ⋮ Generating plans in linear logic. I: Actions as proofs ⋮ Generating plans in linear logic. II: A geometry of conjunctive actions ⋮ Truth-value semantics and functional extensions for classical logic of partial terms based on equality ⋮ Relevant analytic tableaux ⋮ The structure of multiplicatives ⋮ Coherence in Cartesian closed categories and the generality of proofs ⋮ Structured calculational proof ⋮ Harmonious logic: Craig's interpolation theorem and its descendants ⋮ The calculus of natural calculation ⋮ Permutability of proofs in intuitionistic sequent calculi ⋮ Intuitionism: an inspiration? ⋮ On the logic of unification ⋮ Logical structures and genus of proofs ⋮ Dual systems of tableaux and sequents for PLTL ⋮ Focusing and polarization in linear, intuitionistic, and classical logics ⋮ What is a (non-constructive) non-monotone logical system? ⋮ Correspondences between classical, intuitionistic and uniform provability ⋮ Proof finding algorithms for implicational logics ⋮ Falsification-aware semantics and sequent calculi for classical logic ⋮ Embedding friendly first-order paradefinite and connexive logics ⋮ Relative efficiency of propositional proof systems: Resolution vs. cut-free LK ⋮ An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi ⋮ Maximum segments as natural deduction images of some cuts ⋮ Paraconsistent logics and translations ⋮ A proof description language and its reduction system ⋮ The complexity of the disjunction and existential properties in intuitionistic logic ⋮ ``Gaisi Takeuti's finitist standpoint and its mathematical embodiment ⋮ On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions ⋮ A proof-theoretic characterization of observational equivalence ⋮ On sequence-conclusion natural deduction systems ⋮ The structure of free closed categories ⋮ Simple consequence relations ⋮ Combining type disciplines

This page was built for publication: