204 search results - page 6 / 41 » A Connection Based Proof Method for Intuitionistic Logic |
99
Voted
LOGCOM
2002
15 years 56 min ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
102
Voted
PADL
2004
Springer
15 years 5 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
118
click to vote
PADL
2007
Springer
15 years 6 months ago
2007
Springer
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
113
Voted
LFCS
2009
Springer
15 years 6 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...