Sciweavers

2272 search results - page 203 / 455
» A Calculus for
Sort
View
APAL
2010
129views more  APAL 2010»
15 years 4 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
APAL
2008
112views more  APAL 2008»
15 years 4 months ago
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
Ulrich Berger
ENTCS
2008
126views more  ENTCS 2008»
15 years 4 months ago
Comonadic Notions of Computation
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
Tarmo Uustalu, Varmo Vene
INFORMATICALT
2008
74views more  INFORMATICALT 2008»
15 years 4 months ago
Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic
A transitive distributed knowledge logic is considered. The considered logic S4nD is obtained from multi-modal logic S4n by adding transitive distributed knowledge operator. For a ...
Regimantas Pliuskevicius, Aida Pliuskeviciene
JAPLL
2006
87views more  JAPLL 2006»
15 years 4 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk