10997 search results - page 7 / 2200 » On the Structure of Complete Sets |
AML
2006
13 years 7 months ago
2006
CIE
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the notions of a complete set of computably infinitary Π0 n relations on a structure, of the jump of a structure, and of admitting nth jump inversion.
APAL
1998
13 years 7 months ago
1998
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...