## 283 Citations

Sequent calculus proof systems for inductive definitions

- Mathematics
- 2006

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

- Mathematics
- 2019

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

- Mathematics, Computer ScienceJournal of Automated Reasoning
- 2017

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 ?

- Mathematics, Computer ScienceArXiv
- 2014

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

- Philosophy
- 2012

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

- Mathematics
- 2010

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

- Mathematics
- 2009

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

- Computer ScienceAISC/MKM/Calculemus
- 2008

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)

- Computer Science, MathematicsElectron. Notes Theor. Comput. Sci.
- 2006

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]]…