Current published reading edition · 2026-02-08

Standing Preserving Admissibility Conditions for Artificial Epistemic Agents

Amos Jay Maley · 4 pages

Read paperDownload PDFDOI

This paper specifies the necessary conditions for admissibility that preserve standing in artificial epistemic agents. It shows that admissibility is not achieved by performance, learning, optimization, or internal coherence, but only by satisfying standing-preserving constraints on reference, scope, and commitment. By exhaustion, all alternative criteria—probabilistic validation, success metrics, governance certification, or architectural sophistication—are eliminated as insufficient. The result fixes admissibility for artificial agents as a binary structural condition rather than a graded capability. No algorithms, architectures, or implementation procedures are provided; the analysis is necessity-based and eliminative.

From the author's publisher description.

About this paper and citation

Amos Jay Maley. Standing Preserving Admissibility Conditions for Artificial Epistemic Agents. 2026-02-08. DOI: 10.5281/zenodo.18521956.

SHA256 c1286a6bda3beca4eacc1b861a73cb215196f65cc87068cddd940df3a3c59bae

These searchable PDF bytes match the exact publisher release. The PDF retains the equations, theorem numbering and references. A complete manuscript HTML conversion has not been verified.

Edition metadata

Work DOI record · Publisher metadata

Complete publisher description
This paper specifies the necessary conditions for admissibility that preserve standing in artificial epistemic agents. It shows that admissibility is not achieved by performance, learning, optimization, or internal coherence, but only by satisfying standing-preserving constraints on reference, scope, and commitment. By exhaustion, all alternative criteria—probabilistic validation, success metrics, governance certification, or architectural sophistication—are eliminated as insufficient. The result fixes admissibility for artificial agents as a binary structural condition rather than a graded capability. No algorithms, architectures, or implementation procedures are provided; the analysis is necessity-based and eliminative.

Author description for the selected public release. Text formatting may differ from the publisher display. This is descriptive metadata, not a manuscript conversion or independent proof verification.

A preferred reading edition does not replace an exact edition imported by a downstream theorem.