Go backward to Natural Language
Go up to Top
Go forward to Examples
p is prime, if its only divisors are 1 and p.introduces the unary predicate
p is prime : <=> (forall x: x is a divisor of p => (x = 1 \/ x = p)).
x is a divisor of y, if x*z = y, for some z.introduces the binary predicate
x is a divisor of y : <=> exists z: x*z = y.