518 search results - page 3 / 104 » Automating Proofs in Category Theory |
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
LICS
2012
IEEE
11 years 9 months ago
2012
IEEE
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
APAL
2007
13 years 7 months ago
2007
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see