6978 search results - page 334 / 1396 » On Proofs in System P |
178
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
210
click to vote
MSCS
2006
15 years 6 months ago
2006
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...
181
click to vote
AIEDU
2005
15 years 6 months ago
2005
This paper presents the experiment and consequent evaluation of introducing the Logic-ITA in a second year tertiary undergraduate class. The Logic-ITA is a web-based Intelligent Te...
173
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
172
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— As an efficient distribution mechanism, peer-topeer technology has become a tremendously attractive solution to offload servers in large scale video streaming applica...