OctoInformBeta

OpenAI preprint, September 2026 · §8. Relational coding of the diagonal argument

Lemma 48: Predicate comparison preserves extensionality and the seven structural properties realized by the chosen parameter

An admissible parameter for structural queries.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Relational coding compares data predicates through the formulas obtained by observing logical elements. Its structural queries concern invariance under observation, the representation of tagged classes and edges, and a guarded closure condition. The parameter in this item is a data term assembled from those seven conditions.

Fix a pure type specification P=(S,𝒜,ℛ)P=(S,\mathcal A,\mathcal R), a context Γ\Gamma, and a mode assignment γ\gamma to its variables. The axiom and product-rule relations are arbitrary. Terms have annotated abstractions λx:A.M\lambda x:A.M and dependent products Πx:A.B\Pi x:A.B; their labels distinguish data and proof arguments and results. Write Γ⊢γdM:A\Gamma\vdash_\gamma^{\mathrm d}M:A when Γ⊢M:A\Gamma\vdash M:A and MM has data mode, and use p\mathrm p for proof mode. Conversion uses full β\beta reduction, including annotations and binder bodies. Named binders below correspond to de Bruijn indices in newest-first contexts. A full β\beta normal form is a term with no one-step β\beta reduct, including reductions in annotations and binder bodies.✦ A term is weakly normalizing when a finite sequence of β\beta reductions, possibly empty, reaches a full β\beta normal form.✦ Write M#M^\# for the unique full β\beta normal form of MM when it exists, with a fixed arbitrary choice otherwise.✦ A valid context is obtained from the empty context by adjoining a type AA whenever Γ⊢A:s\Gamma\vdash A:s for some sort ss.✦ The normal form sort profile πΓ(T)\pi_\Gamma(T) of a term TT is the set of all sorts ss for which Γ⊢T#:s\Gamma\vdash T^\#:s.✦ A feasible sort profile is a nonempty set II of sorts realized as πΔ(T)\pi_\Delta(T) by a full β\beta normal form TT in a valid context Δ\Delta.✦ The axiom profile Ax⁡(s)\operatorname{Ax}(s) of a sort ss is the set of sorts tt with (s,t)∈𝒜(s,t)\in\mathcal A.✦ For sort sets I,JI,J, their product output profile Out⁡(I,J)\operatorname{Out}(I,J) consists of the sorts cc for which (a,b,c)∈ℛ(a,b,c)\in\mathcal R for some a∈Ia\in I and b∈Jb\in J.✦ A feasible product profile triple (I,J,K)(I,J,K) consists of feasible sort profiles with K=Out⁡(I,J)K=\operatorname{Out}(I,J); II, JJ and KK are its domain, codomain and product profiles.✦ The edges of the primary profile graph are exactly the positive edges from a feasible profile II to a feasible proper subset JJ, and the negative edges from II to KK and positive edges from JJ to KK supplied by feasible product profile triples (I,J,K)(I,J,K).✦ Positive reachability in a signed graph means reachability along a finite sequence of positive edges, allowing the empty sequence.✦

Proof-mode inhabitation of a formula FF is the condition Pr⁡(F)\operatorname{Pr}(F) in (1). A typed open transformer from FF to GG is a term tt with Γ,a:F⊢t:G\Gamma,a:F\vdash t:G in proof mode, with aa assigned proof mode.✦ Formula equivalence F≃GF\simeq G between formulas FF and GG is the relation given by the existence of typed open proof-mode transformers in both directions, uniformly in the displayed data variables.✦ Pr⁡(F)⇔there is a term p with Γ⊢γpp:F.\operatorname{Pr}(F) \quad\Longleftrightarrow\quad \text{there is a term }p\text{ with } \Gamma\vdash_\gamma^{\mathrm p}p:F .(1)✦

