81 search results - page 12 / 17 » Sound and Complete Tree-Sequent Calculus for Inquisitive Log... |
171
click to vote
TABLEAUX
2009
Springer
16 years 16 days ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
164
click to vote
PPDP
2004
Springer
15 years 11 months ago
2004
Springer
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
128
click to vote
WOLLIC
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
195
click to vote
FMCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
167
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...