Supporting results for pointwise provable equality.
Concrete zero-valued semidecision programs. The defining equivalences hold for every input vector in every model of PA.
def
PointwiseComposition.FailureOfComposition.SigmaOneRealization.Semidecides
{n : ℕ}
(φ : FFL.FirstOrder.ArithmeticSemisentence n)
(c : Nat.Partrec.Code)
:
A program accepts exactly the satisfying input vectors and returns zero.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The zero program accepts every vector.
Searching for a zero of successor accepts no vector.
def
PointwiseComposition.FailureOfComposition.SigmaOneRealization.andProgram
(c d : Nat.Partrec.Code)
:
Evaluate both children and discard their outputs.
Equations
Instances For
theorem
PointwiseComposition.FailureOfComposition.SigmaOneRealization.and_semidecides
{n : ℕ}
{φ ψ : FFL.FirstOrder.ArithmeticSemisentence n}
{c d : Nat.Partrec.Code}
(hφ : Semidecides φ c)
(hψ : Semidecides ψ d)
:
Semidecides (φ ⋏ ψ) (andProgram c d)
Pairing the two computations gives conjunction semidecision.