Let LL be an ambient classical logical interpretation, with its fixed data witnesses and incoming and outgoing proof paths. Its logical operations are written ⊥\bot, ¬\neg, ⇒\Rightarrow, ∧\wedge, ∨\vee and ↔\leftrightarrow. The symbol ↔\leftrightarrow denotes the conjunction of the two internal implications.✦ Universal quantification uses fixed routes KYK_Y for elements and KPK_P for predicates; each route wraps a data-to-proof dependent product by its incoming and outgoing proof paths.✦ Existential quantification is ¬∀¬\neg\forall\neg.✦ These connectives and quantifiers denote formulas of LL. The logical conditional with guard GG and branches A,BA,B is (G∧A)∨(¬G∧B)(G\wedge A)\vee(\neg G\wedge B).✦ For a collection CC of sort sets, an observation layer is a profile positively reachable in the primary graph from a nonempty axiom profile Ax⁡(s)\operatorname{Ax}(s) with {s}∈C\{s\}\in C.✦ A direct observation layer for CC is an observation layer II for which some J,K∈CJ,K\in C form a feasible product profile triple (I,J,K)(I,J,K).✦ A logical terminal profile for CC is a profile JJ for which some I,K∈CI,K\in C form a feasible product profile triple (I,J,K)(I,J,K).✦ A labelled term is data-only when every application, abstraction and dependent product in it has data argument and result modes.✦ The erasure of a labelled term removes its labels and preserves its variables, sorts, applications, annotated abstractions and dependent products.✦ A labelled type AA is sorted at a profile II when Γ⊢A:s\Gamma\vdash A:s for every s∈Is\in I, with additional sorting judgments permitted.✦ A fixed feasible witness family chooses types TIT_I and values aIa_I for sort sets II; at every feasible II, TIT_I is data-only with full β\beta normal erasure, is sorted at II, and satisfies Γ⊢γdTI:s\Gamma\vdash_\gamma^{\mathrm d}T_I:s for every s∈Is\in I, while Γ⊢γdaI:TI\Gamma\vdash_\gamma^{\mathrm d}a_I:T_I.✦

Relational Predicates and Observations

A retained data path is a finite wrapper path generated by identity, positive extensions with a fixed annotation and argument, and negative extensions with a fixed data tail.✦ The parity of a retained data path DD is the number of its negative extensions modulo two. A double data channel consists of two odd retained data paths.✦ For a path DD, write D(T)D(T) for its wrapped type and obs⁡D(T,w,a)\operatorname{obs}_D(T,w,a) for its observation of ww against aa at TT. Positive injection along a positive data path leaves a term unchanged at identity and forms a constant data abstraction over the retained annotation at each extension.✦ Positive projection along a positive data path leaves a term unchanged at identity and applies it to each retained argument before continuing along the preceding path.✦

For a double data channel and a type TT, the double wrapper carrier of TT is the type obtained by wrapping TT along the channel’s first path and then along its second path.✦ The carrier of a data tail is the positive wrapper of its terminal sort along its positive path.✦

A relational coding RR consists of a uniform probe and odd logical and predicate paths Dℓ,DpD_\ell,D_p.✦ The probe has a seed sort, an initial path, odd raw and return paths, an even function path, a positive lifting path, and a data tail.✦ The common type UU of the uniform probe of a relational coding RR is a dependent product in data mode over the probe’s type parameter. The shared channel 𝒞=(Dℓ,Dr,Dp)\mathcal C=(D_\ell,D_r,D_p) uses the probe’s raw path DrD_r.✦ The logical and predicate types of this channel are those of (2). Log⁡𝒞(T)=Dℓ(T),Pred⁡𝒞(T)=Dp(Dr(T)).\operatorname{Log}_{\mathcal C}(T)=D_\ell(T), \qquad \operatorname{Pred}_{\mathcal C}(T)=D_p(D_r(T)).(2) The probe type parameter domain is the positive wrapper of the seed sort along the lifting path.✦ At a type AA, the probe function type is the data arrow from its single bundle type to its data tail carrier.✦ The probe codomain family projects the bound type parameter along the positive lifting path, forms the probe function type at that projection, and wraps the result along the even function path.✦ The probe parameter type at AA is the parameter type of the probe double channel at the probe raw type of AA.✦ The single bundle type at AA is the double wrapper carrier of the probe parameter type at AA, using the probe double channel.✦

