predecessor fn (PredecessorFn)
A UnaryFunction that maps an Integer to
its predecessor, e.g. the predecessor of 5 is 4.
Ontology
SUMO / NUMERIC-FUNCTIONSClass(es)
Coordinate term(s)
absolute value fn
abstraction fn
arc cosine fn
arc sine fn
arc tangent fn
back fn
begin fn
begin node fn
cardinality fn
ceiling fn
complement fn
cosine fn
cut set fn
denominator fn
end fn
end node fn
extension fn
floor fn
front fn
future fn
generalized intersection fn
generalized union fn
giga fn
imaginary part fn
immediate future fn
immediate past fn
initial node fn
integer square root fn
kilo fn
list length fn
magnitude fn
mega fn
micro fn
milli fn
minimal cut set fn
nano fn
numerator fn
organization fn
past fn
path weight fn
pico fn
power set fn
principal host fn
probability fn
property fn
rational number fn
real number fn
reciprocal fn
round fn
signum fn
sine fn
skin fn
square root fn
successor fn
tangent fn
tera fn
terminal node fn
wealth fn
when fn
year fn
Type restrictions
pUrNaanka PredecessorFn(pUrNaanka)
Axioms (6)
"(number+2)" is equal to "(number-)".
(equal
(PredecessorFn ?NUMBER)
(SubtractionFn ?NUMBER 1))
Agar int is an instance of pUrNaanka, to int is equal to "("(int+2)"+1)".
(=>
(instance ?INT Integer)
(equal
?INT
(SuccessorFn
(PredecessorFn ?INT))))
Agar int is an instance of pUrNaanka, to int is equal to "("(int+1)"+2)".
(=>
(instance ?INT Integer)
(equal
?INT
(PredecessorFn
(SuccessorFn ?INT))))
Agar "(int1+2)" is equal to "(int2+2)", to int1 is equal to int2.
(=>
(equal
(PredecessorFn ?INT1)
(PredecessorFn ?INT2))
(equal ?INT1 ?INT2))
Agar int is an instance of pUrNaanka, to int is greater than "(int+2)".
(=>
(instance ?INT Integer)
(greaterThan
?INT
(PredecessorFn ?INT)))
Agar int1 is an instance of pUrNaanka aur int2 is an instance of pUrNaanka, to int2 is not less than int1 yaa "(int1+2)" is not less than int2.
(=>
(and
(instance ?INT1 Integer)
(instance ?INT2 Integer))
(not
(and
(lessThan ?INT2 ?INT1)
(lessThan
(PredecessorFn ?INT1)
?INT2))))