181 search results - page 9 / 37 » On the Completeness of Propositional Hoare Logic |
TABLEAUX
2009
Springer
15 years 4 months 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...
JSYML
2007
14 years 9 months ago
2007
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete ...
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
237
click to vote
Book
Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.
76
Voted
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...