Toward a Minimal Addressed Operator for Sequential Inquiry: Factorisation, Readdressing, and Recursive Scale Handoff in MKUFT

Abstract

This preprint asks whether, after domain-specific objectives, mechanisms, and representations are stripped away, a clean sequential inquiry process admits a representation-independent addressed factorisation. Extracted from the published MKUFT/ATLD/ARTA lineage, the candidate contract advances from a target-indexed addressed state through a lawful target-relevant inquiry move, a registered realised outcome, and mandatory readdressing before the next question is posed. Minimal query selection is treated separately as a prospective refinement under an independently fixed burden order, while recursive scale handoff is kept as a distinct conditional construction. The paper states seven clean-inquiry requirements, formulates a general factorisation conjecture, develops prospective continuation-kernel conditions for minimal replacement, and supplies explicit reduction and falsification tests against strong neighbouring formalisms including dynamic logics of questions, Blackwell comparison of experiments, Bayesian experimental design, rational metareasoning, POMDPs, active learning, active inference, predictive-state methods, canonical history quotients, and compositional systems. No universal minimal-inquiry theorem is claimed. This v1.0 preprint freezes the addressed inquiry contract, factorisation conjecture, prospective minimal-replacement problem, recursive-scale handoff, strongest nulls, and falsification programme as a stable citable research object.