247 search results - page 50 / 50 » A Computational Structure for the Propositional Calculus |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...