diff options
| -rw-r--r-- | symbols.txt | 13 | ||||
| -rw-r--r-- | tempo.md | 17 |
2 files changed, 22 insertions, 8 deletions
diff --git a/symbols.txt b/symbols.txt index d56b973..33ea3a2 100644 --- a/symbols.txt +++ b/symbols.txt @@ -8,8 +8,8 @@ = eq = equal ∷ prop -∷ property ∷ inside +∷ property ⋿ type ≠ neq ≠ notequal @@ -45,8 +45,8 @@ i i 𝛏 axiom mind Λ listener -ϒ comprehend ϒ comp +ϒ comprehend ϑ dawn energy ≈ almost @@ -54,16 +54,17 @@ i i ⚛ atom H aH He aHe -ɸ hypothetical ɸ hypo +ɸ hypothetical u you ‖ between -⊃ context ⊃ ctx +⊃ context § nuos ? question ? q -; answer ; ans +; answer ɀ all -ᓱ some
\ No newline at end of file +ᓱ some +╳ none
\ No newline at end of file @@ -41,11 +41,11 @@ def <name> `<definition>` [english form] ``` ## syntax -in tempo, everything is interpreted as left-to-right. +in tempo, everything is interpreted from left-to-right. an axiom can have 0 to an arbitrary number of inputs, which indicates that the axiom is basically a catch-all. arguments are taken in the format of `[arg1 arg2 arg3 ...]` in the definition. the usage section of an axiom describes how arguments are taken in. -the composite axiom assertion bears a cognitive load: it allows assigning names to the time slice of an axiom. for example: `A = .` returns a random (or non-random) object in the enclosing set of the context. +the composite axiom assertion (=) bears a cognitive load: it allows assigning names to the time slice of an axiom. for example: `A = .` returns a random (or non-random) object in the enclosing set of the context. in our world, this could be an atom, an apple, an idea, a time, a memory, a sound, anything. <!> it also serves as a filter, in which `A=. A=.\prop\\me\apple` would filter the first statement, `A=.`, such that A is a property of an apple (since tempo doesn't define apples yet, we contractually import it from our own language as `\me\apple`). @@ -326,6 +326,18 @@ def \some\ `[x y] -(\all\ x -y)` (\some\ A B) there exists an axiom of type A which is inside of B. alternative definition: `[x y] A=.\type\x A\prop\y` +def \none\ `[x y] \all\ x -y` (\none\ A B) +^^ none: +opposite of \some\. denotes that no axioms of type A exist in B. + + + + + + + + + ## update log // Timestamp: future @@ -333,6 +345,7 @@ alternative definition: `[x y] A=.\type\x A\prop\y` // Timestamp: 2026-02-23 09:37:18 UTC+3:30 - added symbols \some\ and \all\. +- added \none\. // Timestamp: 2026-02-22 13:15:30 UTC+3:30 - added symbols \between\, \ctx\ and \nuos\. |