Sciweavers

95
Voted
BSL
1999
103views more  BSL 1999»
15 years 9 days ago
The logic of bunched implications
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
Peter W. O'Hearn, David J. Pym
72
Voted
CSL
2002
Springer
15 years 13 days ago
On Generalizations of Semi-terms of Particularly Simple Form
Abstract. We show that Gentzen's sequent calculus admits generalization of semi-terms of particularly simple form. This theorem extends one of the main results in [BS95] to la...
Matthias Baaz, Georg Moser
62
Voted
MSCS
2006
69views more  MSCS 2006»
15 years 17 days ago
A categorical quantum logic
We define a sequent calculus corresponding to the logic of strongly compact closed categories with biproducts. Based on this calculus, we define a proof-net syntax with ly normali...
Samson Abramsky, Ross Duncan
104
Voted
ENTCS
2008
96views more  ENTCS 2008»
15 years 21 days ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
ENTCS
2008
90views more  ENTCS 2008»
15 years 21 days ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer
86
Voted
APAL
2008
67views more  APAL 2008»
15 years 23 days ago
Proof nets sequentialisation in multiplicative linear logic
Abstract. We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a ...
Paolo Di Giamberardino, Claudia Faggian
102
Voted
CSL
2010
Springer
15 years 1 months ago
A Sequent Calculus with Implicit Term Representation
We investigate a modification of the sequent calculus which s a first-order proof into its abstract deductive structure and a unifier which renders this structure a valid proof. We...
Stefan Hetzl
104
Voted
IJCAI
1993
15 years 1 months ago
A Language for Implementing Arbitrary Logics
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
Mark Tarver
133
Voted
AIML
2008
15 years 2 months ago
Proof systems for the coalgebraic cover modality
abstract. We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a ...
Marta Bílková, Alessandra Palmigiano...
FLOPS
2008
Springer
15 years 2 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...