Expand description
Middle Exponential Logic
By building on Existential Logic and Exponential Propositions (HOOO), it is possible to talk about nuances of middle propositions.
All middle exponential propositions implies a theory (in HOOO EP).
Up, Down and Middle
The basic middle exponential propositions are:
up(a) = (¬¬a ⋀ ¬(a^true))
down(a) = (¬a ⋀ ¬(false^a))
mid(a) = up(a) ⋁ down(a)
- The
up(a)
proposition is close toa^true
- The
down(a)
proposition is close tofalse^a
- The
mid(a)
proposition is close totheory(a)
Collapsing Theory to Up
theory(a) == up(a)
false == down(a)
These theorems are provable when ¬¬a ⋁ ¬a
(Excluded Middle of Non-Existence).
Functions
down(a) => false
.down(a) ⋀ (¬¬a ⋁ ¬a)^true => false
.theory(a) => false
.theory(a) ⋀ (a ⋁ ¬a)^true => false
.((¬¬a ⋁ ¬a) ⋀ theory(a)) => mid(a)
.down(a) => ¬a
.down(a) => (¬¬a ⋁ ¬a)
.down(a) => (a ⋁ ¬a)
.down(a) => ¬up(a)
.down(a) => theory(a)
.down(a) => up(a)
.down(a) ⋀ (¬¬a ⋁ ¬a)^true => up(a)
.down(a) => virtual(¬a)
.mica(a) => (¬¬a ⋁ ¬a)
.mid(a) => ((¬¬a ⋁ ¬a) ⋀ theory(a))
.mid(a) => (¬¬a ⋁ ¬a)
.mid(a) => theory(a)
.(up(a) ⋀ down(a)) => false
.(¬(x^true) => x) => ¬¬x
.theory(a) => mid(a)
.theory(a) => up(a)
.theory(a) ⋀ (¬¬a ⋁ ¬a)^true => up(a)
.up(a) => a
.up(a) ⋀ (a ⋁ ¬a) => a
.up(a) => (¬¬a ⋁ ¬a)
.up(a) => ¬down(a)
.up(a) => theory(a)
.up(a) => virtual(a)
.up(a) ⋀ (a ⋁ ¬a) => virtual(a)
.virtual(a) => theory(a)
.
Type Definitions
- A down proposition
¬a ⋀ ¬(false^a)
. - A middle proposition
(¬¬a ⋀ ¬(a^true)) ⋁ (¬a ⋀ ¬(false^a))
. - A middle Catuṣkoṭi proposition
(a^true ⋁ false^a) ⋁ (up(a) ⋁ down(a))
. - A subordinate middle proposition
¬(x^true) => x
. - An up proposition
¬¬a ⋀ ¬(a^true)
. - A virtual middle proposition
a ⋀ ¬(a^true)
.