Sciweavers

3658 search results - page 45 / 732
» The logic of proofs, semantically
Sort
View
CSL
2010
Springer
13 years 10 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
ICFP
2010
ACM
13 years 10 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 4 months ago
Polarized Montagovian Semantics for the Lambek-Grishin calculus
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
Arno Bastenhof
AGP
2010
IEEE
13 years 7 months ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...
TLCA
2005
Springer
14 years 2 months ago
Can Proofs Be Animated By Games?
Proof animation is a way of executing proofs to nd errors in the formalization of proofs. It is intended to be \testing in proof engineering". Although the realizability inter...
Susumu Hayashi