1302 search results - page 72 / 261 » Free-Style Theorem Proving |
CADE
2000
Springer
14 years 4 days ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
DM
2007
13 years 7 months ago
2007
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
ENTCS
2007
13 years 7 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
JCT
2007
13 years 7 months ago
2007
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
COMBINATORICA
2004
13 years 7 months ago
2004
In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales-Jewett Theorem in which the leftmost letters of all but one of the words were required to be vari...