Sciweavers

1670 search results - page 3 / 334
» On Skolemization in constructive theories
Sort
View
LICS
2008
IEEE
14 years 25 days ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
CADE
1999
Springer
13 years 10 months ago
System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
Matthias Baaz, Alexander Leitsch, Georg Moser
JAR
2008
95views more  JAR 2008»
13 years 6 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
Marc Bezem, Dimitri Hendriks
ISCI
2011
13 years 1 months ago
Aggregation functions: Construction methods, conjunctive, disjunctive and mixed classes
In this second part of our state-of-the-art overview on aggregation theory, based again on our recent monograph on aggregation functions, we focus on several construction methods ...
Michel Grabisch, Jean-Luc Marichal, Radko Mesiar, ...
ACL2
2006
ACM
13 years 10 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray