163 search results - page 11 / 33 » Higher-Order Logic and Theorem Proving for Structured Specif... |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
APAL
2005
13 years 7 months ago
2005
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
COMBINATORICS
2004
13 years 7 months ago
2004
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...