61 search results - page 5 / 13 » Tableaux for the Lambek-Grishin calculus |
TABLEAUX
2005
Springer
14 years 4 months ago
2005
Springer
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
CADE
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
CADE
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
TABLEAUX
2007
Springer
14 years 5 months ago
2007
Springer
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agen...
TABLEAUX
1999
Springer
14 years 3 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...