4 search results - page 1 / 1 » Proof Simplification in the Framework of Coherent Logic |
MSCS
2007
13 years 5 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
MPC
1995
Springer
13 years 9 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
STACS
2009
Springer
14 years 6 days ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
AISC
1998
Springer
13 years 9 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...