Sciweavers

135 search results - page 1 / 27
» Constructive Logic with Strong Negation as a Substructural L...
Sort
View
LOGCOM
2010
152views more  LOGCOM 2010»
12 years 11 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
ENTCS
2006
146views more  ENTCS 2006»
13 years 4 months ago
Strong Update, Disposal, and Encapsulation in Bunched Typing
We present a bunched intermediate language for strong (type-changing) update and disposal of first-order references. In contrast to other substructural type systems, the additive ...
Josh Berdine, Peter W. O'Hearn
NGC
2007
Springer
171views Communications» more  NGC 2007»
13 years 4 months ago
Description Logics with Contraries, Contradictories, and Subcontraries
Several constructive description logics,12) in which classical negation was replaced by strong negation as a component to treat negative atomic information have been proposed as in...
Ken Kaneiwa
JSYML
2006
124views more  JSYML 2006»
13 years 4 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 4 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris