22 search results - page 1 / 5 » Local Realizability Toposes and a Modal Logic for Computabil... |
MSCS
2002
13 years 4 months ago
2002
AML
2008
13 years 5 months ago
2008
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
TCS
2011
12 years 11 months ago
2011
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 ...
CSR
2010
Springer
13 years 9 months ago
2010
Springer
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : Ï•(t), which have self-referential meanings. In this paper, “prehistoric phenomenaâ€...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...