For a type TT, a predicate i:Pred⁡𝒞(T)i:\operatorname{Pred}_{\mathcal C}(T) and a logical element x:Log⁡𝒞(T)x:\operatorname{Log}_{\mathcal C}(T), channel evaluation ET(i,x)E_T(i,x) is the formula obtained by observing ii along DpD_p against the raw reencoding of xx, at Dr(T)D_r(T).✦ For a type TT and an open formula QQ on logical elements of Log⁡𝒞(T)\operatorname{Log}_{\mathcal C}(T), the encoded predicate Pred⁡T(Q)\operatorname{Pred}_T(Q) is the data predicate obtained by composing QQ with reencoding from the raw path to the logical path and applying the predicate path builder. Predicate comparison Cmp⁡T(i,c)\operatorname{Cmp}_T(i,c) is the formula in (3). Cmp⁡T(i,c)=∀KYx:Log⁡𝒞(T),(ET(i,x)↔ET(c,x)).\operatorname{Cmp}_T(i,c)= \forall^{K_Y}x:\operatorname{Log}_{\mathcal C}(T),\, \bigl(E_T(i,x)\leftrightarrow E_T(c,x)\bigr).(3)✦ The channel roundtrip of a logical element is its reencoding to the raw path followed by reencoding back to the logical path.✦ A predicate is roundtrip invariant when its evaluation at every logical element is internally equivalent to its evaluation after the channel roundtrip.✦ The admissibility guard for a predicate is the conjunction of its roundtrip invariance and the supplied predicate condition.✦ Guarded observational equivalence of two logical elements means that their evaluations are internally equivalent for every predicate satisfying the chosen admissibility guard.✦

The equivalence class predicate of an element is the encoded predicate of logical elements guardedly observationally equivalent to it.✦ The class union predicate of two logical elements is the encoded predicate whose formula is the disjunction of membership in their guarded observational classes.✦

A structural query observes a parameter along the second path against a tagged payload encoding of the supplied predicate.✦ The class query tags for copy indices 0,1,20,1,2 are the structural tags 1,2,31,2,3, respectively.✦ The edge query tags for the first and second edge kinds are 44 and 55, respectively.✦ A class query at copy index jj applies the structural query at class tag j+1j+1 to the guarded equivalence class predicate of the given logical element.✦ A tagged edge of the first kind from yy to zz requires the class queries placing yy in class 00 and zz in class 11, together with the tag 44 query on their guarded class union predicate. The second kind uses class 22 for zz and tag 55 for the union query. For a predicate pp and logical element aa, a logical element zz satisfies the pair membership formula if either some logical element yy has a first-kind tagged edge to zz and satisfies pp, or aa has a second-kind tagged edge to zz, with the chosen guard and query family throughout.✦ The pair predicate of pp and aa is the encoded predicate of elements satisfying their pair membership formula.✦

For a data predicate i:Pred⁡𝒞(U)i:\operatorname{Pred}_{\mathcal C}(U), the uniform predicate probe ziz_i is the data term that abstracts over a type parameter and a single-bundle argument. Its test recovers the pullback of ii along the relational element lift. For a data predicate i:Pred⁡𝒞(U)i:\operatorname{Pred}_{\mathcal C}(U) and a logical element x:Log⁡𝒞(U)x:\operatorname{Log}_{\mathcal C}(U), the probe order i≼xi\preccurlyeq x is the observation formula obs⁡Dℓ(U,x,zi)\operatorname{obs}_{D_\ell}(U,x,z_i).✦ Put X=Log⁡𝒞(U)X=\operatorname{Log}_{\mathcal C}(U) and ℐ=Pred⁡𝒞(U)\mathcal I=\operatorname{Pred}_{\mathcal C}(U). Probe element comparison, predicate extensionality and order validity are the formulas in (4). x≈Xy=∀KPi:ℐ,(i≼x↔i≼y),Ext⁡(i)=∀KYx:X∀KYy:X,(x≈Xy⇒(EU(i,x)↔EU(i,y))),Valid⁡(x)=∀KPi:ℐ∀KPc:ℐ,(Cmp⁡U(i,c)⇒(i≼x↔c≼x)).\begin{aligned} x\approx_X y &=\forall^{K_P}i:\mathcal I,\, \bigl(i\preccurlyeq x\leftrightarrow i\preccurlyeq y\bigr),\\ \operatorname{Ext}(i) &=\forall^{K_Y}x:X\,\forall^{K_Y}y:X,\, \bigl(x\approx_X y\Rightarrow (E_U(i,x)\leftrightarrow E_U(i,y))\bigr),\\ \operatorname{Valid}(x) &=\forall^{K_P}i:\mathcal I\,\forall^{K_P}c:\mathcal I,\, \bigl(\operatorname{Cmp}_U(i,c)\Rightarrow (i\preccurlyeq x\leftrightarrow c\preccurlyeq x)\bigr). \end{aligned}(4) Probe specialization at AA applies the probe in data mode to the positive injection of AA along its lifting path.✦ Probe application observation specializes the probe at AA, observes the result along its even function path at the probe function type, and tests it by applying the recovered function to the supplied bundle and decoding the result through the data tail.✦

