Something is bounded if it can be a member of a set. This is a KIF primitive.Notes:
- Source: KIF Version 3.0 Specification
(=> (Simple-Set ?X) (Bounded ?X)) (=> (Finite-Set@Ol-User%Kif-Extensions ?S) (Bounded ?S)) (=> (And (Bounded ?U) (Forall (?X) (=> (Member ?X ?U) (Bounded ?X)))) (Bounded (Generalized-Union ?U))) (=> (And (Bounded ?U) (Set ?S)) (Bounded (Intersection ?U ?S)))
(<=> (Unbounded ?X) (Not (Bounded ?X))) (<=> (Simple-Set ?X) (And (Set ?X) (Bounded ?X)))
(Exists (?S) (And (Set ?S) (Forall (?X) (=> (Member ?X ?S) (Double@Ol-User%Kif-Lists ?X))) (Forall (?X ?Y ?Z) (=> (And (Member (Listof ?X ?Y) ?S) (Member (Listof ?X ?Z) ?S)) (= ?Y ?Z))) (Forall (?U) (=> (And (Bounded ?U) (Not (Empty ?U))) (Exists (?V) (And (Member ?V ?U) (Member (Listof ?U ?V) ?S))))))) (Exists (?U) (And (Bounded ?U) (Not (Empty ?U)) (Forall (?X) (=> (Member ?X ?U) (Exists (?Y) (And (Member ?Y ?U) (Proper-Subset ?X ?Y)))))))