The knowledge order: undefined is below every value, and the defined values are
incomparable.
Used by instDecidableRelKLE, instLEKnow
Docs / Logic / Trivalent / Knowledge
import Linglib.Logic.Trivalent.Knowledge · namespace Trivalent
The order of Trivalent is the truth order false < undefined < true. The knowledge order ≤ₖ,
carried by the synonym Know Trivalent as in Logic/Bilattice/Defs.lean, orders the same values
by information instead, with undefined below both defined values. Kleene's negation and his
strong connectives are monotone for it, which is Kleene's regularity condition, while the Weak
Kleene connectives are not even monotone for the truth order. The knowledge order has meets but no
top: Kleene's values lack the glut of Belnap's four values, of which they are the consistent part.
PartialOrder, OrderBot and SemilatticeInf instances on Know Trivalent.Trivalent.IsExtensionOf, Trivalent.IsRegular: a trivalent quantifier that agrees with a
classical one on classical predicates, and one that is monotone for the knowledge order.Trivalent.kLE_iff: the knowledge order, characterized.Trivalent.truthOrder_ne_knowledgeOrder: the two orders differ.Negation Trivalent instance, Trivalent.inf_kLE_inf_left, Trivalent.sup_kLE_sup_left:
the Strong Kleene connectives are knowledge-monotone.Trivalent.kLE_ofProp_eq_true: Bochvar's assertion operator only adds information.Trivalent.meetWeak_not_truthMono, Trivalent.joinWeak_not_truthMono: the Weak Kleene ones are
not truth-monotone.Trivalent.toKnow_supervaluation: over a nonempty family, the supervaluation is the knowledge
meet of the classical values, so shrinking the family can only add information
(Trivalent.supervaluation_kLE_supervaluation).The knowledge order: undefined is below every value, and the defined values are
incomparable.
Used by instDecidableRelKLE, instLEKnow
The definition is too large to print here; read it in the source.
Built from
Used by instDecidableLEKnow
Built from
Built from
The definition is too large to print here; read it in the source.
The definition is too large to print here; read it in the source.
The truth order and the knowledge order differ: false is below undefined in the truth
order but not in the knowledge order.
Kleene's negation is regular; being unary, it is the unique monotone extension of Boolean
not.
Strong Kleene conjunction is regular in each argument.
Strong Kleene disjunction is regular in each argument.
Bochvar's assertion operator only adds information.
Weak Kleene conjunction is not truth-monotone, since undefined ≤ true but
meetWeak undefined false = undefined is not below meetWeak true false = false; unlike ⊓ it is
no bilattice operation.
Weak Kleene disjunction is not truth-monotone either.
Over a nonempty family, the supervaluation is the knowledge meet of the classical values.
Shrinking a family to a nonempty subfamily can only add information. Nonemptiness is needed,
since the empty family's true is a convention rather than a meet and a family whose members all
fail P has the incomparable value false.
A trivalent quantifier is an extension of Q when it has the value of Q at every classical
predicate.
Used in Logic/Trivalent/Deployment, Logic/Trivalent/UniversalInference
A trivalent quantifier is regular when more information about its argument gives more information about its value (Kleene 1952).
Used in Logic/Trivalent/Deployment, Logic/Trivalent/UniversalInference