most citedProof-graphs for Minimal Implicational Logic

9 citations · 12 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LO2023

Quantum Algorithm for Multiplicative Linear Logic

Lorenzo Saraiva, Edward Hermann Haeusler, Vaston Costa

This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search A…

cs.CC20161 cited

NP vs PSPACE

Lew Gordeev, Edward Hermann Haeusler

We present a proof of the conjecture = by showing that arbitrary tautologies of Johansson's minimal propositional logic admit "small" polynomial-s…

cs.LO20141 cited

PUC-Logic embedding of Lewis' Deontic Logics

Ricardo Q. A. Fernandes, Edward H. Haeusler, Luiz Carlos Pereira

We present a embedding of Lewis Deontic logics in PUC-Logic. We achieve this by representing the vary basic logic and showing its relative completeness.

cs.LO20141 cited

Intuitionistic PUC-Logic for Constructive Counterfactuals

Ricardo Q. A. Fernandes, Edward H. Haeusler, Luiz Carlos Pereira

We present the intuitionistic version of PUC-Logic. After that, we present a constructive approach to Lewis' counterfactual abstraction to show that it does not require the classic…

cs.LO2014

How many times do we need and assumption ?

Edward Hermann Haeusler

In this article we present 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…

cs.LO20149 cited

Proof-graphs for Minimal Implicational Logic

Marcela Quispe-Cruz, Edward Hermann Haeusler, Lew Gordeev

It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their resp…