E.11.PUR:4.4 - Pairwise precedence

A pairwise precedence relation is an applicable directed constraint between two exact candidate uses for the governed coordination question. It can obtain before either is performed. Establish its branch predicate:

• prerequisiteResult: the dependent use’s direct rule requires exact content, and the coordination has a stated basis for selecting this prerequisite use to supply it. Cite that rule, content and selection basis together with the prerequisite candidate’s exact expectation. Matching output kinds alone is insufficient. The result need not yet exist for the dependency to obtain.
• methodPrecondition: performing the dependent use first would invalidate a condition that the prerequisite use actually needs, and the proposed order preserves that condition. Name both uses and the condition; unary candidate fit alone supplies no pair.
• sharedConstraintResolution: an applicable schedule or priority rule selects this direction to resolve the actual shared constraint. Shared-resource exclusion alone establishes conflict, not A-before-B. A rule selecting B-before-A defeats the proposed A-before-B claim.

PatternUsePrecedenceBasisValue =
  prerequisiteResult | methodPrecondition | sharedConstraintResolution

PatternUseOrderingRelation@Context <: U.Relation:
  coordinationRef: U.EpistemeRef, describing the governed coordination question
  prerequisiteCandidatePatternUseRef: U.EpistemeRef
  dependentCandidatePatternUseRef: U.EpistemeRef
  precedenceBasis: PatternUsePrecedenceBasisValue
  precedenceBasisResultExpectationRef?: U.EpistemeRef  // prerequisiteResult only
  requiredContentAndSelectedSupplierBasis?:  // prerequisiteResult only
  precedenceConditionRef: U.EpistemeRef, describing the applicable semantic condition
  constitutiveOrderingRuleRef?: exact schedule or priority rule when it constitutes this order
  orderingRationaleRef: U.EpistemeRef
  Direction: prerequisiteCandidatePatternUseRef -> dependentCandidatePatternUseRef

The candidates are distinct members of the coordination. The relation obtains while the applicable branch predicate holds for those candidates, the governed question and semantic condition. A known false branch condition establishes non-obtaining; a missing rule or needed case fact leaves it unresolved. An unmet prerequisite result is not a false dependency condition: it concerns readiness below.

Identity and extent. Keep the same dependency for the same exact candidates, governed coordination use, branch and meaning of its precedence condition, including any genuinely constitutive schedule/priority rule. A different rendering, witness or descriptive coordination episteme alone changes none of those values. A changed candidate or meaning-changing condition/rule requires a new relation claim and identity assessment; the record reference is not itself the identity law. Within a temporally qualified use, the occurrence lasts while that branch predicate holds; a gap where it ceases to hold ends the occurrence, and a later re-established occurrence has a new extent. Omit temporal machinery for an atemporal constraint.

Readiness is a separate claim. For prerequisite-result continuation, identify a current E.11.PUA result-closure finding and the actual result and category-correct basis that satisfy the required content and receiving conditions. The closure may concern the prerequisite use or an adequate earlier result reused under §4.2.1. State readiness/applicability for this continuation as its own ordinary C.2.1 claim. A known unmet condition means not ready; missing information leaves readiness unresolved. An expectation, ordering edge or closure record’s presence alone supplies no achieved result.

The dependency is not an instruction to repeat a use whose adequate earlier result is already available. Apply the result-reuse exit before proposing execution. A changed closure can change readiness without changing the prospective dependency. No ordering or readiness claim authorizes Work. Page, seminar, identifier and display order do not establish a dependency.