AngouriMath
ByATerm(AngouriMath.Functions.Boolean.Quantifiers.Kind,AngouriMath.Entity.Variable,AngouriMath.Entity.Set,AngouriMath.Entity.Variable,AngouriMath.Entity.Set,AngouriMath.Entity,System.Boolean)
Method (no overloads)
Summary
The verdict of DecideBy(AngouriMath.Functions.Boolean.Quantifiers.Kind,AngouriMath.Entity,AngouriMath.Entity,AngouriMath.Entity,System.Boolean,System.Nullable{System.ValueTuple{System.String,System.String}}@)'s route through a term, and the term: for
exists x : forall y : P , a term at which P fails for every x , which
makes it false; forforall x : exists y : P , one at which P holds for every
x , which makes it true. The terms are few and fixed, each certainly in the inner
set for every member of the outer one, so a term that works is a proof, and none
working says nothing.
makes it false; for
set for every member of the outer one, so a term that works is a proof, and none
working says nothing.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online