[ ] Define general UnaryFunction and BinaryFunction types to simplify code.
[ ] Permit unary minus.
[x] Introduce bool(x) := x≠0.
[x] Introduce ¬ for unary not.
[x] Introduce approximately equal (≅ and ≈) and ≉ for not approximately equal.
[x] Permit − for minus, × for multiplication, ∞ for infinity, ∧ for and, ∨ for or, ⊼ for nand,⊽ for nor, ⊻ for xor, √ for square root, and∛ for cube root.
[ ] Expand to full boolean operations into a new class. Allow ⊨ for true and ⊭ for false.
[x] Introduce → for material implication.
[ ] Introduce ≏ for difference between, ≬, ∈, and ∉ for between (useful for ranges grammar).
See issue #12.
Some of these are minor but trivial.
<=,>=, and!=before parsing.UnaryFunctionandBinaryFunctiontypes to simplify code.bool(x):= x≠0.¬for unary not.≅and≈) and≉for not approximately equal.−for minus,×for multiplication,∞for infinity,∧for and,∨for or,⊼for nand,⊽for nor,⊻for xor,√for square root, and∛for cube root.Expand to full boolean operations into a new class. Allow⊨for true and⊭for false.→for material implication.Introduce≏for difference between,≬,∈, and∉for between (useful for ranges grammar).