Sciweavers

133 search results - page 12 / 27
» The basic intuitionistic logic of proofs
Sort
View
JIIS
2008
104views more  JIIS 2008»
13 years 6 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
CSL
2002
Springer
13 years 6 months ago
Classical Linear Logic of Implications
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
Masahito Hasegawa
CONCUR
2005
Springer
14 years 7 days ago
Type-Directed Concurrency
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
Deepak Garg, Frank Pfenning
JANCL
2006
100views more  JANCL 2006»
13 years 6 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 6 months ago
A multivalued knowledge-base model
Abstract. The basic aim of our study is to give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG. At first the concept of f...
Agnes Achs