Untersuchungen über das logische Schließen. II

  title={Untersuchungen {\"u}ber das logische Schlie{\ss}en. II},
  author={Gerhard Gentzen},
  journal={Mathematische Zeitschrift},

Gentzen-style Classical Logic as Cps Calculus

It is observed that Strongly Normalizable and Church-Rosser cut-elimination procedure for (intuitionistic decoration of) LKQ, as presented in Danos et al.(1993), can be considered as the call-by-value (CBV) Continuation Passing Style (CPS) computation.

A Generalized Proof-Theoretic Approach to Logical Argumentation Based on Hypersequents

It is shown that hypersequent-based argumentation yields robust defeasible variants of these logics, with many desirable properties, and allows us to incorporate as the deductive base of the formalism some well-known logics which lack cut-free sequent calculi, and so are not adequate for standard sequent- based argumentation.

Decidability for Residuated Lattices and Substructural Logics

We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is

Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning

In the original publication of the article, the reference 11 was omitted inadvertently and the reference 12 was added inadvertently.

How many times do we need and assumption ?

A class of formulas Fn, n in Nat, that need at least 2^n assumptions to be proved in a normal proof in Natural Deduction for purely implicational minimal propositional logic.

Turing e a normalização

Algumas contribuicoes de Turing em Logica dizem respeito a Teoria de Tipos e foram desenvolvidas durante a Segunda Guerra Mundial. Um dos resultados desse trabalho e uma demonstracao do teorema da

Proof theory and proof search of bi-intuitionistic and tense logic

This thesis develops a new extended sequent calculus for bi-intuitionistic logic using a framework of derivations and refutations and solves an open problem about taming proof search in display calculi.

Complete Cut-Free Tableaux for Equational Simple Type Theory

We present a cut-free tableau system for a version of Church’s simple type theory with primitive equality. The system is formulated with an abstract normalization operator that completely hides the

Logic-Free Reasoning in Isabelle/Isar

The principles developed here allow to turn deductions of the Isabelle logical framework into a format that transcends the raw logical calculus, with more direct description of reasoning using pseudo-natural language elements.

Towards Hilbert's 24th Problem: Combinatorial Proof Invariants: (Preliminary version)