exists |
antecedent |
![]() |
consequent |
![]() |
statement |
![]() |
(containsInformation (forall (?POLITY ?VOTER ?ELECTION ?VOTINGAGE ?AGE) (=> (and (citizen ?VOTER ?POLITY) (suffrageAgeMinimum ?POLITY (MeasureFn ?VOTINGAGE YearDuration)) (age ?VOTER (MeasureFn ?AGE YearDuration)) (greaterThanOrEqualTo ?AGE ?VOTINGAGE) (instance ?ELECTION (ElectionFn ?POLITY))) (exists (?VOTING) (and (instance ?VOTING (VotingFn ?ELECTION)) (agent ?VOTING ?VOTER))))) CompulsorySuffrageLaw) |
Government.kif 1157-1171 | For all ?POLITY, ?VOTER,, , ?ELECTION,, , ?VOTINGAGE and ?AGE
|
(hasPurpose IBookstore (exists (?D) (and (instance ?D DownloadingOverNetwork) (instrument ?D IBookstore) (instance ?T Text) (objectTransferred ?D ?T)))) |
ComputingBrands.kif 3275-3281 | IBookstore has the purpose there exists ?D such that ?D is an instance of downloading and iBookstore is an instrument for ?D and ?T is an instance of text and the object transferred in ?D is ?T |
(not (exists (?PATH1 ?PATH2) (and (instance ?PATH1 (CutSetFn ?GRAPH)) (instance ?PATH2 (MinimalCutSetFn ?GRAPH)) (pathLength ?PATH1 ?NUMBER1) (pathLength ?PATH2 ?NUMBER2) (lessThan ?NUMBER1 ?NUMBER2)))) |
Merge.kif 6003-6010 | There don't exist a graph path and another graph path such that the graph path is an instance of the set of paths that partition a graph into two separate graphs and the other graph path is an instance of the set of minimal paths that partition the graph into two separate graphs and the length of the graph path is a positive integer and the length of the other graph path is another positive integer and the positive integer is less than the other positive integer |
appearance as argument number 0 |
![]() |
![]() |
![]() |