1894 search results - page 107 / 379 » A TLA Proof System |
130
Voted
CIE
2008
Springer
15 years 5 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...
167
Voted
MSCS
2006
15 years 3 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...
135
Voted
AIEDU
2005
15 years 3 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...
127
Voted
LICS
2010
IEEE
15 years 2 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...
131
Voted
STOC
1999
ACM
15 years 8 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...