12 search results - page 3 / 3 » iandc 2000 |
IANDC
2000
13 years 5 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
IANDC
2000
13 years 5 months ago
2000
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...