Skip to content
#edge computing Open access

The Structure of Admissibility: Bivalent Qualification, Exhaustion, and the Unique Admissible Interior

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

This paper develops the next foundational layer of the AASC formalism: the exact structure of admissibility once non-degenerate determinate construction has already incurred the kernel roles of Admissibility, Standing, Reference, and Irreversibility. Its central contribution is to distinguish three questions that are often compressed into the single word “status”: whether a determinate occurrence qualifies for a specified complete use; what information must be retained to preserve all required observations and continuations; which qualified configurations remain eligible throughout a declared reuse contract. The answers are respectively: a bivalent qualification; a canonical complete interface; a unique greatest safe admissible interior. Principal Results The paper establishes five connected results. Bivalent Qualification For each complete qualification question, the original semantic status is bivalent. This means that the qualification proposition has a positive or negative value at its determinate locus. Bivalence is a semantic classification, not an algorithm, an observation event, or a claim that evidence is always available. Failure to obtain an answer is not automatically the negative result, and a partial reader that returns no value has not thereby established non-qualification. The paper also distinguishes a single qualification bit from the complete profile of a determinate object. Multiple configurations may share the same qualification while differing in identity, application-definedness, continuation behavior, or other required observations. Canonical Complete Interfaces A complete observation family determines a canonical minimal lossless interface. The interface preserves exactly the distinctions required by the declared use family, including application-definedness and continuation behavior where relevant. The paper proves that: the complete observation quotient is the coarsest equivalence preserving all required observations; every adequate representation factors uniquely through that quotient; two representations with the same fibres are uniquely isomorphic on their attained images; a binary interface is complete exactly when every required observation is constant on the fibres of the qualification bit; equal qualification does not justify identifying presentations that have different required observations. Thus a one-bit interface is not assumed. It is obtained only when the complete use profile genuinely descends to that bit. Primitive operations and observations are treated through finite continuations. The paper gives exact domain-saturation and output-descent conditions under which a complete family of contextual observations factors through a reduced interface. It also constructs the maximal continuation congruence for a declared operational language. The Unique Greatest Admissible Interior The paper then distinguishes immediate qualification from robust standing under reuse. For a fixed configuration space, declared continuation relation, local qualification predicate, and independently specified edge warrants, it defines the safe interior as the set of configurations from which every declared finite continuation remains qualified and warranted. The resulting operator is monotone and has a greatest fixed point. The paper proves that this greatest safe interior: contains every sound inductive or invariant candidate; is itself sound and closed under the declared reuse conditions; is the unique complete admissible interior for the fixed contract; provides a finite failed-node or failed-edge witness for every excluded configuration; is preserved under faithful relation-isomorphism and complete quotient transport. “Unique interior” refers to uniqueness of the complete admissible set for the fixed domain and reuse contract. It does not imply that the interior is a singleton, contains only one object, or admits only one reference class. Conservation, History, and Endpoint Qualification Original-incidence conservation is established separately from robust standing. Independently warranted representations of the same bearer, complete question, and result relation must agree wherever they answer the same original question. The paper also proves retained-history conservation: a failed original qualification cannot be erased from the history that contains it; a later repair or successful construction creates a new occurrence rather than retroactively changing the original one; a corrected report may improve knowledge of the original occurrence without replacing its conditions; negative endpoint absorption is an additional property, not a consequence of historical fixation alone. Endpoint standing certifies the whole retained path only when the transition relation satisfies the corresponding negative-absorption condition. Semantic Exhaustion The paper strengthens the exhaustion argument by starting from independently specified original result relations, intended uses, continuation semantics, and warrant conditions. A claimed complete result graph or admissible interior can fail through surplus, omission, or both: a surplus answer or state is admitted without the original warrant; an original result, observation, or safe configuration is omitted; an apparently valid answer is assigned to the wrong bearer, question, or occurrence; a later occurrence is substituted for the retained original; an answer or certificate is transported across scope without a valid connection; an interface relies on a distinction that it does not retain; an authorization chain lacks an independently grounded entrance. These mechanisms are organized into five failure classes: silent redescription; incorrect qualification or unfulfilled admission obligation; retrospective substitution; unwarranted scope transport; unlicensed distinguishing information. The paper makes clear that these classes may overlap and are not claimed to be irreducible. Their role is to provide an exhaustive witness structure for the original determinate-use problem, rather than a list of labels asserted to cover every possible case. AMetric and Authorization Constraints The local AMetric analysis supplies the associated impossibility results: discarded distinctions cannot be recovered from a lower interface; an unmarked equality-only carrier cannot select an eligible atom from a non-singleton candidate set; a purported selector must satisfy the relevant stabilizer condition; an unseeded rule closure cannot generate its own authorization; a metric, probability, parameter, or auxiliary label contributes authority only when its warranted connection to the target is independently established. These results do not prohibit richer structure. They identify the exact conditions under which such structure adds legitimate information rather than merely relabelling or presupposing the result it is intended to establish. Scope The results apply to a fixed determinate-use problem with independently specified: bearer and complete question; original qualification relation; observation and continuation family; local and edge-warrant conditions; comparison and transport rules. The paper does not claim that every physical or mathematical system satisfies these hypotheses, that every admissible interior is populated, that every complete interface is computable, or that a unique admissible set is necessarily a singleton. Coverage must be established from the original task, not created by deleting inconvenient observations or declaring a preferred vocabulary exhaustive. The work is structural and mathematical. It does not derive a particular physical theory, replace domain-specific existence proofs, or claim that the full revised theorem chain has already been machine-checked by a proof assistant. Significance for AASC This paper converts the kernel necessity result into a complete architecture for admissibility: It therefore supplies the precise bridge between the necessary conditions of determinate construction and the downstream classification of admissible representations, standing-preserving continuations, and same-scope failure. Keywords AASC; admissibility; bivalent qualification; determinate objecthood; admissible interior; greatest fixed point; fixed-domain exhaustion; semantic exhaustion; complete observation quotient; lossless interface; standing conservation; faithful transport; same-scope closure; AMetric boundary; historical fixation

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 6, 2026

What AI gets wrong and what failure teaches us

Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity.  The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.