For relational coding at AA and parameter mm, the relational base type is the initial probe wrapper of AA.✦ The structural admissibility guard requires roundtrip invariance together with the tag 00 structural query of mm, over this base type.✦ The relational pair predicate of pp and aa is their channel pair predicate over the relational base type, using the structural admissibility guard and the seven structural queries of the parameter.✦

A source data bundle with entries d,m,yd,m,y is built along the second path over the first-path wrapper of its base type. Its formula tests the input against dd along the first path and chooses its observation against mm when that test holds and against yy when its negation holds.✦ An encoded data point is built along the second path at the predicate code type. Its body conjoins the tag 77 marker for the chosen truth marker with observation of its decoded payload against the point, along the supplied odd path.✦ The relational point encoding of yy is the encoded data point in the probe double channel at the probe raw type, using the predicate path, the constant truth marker, and the raw channel reencoding of yy as payload.✦ The relational argument bundle of mm and yy is the source data bundle in the probe double channel at the probe parameter type, with entries the dummy observation, mm, and the relational point encoding of yy.✦ The diamond observation of a probe vv at yy and parameter mm is its probe application observation against the relational argument bundle of mm and yy.✦

For a probe vv and a chosen type and parameter, the probe section predicate of vv is the encoded predicate whose value at yy is the diamond observation of vv at yy.✦ The section pair query for vv and aa is the tag 66 query of the parameter on the relational pair predicate of the probe section predicate of vv and the element aa.✦

Bundle access observation tests the bundle along the second path against a first-path probe.✦ The probe uses a logical conditional with the chosen guard, truth as its true branch, and observation of the bundle after the supplied inner callback as its false branch.✦ Recovery access observation is bundle access at the parameter type, with the dummy test as its guard and the inner observation probe of the supplied payload as its inner callback.✦

Predicate pullback recovery for the single bundle in the probe double channel is the recovery access observation that uses the predicate path at the probe raw type and tests each parameter with the corresponding predicate pullback.✦

A three-copy observation system OO consists of RR and inner and outer double data channels.✦ Its copy structure starts with DℓD_\ell, reencodes along DrD_r, and embeds successively through the inner and outer channels.✦ For x:Xx:X, write τjx\tau_jx for its tagged copy, j=0,1,2j=0,1,2. The inner embedding has its marker set precisely for j=1j=1, and the outer embedding precisely for j=2j=2. Write YY for the resulting observation carrier, bin,boutb_{\mathrm{in}},b_{\mathrm{out}} for its two marker observations, and Oi(y)O_i(y) for its observation against ziz_i after recovery through both copy channels. Tagged observational comparison is the formula y≈Yzy\approx_Y z in (5). y≈Yz=(bin(y)↔bin(z))∧((bout(y)↔bout(z))∧∀KPi:ℐ,(Oi(y)↔Oi(z))).\begin{aligned} y\approx_Y z={}& \bigl(b_{\mathrm{in}}(y)\leftrightarrow b_{\mathrm{in}}(z)\bigr)\wedge \Bigl(\bigl(b_{\mathrm{out}}(y)\leftrightarrow b_{\mathrm{out}}(z)\bigr)\wedge \forall^{K_P}i:\mathcal I,\, \bigl(O_i(y)\leftrightarrow O_i(z)\bigr)\Bigr). \end{aligned}(5)✦ Signed payload embedding with bit bb builds along the second path from observation against the payload along the first path, retaining that formula when bb is true and negating it when bb is false.✦ Double channel evaluation observes its input along the second path against the first-path builder of the supplied predicate.✦ Signed payload recovery is the logical conditional with the encoded bit observation as guard, double channel evaluation as its true branch, and the negation of that evaluation as its false branch.✦ The encoded bit observation tests the input along the second path against the first-path builder of the constant truth predicate.✦

Specialized observational comparison of y,z:Yy,z:Y is universal quantification over i:ℐi:\mathcal I of the internal equivalence between Oi(y)O_i(y) and Oi(z)O_i(z).✦

The Seven Structural Conditions

A specialized relational coding BB is an observation system OO with a chosen type AA.✦ Write AbA_b for its base type. The predicate type of BB is V=Pred⁡𝒞(Ab)V=\operatorname{Pred}_{\mathcal C}(A_b).✦ Write E(v,y)=EAb(v,y)E(v,y)=E_{A_b}(v,y) and Cmp⁡(v,c)=Cmp⁡Ab(v,c)\operatorname{Cmp}(v,c)=\operatorname{Cmp}_{A_b}(v,c). The specialization has the seed-sort judgment Γ⊢γdA:s0\Gamma\vdash_\gamma^{\mathrm d}A:s_0, where s0s_0 is the probe’s seed. Its shape conditions identify YY with Log⁡𝒞(Ab)\operatorname{Log}_{\mathcal C}(A_b), the second outer path with DℓD_\ell, and the first outer wrapper of the middle copy type of UU with AbA_b.

For v:Vv:V, the left-copy predicate ivi_v is Pred⁡U(x↦E(v,τ1x))\operatorname{Pred}_U(x\mapsto E(v,\tau_1x)). The observation invariance formula G(v)G(v), class representation formulas Cj(v)C_j(v), edge representation formulas Ej(v)E_j(v), and relational closure formula R(v)R(v) are defined in (6). G(v)=∀KYy:Y∀KYz:Y,(y≈Yz⇒(E(v,y)↔E(v,z))),Cj(v)=∃L,KYx:X∀KYw:Y,(E(v,w)↔w≈Yτjx),Ej(v)=∃L,KYx:X∀KYw:Y,(E(v,w)↔((w≈Yτ0x)∨(w≈Yτjx))),R(v)=Ext⁡(iv)⇒∀KYx:X,(Valid⁡(x)⇒(E(v,τ2x)⇒iv≼x)).\begin{aligned} G(v)&=\forall^{K_Y}y:Y\,\forall^{K_Y}z:Y,\, \bigl(y\approx_Y z\Rightarrow(E(v,y)\leftrightarrow E(v,z))\bigr),\\ C_j(v)&=\exists^{L,K_Y}x:X\,\forall^{K_Y}w:Y,\, \bigl(E(v,w)\leftrightarrow w\approx_Y\tau_jx\bigr),\\ E_j(v)&=\exists^{L,K_Y}x:X\,\forall^{K_Y}w:Y,\, \Bigl(E(v,w)\leftrightarrow \bigl((w\approx_Y\tau_0x)\vee(w\approx_Y\tau_jx)\bigr)\Bigr),\\ R(v)&=\operatorname{Ext}(i_v)\Rightarrow \forall^{K_Y}x:X,\, \bigl(\operatorname{Valid}(x)\Rightarrow (E(v,\tau_2x)\Rightarrow i_v\preccurlyeq x)\bigr). \end{aligned}(6)

The structural property Ht(v)H_t(v), for 0≤t<70\leq t<7, is the branch selected by (7). (H0(v),H1(v),H2(v),H3(v),H4(v),H5(v),H6(v))=(G(v),C0(v),C1(v),C2(v),E1(v),E2(v),R(v)).\bigl(H_0(v),H_1(v),H_2(v),H_3(v),H_4(v),H_5(v),H_6(v)\bigr) =\bigl(G(v),C_0(v),C_1(v),C_2(v),E_1(v),E_2(v),R(v)\bigr).(7)✦

Let DD be the probe’s double channel and TrT_r the probe raw type of AA. A query Qt(m,v)Q_t(m,v) is the second-path observation of mm against the tagged payload encoding of vv, using the predicate path and tag tt.✦ The eight query tags use the nonzero indices t+1t+1 among nine marker indices, whose four binary digits are read from least to most significant. The dummy formula Dummy⁡(m)\operatorname{Dummy}(m) is the second-path observation of mm against the bottom predicate code at TrT_r.✦

For a double data channel and a type TT, the iterated carrier of TT is the type that equals TT at depth zero and applies the channel’s double wrapper carrier once more at each successive depth.✦ The fourfold carrier of TT is its iterated carrier at depth four.✦

The parameter type at TT is the second-path wrapper of its predicate code type.✦ The dummy observation at TT is built along the second path at the predicate code type, with constant truth as its body.✦ The inner observation probe of a payload is built along the first path at the parameter type. Its body is the logical conditional with the dummy test as guard, falsity as its true branch, and the tag 77 query of the payload as its false branch.✦

