Research map
What can a system distinguish, and how do those distinctions change?
This is the organising question behind B-Theory. The path below links existing mathematical work to proposed research directions. These stages show a conceptual progression, not a claim that one paper proves the next.
Represent
Represent a state
A system needs a formal way to describe possible states and operations on them.
Correspondence Matrices
How can logical operations be represented and combined without losing their meaning across symbolic and numeric forms?
Related manuscript: Correspondence and Logical Matrices: A Typed Boolean Operator CalculusRead this project Supporting methods noteGuarded Boolean Dispatch
Which permitted sign tests identify an operator exactly on a declared domain?
Related manuscript: Guarded Boolean Operators: Exact Dispatch and a Polynomial Guard-Degree TradeoffRead this project Supporting correction reportCM Model Correctness Audit
Which conclusions survive when the scalar, tensor, transformation and readout contracts are kept explicit?
Related manuscript: Correctness Audit of Boolean CM Modal ModelsRead this project Methods and negative-results reportCM Compiler Computation
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Operator-Level Boolean Computation with Correspondence MatricesRead this project Specialist working manuscriptChain-Ring Contextuality
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Contextuality and Exact Information Resources over Finite Chain RingsRead this project Specialist research noteCharacteristic-Two Query Bounds
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Exact Bernstein–Vazirani Query Complexity in Characteristic-Two Modal ComputationRead this project Supporting technical companionSigned and Integral CM Lifts
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Signed and Integral Lifts of Correspondence MatricesRead this project Supporting technical companionBoolean CM Phase Algebra
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Boolean CM Phase Algebra: Native Operations, Tags, and ReadoutRead this project Supporting process companionChain-Ring Process Semantics
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Process Closure and Restricted Conversion in a Chain-Ring Modal ModelRead this project Supporting bridge reportLM–Modal Bridge
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Does the Symbolic LM Calculus Canonically Induce the Modal Measurement Theory?Read this project Research frameworkAlgebraic Logic
Which algebraic structures let us describe logical states and operations consistently?
Read this project Methods companionRecoverable representation migration
Which declared answers can be preserved when a representation is replaced?
Related manuscript: Preserving Declared Capabilities Across Representation Replacement: Executable Decoders, Adversarial Migration, and Trajectory AuditsRead this projectObserve
Observe and distinguish
Available tests determine which states remain indistinguishable and what changes when observations improve.
General Observation Refinement
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Observation Refinement Beyond a Fixed Carrier, with Constrained Observation DesignRead this project Expository manuscriptProLT Observation Topologies
Which logical states can a chosen family of observations distinguish?
Related manuscript: Observation Topologies for Finite Propositional Semantics: Distinguishability, Distance, and InferenceRead this project Research manuscriptBinary Order Thinning
When does a new Boolean distinction preserve the topology of an ordered state space?
Related manuscript: Binary Order Thinning of Finite Posets: Homology, Collapses, and Sharp LimitsRead this project Technical research addendumSigned Incidence Two-Bit Addendum
When do two simultaneous Boolean distinctions preserve an order complex, and when can an odd-characteristic test miss an obstruction?
Related manuscript: Signed incidence and a nine-state torsion witness in simultaneous two-bit order thinningRead this project Research draftObservation Refinement
What structural changes occur when a system learns to make a distinction it could not make before?
Related manuscript: Successive Concept Differentiation as Observation RefinementRead this project Technical research addendumObservation Four-Cycle Addendum
Can a single exclusive observation four-cycle create arbitrary integral torsion when its local link homology is torsion-free?
Related manuscript: Integral secondary maps in an observation four-cycleRead this project Research noteHierarchical Concepts
How does limited observation turn a fine-grained hierarchy into coarser, usable concepts?
Related manuscript: Hierarchical Concepts Under Finite Resolution: Observation Quotients and Adaptive SymmetryRead this project Research branchMeasurement and RF-IDENT
Can an observer identify every state using only the tests it has, while keeping each step admissible?
Read this project Technical reportObservable Answers and Executable Queries
Can an observer obtain the answer it needs through the tests it can actually perform?
Related manuscript: From Observable Answers to Executable Queries for CM/LM ProgramsRead this project Technical noteFinite-memory adaptive tracking
How much acquired information survives compression when the target itself can change?
Related manuscript: Acquisition, Forgetting, and Target Change: Information Accounting for Adaptive SystemsRead this project Technical noteRestricted noisy experiments
Can a predictive capability be acquired through the experiments an interface actually permits?
Related manuscript: Acquiring a Predictive Capability through Restricted Noisy Experiments Exact frontiers and certified asymmetric irreversible acquisitionRead this project Technical noteHidden reference aging
When does a calibrated reference become too stale to support reliable diagnosis?
Related manuscript: When a Reference Goes Stale: Self-Diagnosis under Shared Sensor DriftRead this project Technical noteAdaptive bit acquisition and memory
When does adaptive probing help, and what storage does an executable controller really use?
Related manuscript: Memory–Prediction Tradeoffs for a Shared Binary Mechanism: Noisy Random Access, Adaptive Sampling, and Executable State CostsRead this project Methods companionObservation order and recovery
What extra operational assumptions are needed before an observation order can say anything about recovery?
Related manuscript: What Observation Topology Does Not Determine Operational counterexamples, constrained invariance, and bounded recovery synthesisRead this projectOrganize
Organize relationships
Structure can be studied through hierarchy, topology, homology, composition, and factorization.
CM Structural Decomposition
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Exact Boolean Decomposition Artifacts under Conditioning: Algebraic Contracts and a Reproducibility AuditRead this project Research programmeLogical Homology
Which structural features of a logical space persist when its relationships change?
Read this project Research collection and working noteStructured Boolean Factorization
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Structured Boolean FactorizationRead this project Methods companionPaid audits and repeated revision
When does the task benefit of splitting or merging a representation justify paying for evidence and revision?
Related manuscript: When to Split and When to Merge Task-driven observation concepts with paid audits and repeated revisionRead this project Methods companionRisk-constrained solver selection
When do learning, verification and fallback make a solver policy worth trusting and paying for?
Related manuscript: Learning Which Computations to Trust: Audited Solver Choice, Fallible Verification, and DriftRead this projectBecome
Model change and reflection
Finite reports connect permitted sensing to prediction, characterize recoverable information under admitted replacement, and study evidence use in a changing-actuator pilot. Continuous change and subjective awareness remain open questions.
Evolutionary CM/LM Proof Pilot
Which distinctions and conclusions survive the stated mathematical, observational and resource contracts?
Related manuscript: Evolutionary CM/LM Proof Pilot: Compatibility, Closure, and Sharp Robustness BoundsRead this project Technical reportAcquirable Predictive Models
Can a system obtain the distinctions it needs to predict future outputs, using only the tests it is allowed to perform?
Related manuscript: From Observable States to Acquirable Predictive ModelsRead this project Completed bounded resultBinary Information Bounds
Once probabilities and support constraints are declared, exactly how much mutual information can two binary variables share?
Related manuscript: The MIND: Five Finite Constructions — P2 mathematical addendumRead this project Technical addendumContinuous Acquisition Timing
When can waiting make a fixed sensor useful before a mandatory prediction deadline?
Related manuscript: When Delayed Threshold Sensing Cannot Help: An Exact Scalar Acquisition-Timing AddendumRead this project Research synthesisRecoverable Memory Under Replacement
Which old distinctions remain exactly recoverable after an admitted endomorphic replacement, and what trusted record is needed when the replacement is hidden?
Related manuscript: Recoverable Memory Under Finite-State Endomorphic Replacement: Universal Permutation Quotients and Trusted Replacement RecordsRead this project Supporting technical addendumSequential Certificate Risk
How can a noisy observation policy track the remaining risk that its declared carriers will exclude the true state?
Related manuscript: Sequential Certificate Risk for Declared RF Carriers: A finite-horizon technical addendumRead this project Explanatory appendixShared Clocks and Historical Targets
When do time-stamped reports admit one history, and what can paid archive access reveal after the current state has reset?
Related manuscript: Shared Clocks and Historical TargetsRead this project Proposed directionEvolutionary Logic
When does a continuously changing system acquire a different observable logical state?
Read this project Mathematical synthesis noteFinite-Jet Sign Rigidity
Which Boolean distinctions can be realized as signs of functions with specified regularity?
Related manuscript: Finite-Jet Sign Rigidity on Hyperplane Arrangements and Denjoy–Carleman RealizationRead this project Focused research noteParabolic Switching and Terminal Margins
How does the timing of interventions affect the observable margin near a parabolic critical branch?
Related manuscript: Terminal response and worst-case bounded-run switching near a parabolic critical branchRead this project Research preprintProtective Switching in Ordinal-Sum Systems
When does switching preserve a positive observation margin, and which admissible schedule makes that margin smallest?
Related manuscript: Protective Switching and Sharp Observation Margins in a Two-Node Ordinal-Sum SystemRead this project Foundations technical reportCausal Self-Diagnosis
Which cause distinctions can permitted noisy experiments acquire while preserving a declared recovery task?
Related manuscript: Causal Self-Diagnosis with Noisy Tests: Observation Laws, Irreversible Access, and Task RecoveryRead this project Proposed directionInformation and Boundaries
Which observations across a boundary help a system maintain and revise an internal model?
Read this project Finite-state pilotReflective Self-Models
When does tracking a changing part of a system's own machinery help, and does an explicit self-model add anything?
Related manuscript: When Does an Explicit Self-Model Help? Calibration and Control under Internal Change in a Finite-State PilotRead this project Technical addendumWhen Checking Takes Time
When can a check that is harmful alone be useful as the first step of a contingent plan?
Related manuscript: When Checking Takes Time: An Exact Two-Probe Stopping FrontierRead this project Internally AI-reviewed technical addendumFinite Noisy Audits
How much do noisy cross-context observations reveal when the baseline must also be learned, and how much memory do the required answers cost?
Related manuscript: Finite Noisy Audits with Learned Baselines: Exact risk, interface-dependent memory, and a matched compiled controllerRead this project Working noteFixed-Memory Comparison
At a fixed number of persistent memory states, does an explicitly organized actuator model help across new actuator changes?
Related manuscript: Explicit and compiled actuator trackers under a fixed memory budget: An exact finite comparison under a contract frozen in advanceRead this project Technical addendumSensor Decisions and Paid Calibration
How much paid calibration is needed before an imperfect sensor system can certify its coverage, accepted error and sensing cost?
Related manuscript: Sensor Decisions under Unknown Dependence: Interval Frontiers and Paid CalibrationRead this project Companion working manuscriptDiagnosing While Repairing
Can a system restore its components while preserving enough evidence to identify its original fault?
Related manuscript: Diagnosing While Repairing: Information Loss, Adaptive Order, and Noisy ReadoutsRead this project Technical noteKnown erasure and calibration
Can diagnostic activity remain reliable when sensing and repair consume the resources needed to continue?
Related manuscript: Maintaining the Means of Knowing: Recurrent Diagnostic Capacity with Exact and Erasure-Prone CalibrationRead this project Methods companionFinite battery and prediction
What does a specified driven physical memory spend to track, detect failure and repair itself?
Related manuscript: Driven Binary Memory with Failure Detection and Fuelled RepairRead this projectThe idea in miniature
Change the available observations
In this simple example, a new test splits a group of states that previously looked the same.
Four cards. Two possible tests.
You can see all four cards below. The observer can only read the properties you enable.
Each card is written AB: A is colour (0 = teal, 1 = gold); B is shape (0 = circle, 1 = square). So 01 is a teal square.
Before you change a test: predict which cards will still look the same to the observer.
From four cards to questions about a system’s own observations and limits.
Watch larger, with chapters and transcript2 observable groups. The observer knows the colour, but cannot tell a circle from a square.
Teal (A = 0)
00Teal circle01Teal square
Gold (A = 1)
10Gold circle11Gold square
What changed? The cards stay fixed; what changes is which cards the observer can distinguish. Adding a test can split a group. It cannot merge groups the observer could already tell apart.
The mathematics behind the example
1 bit of uncertainty remains about the full state: one more yes/no answer identifies the card.
This toy model treats all four cards as equally likely. The uncertainty is Shannon conditional entropy about the full state given the selected observations. It is not a measure of consciousness.
The groups here use complete yes/no records. The ProLT explanation also studies a different construction, where only positive answers count as observations.
Research status
Results, tools, and open questions
A manuscript establishes only its stated mathematical results. The proposed links to cognition and self-awareness remain questions for further modeling and empirical work.
Read the paper guide
