Last active
June 30, 2020 01:30
-
-
Save sguzman/1aaefc0f4f32627c29c48e15556415f2 to your computer and use it in GitHub Desktop.
A simple list of axioms corresponding to single-axiomatic systems
This file contains hidden or 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
# Wolfram Axiom | |
- {\!\(\*SubscriptBox[\(\[ForAll]\), \({\[FormalA], \[FormalB], \[FormalC]}\)]\(\((\((\[FormalB]\[CenterDot]\[FormalC])\)\[CenterDot]\[FormalA])\)\[CenterDot]\((\[FormalB]\[CenterDot]\((\((\[FormalB]\[CenterDot]\[FormalA])\)\[CenterDot]\[FormalB])\))\) == \[FormalA]\)\)} | |
# Subtract and branch if less than or equal to zero | |
- subleq a, b, c ; Mem[b] = Mem[b] - Mem[a] - if (Mem[b] ≤ 0) goto c | |
# Universal Iota combinator | |
- {\displaystyle \iota :=\lambda f.((fS)K)} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment