518 search results - page 13 / 104 » Automating Proofs in Category Theory |
119
click to vote
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
129
click to vote
TLCA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
115
click to vote
CADE
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
119
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
119
click to vote
CSL
2005
Springer
15 years 7 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...