518 search results - page 4 / 104 » Automating Proofs in Category Theory |
LICS
2002
IEEE
14 years 9 days ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
LOPSTR
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...