3658 search results - page 52 / 732 » The logic of proofs, semantically |
TABLEAUX
1995
Springer
14 years 23 days ago
1995
Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
FOSSACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
JFLP
2002
13 years 9 months ago
2002
We consider prescriptive type systems for logic programs (as in G
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
APLAS
2006
ACM
14 years 3 months ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...