Sciweavers

6978 search results - page 362 / 1396
» On Proofs in System P
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 11 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
LFCS
1992
Springer
15 years 11 months ago
Strictness Logic and Polymorphic Invariance
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
P. N. Benton
AIML
2008
15 years 8 months ago
Undecidability for arbitrary public announcement logic
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
Tim French, Hans P. van Ditmarsch
MLQ
2006
84views more  MLQ 2006»
15 years 6 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
IGPL
2007
45views more  IGPL 2007»
15 years 6 months ago
On Positive Relational Calculi
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
Renata P. de Freitas, Paulo A. S. Veloso, Sheila R...