Sciweavers

825 search results - page 107 / 165
» Modal Logics with Counting
Sort
View
HIS
2003
13 years 9 months ago
On a Set Theory With Uncertain Membership Relations
We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membe...
Shunsuke Yatabe, Yuzuru Kakuda, Makoto Kikuchi
BSL
2004
100views more  BSL 2004»
13 years 7 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
LOGCOM
2002
105views more  LOGCOM 2002»
13 years 7 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann