Sciweavers

3658 search results - page 9 / 732
» The logic of proofs, semantically
Sort
View
PLPV
2011
ACM
12 years 10 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
FSTTCS
2005
Springer
14 years 1 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
TABLEAUX
2009
Springer
14 years 14 days ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
SWAP
2008
13 years 9 months ago
Exploiting Semantic Technology in Computational Logic-based Service Contracting
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
Marco Alberti, Massimiliano Cattafi, Marco Gavanel...
BSL
2004
100views more  BSL 2004»
13 years 7 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad