Skip to content

Instantly share code, notes, and snippets.

# coreyhaines/peano.pl

Created April 19, 2020 19:55
Show Gist options
• Save coreyhaines/9a46912e6aa02c79d7006a78869bd04f to your computer and use it in GitHub Desktop.
Peano's Axioms in Prolog
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 % Peano's Axioms :- module(peano, [ is_zero/1, is_natural/1, equal/2, pred/2 ]). /** Peano's Axioms * * 1. 0 is a natural number * 2. For every number x, x = x (reflexive property) * 3. For all numbers x and y, if x = y, then y = x (symmetric property) * 4. For all numbers x, y and z, if x = y and y = z, then x = z (transitive property) * 5. For all a and b, if b is a natural number and a = b, then a is also a natural number (closed under equality) * 6. For every number n, Successor(n) is a number (closed under a successor function) * 7. For all numbers m and n, m = n if and only if Successor(m) = Successor(n) (Successor is an injection) * 8. For every number n, Successor(n) = 0 is false (0 is the starting point of the numbers) */ is_zero(zero). is_natural(zero). is_natural(succ(X)) :- is_natural(X). pred(succ(X), X) :- is_natural(X). equal(X, succ(_)) :- is_natural(X), \+ is_zero(X). equal(X, X) :- is_natural(X).
to join this conversation on GitHub. Already have an account? Sign in to comment