You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, with ◇a == ⊥^(⊥^a), it is possible to prove ¬◇a == ◇¬a.
By wrapping ◇a in a new-type (1-avatar), it is possible to prevent proving ¬◇a == ◇¬a.
The relation between HOOO and Modal Logic becomes like the relation between Möbius Topologies and Hypercubes in Avatar Extensions. See section about Avatar Semantics.
The text was updated successfully, but these errors were encountered:
Currently, with
◇a == ⊥^(⊥^a)
, it is possible to prove¬◇a == ◇¬a
.By wrapping
◇a
in a new-type (1-avatar), it is possible to prevent proving¬◇a == ◇¬a
.The relation between HOOO and Modal Logic becomes like the relation between Möbius Topologies and Hypercubes in Avatar Extensions. See section about Avatar Semantics.
The text was updated successfully, but these errors were encountered: