International audienceHughes' combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combi-natorial proofs which also represent valid proofs for relevant logic with and without the mingle axiom. Moreover, we extend our syntax in order to represent combinatorial proofs for the more restrictive framework of entailment logic
International audienceIn this paper we investigate Hughes’ combinatorial proofs as a notion of proof...
We consider the classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implic...
AbstractLinear logic is a new logic which was recently developed by Girard in order to provide a log...
International audienceHughes' combinatorial proofs give canonical representations for classical logi...
International audienceThe main part of a classical combinatorial proof is a skew fi-bration, which p...
International audienceIn this paper we extend Hughes’ combinatorial proofs to modal logics. The cruc...
AbstractModus ponens provides the central theme. There are laws, of the form A→C. A logic (or other ...
International audienceCombinatory logic shows that bound variables can be eliminated without loss of...
AbstractCombinatorial proofs are abstract invariants for sequent calculus proofs, similarly to homot...
International audienceCombinatorial proofs form a syntax-independent presentation of proofs, origina...
International audienceWe uncover a close relationship between combinatorial and syntactic proofs for...
This paper gives an account of Anderson and Belnap's selection criteria for an adequate theory of en...
The work of Martin Bunder [4] presents a simple version of the Ben - Yelles Algorithm as a tree. Giv...
International audienceIn this paper we investigate Hughes’ combinatorial proofs as a notion of proof...
We consider the classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implic...
AbstractLinear logic is a new logic which was recently developed by Girard in order to provide a log...
International audienceHughes' combinatorial proofs give canonical representations for classical logi...
International audienceThe main part of a classical combinatorial proof is a skew fi-bration, which p...
International audienceIn this paper we extend Hughes’ combinatorial proofs to modal logics. The cruc...
AbstractModus ponens provides the central theme. There are laws, of the form A→C. A logic (or other ...
International audienceCombinatory logic shows that bound variables can be eliminated without loss of...
AbstractCombinatorial proofs are abstract invariants for sequent calculus proofs, similarly to homot...
International audienceCombinatorial proofs form a syntax-independent presentation of proofs, origina...
International audienceWe uncover a close relationship between combinatorial and syntactic proofs for...
This paper gives an account of Anderson and Belnap's selection criteria for an adequate theory of en...
The work of Martin Bunder [4] presents a simple version of the Ben - Yelles Algorithm as a tree. Giv...
International audienceIn this paper we investigate Hughes’ combinatorial proofs as a notion of proof...
We consider the classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implic...
AbstractLinear logic is a new logic which was recently developed by Girard in order to provide a log...
DOI
Add to ORKG