Untersuchungen über das logische Schließen. II

@article{Gentzen1935UntersuchungenD,
  title={Untersuchungen {\"u}ber das logische Schlie{\ss}en. II},
  author={Gerhard Gentzen},
  journal={Mathematische Zeitschrift},
  year={1935},
  volume={39},
  pages={405-431}
}
Sequent calculus proof systems for inductive definitions
Inductive definitions are the most natural means by which to represent many families of structures occurring in mathematics and computer science, and their corresponding induction / recursion
Gentzen-style Classical Logic as Cps Calculus
We show that one can encode proof of the Gentzen's LK as the-terms; and the cut-elimination procedure for LK as-contraction. Precisely, we observe that Strongly Normalizable(SN) and Church-Rosser(CR)
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
TLDR
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 ?
TLDR
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
In this thesis, we consider bi-intuitionistic logic and tense logic, as well as the combined bi-intuitionistic tense logic. Each of these logics contains a pair of dual connectives, for example,
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
TLDR
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)
Proofs Without Syntax [Hughes, D.J.D. Proofs Without Syntax. Annals of Mathematics 2006 (to appear), http://arxiv.org/abs/math/0408282 (v3). August 2004 submitted version also available: [35]]
...
1
2
3
4
5
...