4850 search results - page 368 / 970 » Proof and Computation in Geometry |
193
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
189
click to vote
AIML
2008
15 years 8 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
156
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
182
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
171
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...