Sciweavers

115 search results - page 13 / 23
» On contraction and the modal fragment
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 8 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
ITA
2007
13 years 8 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
WOLLIC
2007
Springer
14 years 2 months ago
Computational Interpretations of Classical Linear Logic
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
Paulo Oliva
AML
2005
91views more  AML 2005»
13 years 8 months ago
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced b...
Agata Ciabattoni
SYNTHESE
2008
99views more  SYNTHESE 2008»
13 years 8 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne