The Setting
A fixed data wrapper describes a succession of positive and negative changes of representation. An observation combines the represented term with a second input; negative steps exchange the roles of the datum and a formula family. The cancellation question concerns the formula obtained when the represented term was built from a given input.
Fix a pure type specification , with arbitrary axiom and product-rule relations. Terms are variables, sort constants, applications, annotated abstractions , and dependent products .✦ Labelled terms put one of , , and on each application, abstraction, and product.✦ These labels specify argument and result modes: data to data, data to proof, and proof to proof, respectively. Erasure deletes the labels.✦
A mode assignment assigns data or proof mode to each variable. The mode discipline gives a variable its assigned mode and a sort data mode. An application has its label’s result mode when its function has that mode and its argument has the label’s argument mode. An abstraction has its label’s result mode when its annotation has data mode and its body has the result mode, with the bound variable in the argument mode. A product has data mode when both parts have data mode, with its bound variable in the label’s argument mode. A data-only term has label at every application, abstraction, and product.✦
Contexts are newest-first lists. Writing for the pure type system typing judgement, a valid context is obtained from the empty context by adjoining a type for which for some sort . The judgement requires the corresponding labelled product in abstraction and application. Its conversion rule permits a change to a convertible expected type having a sort. Full reduction acts in annotations and binder bodies as well as applications; labelled head contraction requires matching application and abstraction labels. Convertibility is the equivalence relation generated by this reduction. A normal term has no reduction step✦, and a weakly normalizing term reduces in finitely many steps to a normal term.✦
Named binders denote terms with de Bruijn indices, with index zero nearest the binder. Renaming acts on free indices; under a binder its lift fixes zero and sends to . Simultaneous substitution replaces variables by terms, lifting under binders to avoid capture. The notation denotes bound-variable instantiation: index zero is replaced by and older free indices are lowered. These operations preserve labels on labelled terms.
Profiles and Logical Formulas
Write for the chosen full normal form when is weakly normalizing.✦ The normal-form sort profile, axiom successors, and product outputs are the sets specified in (1). (1) A feasible profile is a nonempty set of sorts, , equal to for a normal term in a valid context. A feasible product profile triple has all three profiles feasible and .✦ A labelled type is sorted at when for every ; additional sorts are allowed.✦
Fix a collection of profiles. The primary signed graph has positive edges from a feasible profile to each proper feasible subset, negative edges for feasible triples , and positive edges for those triples.✦ Positive reachability uses only positive edges and permits the empty path.✦ An observation layer for is a profile positively reachable from some nonempty with .✦ A direct observation layer for is an observation layer admitting a triple with .✦ A logical terminal profile for is a profile admitting a triple with .✦
A fixed feasible witness family chooses, at each feasible profile , a data-only type with normal erasure, sorted at , and a term . Both and have data mode under . A mode-preserving context embedding is a variable renaming into a valid context that preserves the types of context variables and their modes.✦ In a newest-first labelled context, context lookup assigns each variable its declared type with free indices shifted past its own declaration and every newer declaration.✦ Write for transport along ; witness transport sends to .
Proof-mode inhabitation of a type is the existence of a proof-mode term with .✦ A typed open proof transformer is a proof-mode term in the context with a temporary proof input of type , as specified in (2); the upward arrow is the successor renaming of free indices. Typed logical equivalence between types and consists of a typed open proof transformer in each direction, as specified in (2). (2) The transformers in (2) are uniform in the temporary proof input.
A proof wrapper is a finite expression generated by an identity and positive or negative extensions, each adjoining a fixed labelled annotation.✦ A formed path for a wrapper starts at a profile with even parity. An inclusion step replaces the current target by a subset without changing the expression or parity. A positive extension along appends and preserves parity; a negative extension along appends and reverses parity, requiring . Renaming a wrapper renames its annotations.✦ A wrapper contains a negative step when at least one extension is negative.✦
An ambient logical calculus is a collection of choices that includes witnesses and typed open proof transformers between the witness types at every ordered pair of terminal profiles. It chooses profiles with triple , together with even proof wrapper paths from to and from to . For every direct observation layer , it also chooses a quantifier route: a triple and even proof wrapper paths from to and from to . Transport renames the witnesses and wrapper annotations, including those of its quantifier routes, and retains the profiles.✦
A witness continuation for a labelled term relative to is the following condition: after any mode-preserving context embedding , a transformer from to , for any terminal profile , entails proof-mode inhabitation of .✦ Stable witness extraction for means that, after every such embedding , a witness continuation for relative to entails proof-mode inhabitation of .✦ An interpretable formula for is a data-mode term sorted at that admits stable witness extraction.✦
A stable formula family over is a term with one distinguished data variable such that, after every embedding and for every data-mode term , the instance is an interpretable formula for .✦ Here renaming the family fixes its distinguished variable. A parity-dependent data argument is defined by (3), where is even and is odd. (3)✦
Fixed Data Paths
A positive data path is a finite expression generated by the identity and extensions with a fixed pair of labelled terms.✦ Its formation from starts with the identity at , permits restriction of the target to any subset, and extends a target along a triple using the pair .✦
A data path tail is a tuple consisting of a sort , a positive data path, and encoding and decoding proof wrappers.✦ A tail formed at requires and nonempty ; its positive path runs from to . The encoding path runs from to and the decoding path from to , both with even parity. The decoding wrapper must contain a negative step.
A retained data path from to is a finite expression with a parity , formed by the following rules. The identity runs from to with even parity, and a restriction replaces its current target by any subset. A positive extension along a triple adjoins the fixed pair and preserves parity. A negative extension along adjoins a tail formed at and reverses parity.
The data path builder and data path observation are the recursive labelled term operations in (4). Write for the preceding path’s type annotation, for sending a formula through a tail , and for reading through that tail. The notation denotes a positive extension and a negative extension; every application and abstraction in (4) has label , and bound names are chosen to avoid capture. (4) The parity cancellation formula is the instance defined in (5). (5)✦
The Claim
Theorem 1. Let be an ambient logical calculus in and let be a formed retained data path from to , of parity . Suppose that is sorted at and has data mode. Let satisfy and let satisfy . Then (6)✦
What Is Checked
The claim (6) is stated over labelled terms and their mode discipline, with a fixed logical calculus, a formed retained data path, sorting of the input type, and complementary parity-dependent data arguments.