recognition /
Complexity /
Complexity.SAT.PC /
explainer
No prose has been written for this declaration yet. The Lean source and graph data below render
without it.
generate prose now
formal statement (Lean)
55 abbrev InputSet (n : Nat) := Finset (Var n)
proof body
Definition body.
56
57 /-- Propagation-Completeness condition (PC):
58 For every nonempty U ⊆ inputs, there exists a constraint K and v ∈ U such that
59 (i) K mentions v, (ii) K mentions no other element of U, and (iii) K determines v
60 with respect to the unique reference assignment `aRef`. -/
used by (14)
From the project-wide theorem graph. These declarations reference this one in their body.
depends on (13)
Lean names referenced from this declaration's body.
of
in IndisputableMonolith.Astrophysics.NucleosynthesisTiers
decl_use
Var
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
PC
in IndisputableMonolith.Complexity.SAT.PC
decl_use
K
in IndisputableMonolith.Constants
decl_use
K
in IndisputableMonolith.Constants.LambdaRecDerivation
decl_use
U
in IndisputableMonolith.Constants.RSNativeUnits
decl_use
of
in IndisputableMonolith.Foundation.DAlembert.LedgerFactorization
decl_use
of
in IndisputableMonolith.Foundation.PhiForcingDerived
decl_use
of
in IndisputableMonolith.Foundation.SpectralEmergence
decl_use
of
in IndisputableMonolith.Information.PhysicsComplexityStructure
decl_use
and
in IndisputableMonolith.NumberTheory.CirclePhaseLift
decl_use
that
in IndisputableMonolith.NumberTheory.PhiLadderLattice
decl_use
U
in IndisputableMonolith.Recognition
decl_use