3353 search results - page 13 / 671 » Laver and set theory |
ILP
2000
Springer
15 years 1 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
102
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
100
click to vote
ITP
2010
15 years 1 months ago
2010
Abstract. In order to make existing formalizations available for settheoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This c...
76
Voted
APAL
2004
14 years 9 months ago
2004
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
102
click to vote
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...