67 search results - page 2 / 14 » A Theorem on Higher Bruhat Orders |
TPHOL
2000
IEEE
13 years 10 months ago
2000
IEEE
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
CADE
2008
Springer
14 years 6 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
TPHOL
2007
IEEE
14 years 1 days ago
2007
IEEE
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...