Iterated signed embedding leaves the payload unchanged for an empty bit string; for a first bit and remaining string, it first embeds along the remaining string and then performs the signed embedding selected by the first bit at the corresponding iterated carrier.✦ The iterated recovery predicate at depth zero is the supplied predicate, and at each successive depth it performs signed payload recovery at the preceding iterated carrier using the preceding recovery predicate.✦ The tag predicate for an empty bit string is truth. For a first bit and remaining string, it conjoins the encoded bit observation or its negation, according to that bit, with signed recovery of the tag predicate for the remaining string.

The constant truth marker c⊤c_\top is built along the raw path at AbA_b with constant body ⊤=(⊥⇒⊥)\top=(\bot\Rightarrow\bot).✦ The structural realization Real⁡D(c⊤;H)\operatorname{Real}_D(c_\top;H) is built along the second path of DD at its predicate code type. Write Mark⁡t\operatorname{Mark}_t for the marker that tests the first path against the tagged embedding with tag tt, and decode\operatorname{decode} for the payload decoder using the predicate path. The body of the structural realization is the right-associated disjunction of the seven branches Mark⁡t(c⊤)∧Ht(decode⁡(b))\operatorname{Mark}_t(c_\top)\wedge H_t(\operatorname{decode}(b)), ending in ⊥\bot; here bb is its input predicate code. The chosen parameter m0m_0 is defined by (8). m0=Real⁡D(c⊤;H).m_0=\operatorname{Real}_D(c_\top;H).(8)✦

Query respect Resp⁡t(m0)\operatorname{Resp}_t(m_0) and admissibility Adm⁡(m0)\operatorname{Adm}(m_0) are the formulas in (9). The finite conjunction is right-associated. Resp⁡t(m0)=∀KPv:V∀KPc:V,(Cmp⁡(v,c)⇒(Qt(m0,v)↔Qt(m0,c))),Adm⁡(m0)=¬Dummy⁡(m0)∧⋀t=06Resp⁡t(m0).\begin{aligned} \operatorname{Resp}_t(m_0) &=\forall^{K_P}v:V\,\forall^{K_P}c:V,\, \bigl(\operatorname{Cmp}(v,c)\Rightarrow (Q_t(m_0,v)\leftrightarrow Q_t(m_0,c))\bigr),\\ \operatorname{Adm}(m_0) &=\neg\operatorname{Dummy}(m_0)\wedge \bigwedge_{t=0}^{6}\operatorname{Resp}_t(m_0). \end{aligned}(9)

The Claim

Theorem 1. Let RR be a relational coding for LL satisfying its typing and mode conditions, with element and predicate quantifier routes KY,KPK_Y,K_P. Let i,ci,c be data terms of type ℐ\mathcal I in Γ\Gamma, and suppose Pr⁡(Cmp⁡U(i,c))\operatorname{Pr}(\operatorname{Cmp}_U(i,c)). Their extensionality formulas satisfy (10). Ext⁡(i)≃Ext⁡(c).\operatorname{Ext}(i)\simeq\operatorname{Ext}(c).(10)✦

Let BB be a specialized relational coding for the same logical interpretation and its quantifier routes, satisfying the typing and mode conditions for its observations. Fix 0≤t<70\leq t<7. If v,cv,c are data terms of type VV in Γ\Gamma and Pr⁡(Cmp⁡(v,c))\operatorname{Pr}(\operatorname{Cmp}(v,c)), then (11) holds. Ht(v)≃Ht(c).H_t(v)\simeq H_t(c).(11)✦

For every data term vv of type VV in Γ\Gamma, the query answer is related to its structural formula by (12). Qt(m0,v)≃Ht(v).Q_t(m_0,v)\simeq H_t(v).(12)✦

The chosen parameter satisfies (13). Pr⁡(Adm⁡(m0)).\operatorname{Pr}\bigl(\operatorname{Adm}(m_0)\bigr).(13)✦

What Is Checked

The statements are over labelled terms with their typing and mode judgments, an ambient logical interpretation, retained paths and quantifier routes satisfying their typing and mode conditions, and a specialization satisfying the typing and mode conditions for its observations, its seed-sort judgment and its three shape conditions.