Knowledge map
How the projects, papers, concepts and videos connect
Start from a phase, project or key concept. Selecting a point shows where to read or watch it and unfolds the finer ideas, results and lessons beneath it. Links show conceptual and navigational connections; they do not mean one paper proves another.
Browse the map as a list
Projects
- Acquirable Predictive Models
- Adaptive bit acquisition and memory
- Algebraic Logic
- Binary Information Bounds
- Binary Order Thinning
- Boolean CM Phase Algebra
- Causal Self-Diagnosis
- Chain-Ring Contextuality
- Chain-Ring Process Semantics
- Characteristic-Two Query Bounds
- CM Compiler Computation
- CM Model Correctness Audit
- CM Structural Decomposition
- Continuous Acquisition Timing
- Correspondence Matrices
- Diagnosing While Repairing
- Evolutionary CM/LM Proof Pilot
- Evolutionary Logic
- Finite battery and prediction
- Finite Noisy Audits
- Finite-Jet Sign Rigidity
- Finite-memory adaptive tracking
- Fixed-Memory Comparison
- General Observation Refinement
- Guarded Boolean Dispatch
- Hidden reference aging
- Hierarchical Concepts
- Information and Boundaries
- Known erasure and calibration
- LM–Modal Bridge
- Logical Homology
- Measurement and RF-IDENT
- Observable Answers and Executable Queries
- Observation Four-Cycle Addendum
- Observation order and recovery
- Observation Refinement
- Paid audits and repeated revision
- Parabolic Switching and Terminal Margins
- ProLT Observation Topologies
- Protective Switching in Ordinal-Sum Systems
- Recoverable Memory Under Replacement
- Recoverable representation migration
- Reflective Self-Models
- Restricted noisy experiments
- Risk-constrained solver selection
- Sensor Decisions and Paid Calibration
- Sequential Certificate Risk
- Shared Clocks and Historical Targets
- Signed and Integral CM Lifts
- Signed Incidence Two-Bit Addendum
- Structured Boolean Factorization
- When Checking Takes Time
Manuscripts
- Acquiring a Predictive Capability through Restricted Noisy Experiments Exact frontiers and certified asymmetric irreversible acquisition
- Acquisition, Forgetting, and Target Change: Information Accounting for Adaptive Systems
- Binary Order Thinning of Finite Posets: Homology, Collapses, and Sharp Limits
- Boolean CM Phase Algebra: Native Operations, Tags, and Readout
- Causal Self-Diagnosis with Noisy Tests: Observation Laws, Irreversible Access, and Task Recovery
- Contextuality and Exact Information Resources over Finite Chain Rings
- Correctness Audit of Boolean CM Modal Models
- Correspondence and Logical Matrices: A Typed Boolean Operator Calculus
- Diagnosing While Repairing: Information Loss, Adaptive Order, and Noisy Readouts
- Does the Symbolic LM Calculus Canonically Induce the Modal Measurement Theory?
- Driven Binary Memory with Failure Detection and Fuelled Repair
- Evolutionary CM/LM Proof Pilot: Compatibility, Closure, and Sharp Robustness Bounds
- Exact Bernstein–Vazirani Query Complexity in Characteristic-Two Modal Computation
- Exact Boolean Decomposition Artifacts under Conditioning: Algebraic Contracts and a Reproducibility Audit
- Explicit and compiled actuator trackers under a fixed memory budget: An exact finite comparison under a contract frozen in advance
- Finite Noisy Audits with Learned Baselines: Exact risk, interface-dependent memory, and a matched compiled controller
- Finite-Jet Sign Rigidity on Hyperplane Arrangements and Denjoy–Carleman Realization
- From Observable Answers to Executable Queries for CM/LM Programs
- From Observable States to Acquirable Predictive Models
- Guarded Boolean Operators: Exact Dispatch and a Polynomial Guard-Degree Tradeoff
- Hierarchical Concepts Under Finite Resolution: Observation Quotients and Adaptive Symmetry
- Integral secondary maps in an observation four-cycle
- Learning Which Computations to Trust: Audited Solver Choice, Fallible Verification, and Drift
- Maintaining the Means of Knowing: Recurrent Diagnostic Capacity with Exact and Erasure-Prone Calibration
- Memory–Prediction Tradeoffs for a Shared Binary Mechanism: Noisy Random Access, Adaptive Sampling, and Executable State Costs
- Observation Refinement Beyond a Fixed Carrier, with Constrained Observation Design
- Observation Topologies for Finite Propositional Semantics: Distinguishability, Distance, and Inference
- Operator-Level Boolean Computation with Correspondence Matrices
- Preserving Declared Capabilities Across Representation Replacement: Executable Decoders, Adversarial Migration, and Trajectory Audits
- Process Closure and Restricted Conversion in a Chain-Ring Modal Model
- Protective Switching and Sharp Observation Margins in a Two-Node Ordinal-Sum System
- Recoverable Memory Under Finite-State Endomorphic Replacement: Universal Permutation Quotients and Trusted Replacement Records
- RF-IDENT on bounded posets of height at most two
- Sensor Decisions under Unknown Dependence: Interval Frontiers and Paid Calibration
- Sequential Certificate Risk for Declared RF Carriers: A finite-horizon technical addendum
- Shared Clocks and Historical Targets
- Signed and Integral Lifts of Correspondence Matrices
- Signed incidence and a nine-state torsion witness in simultaneous two-bit order thinning
- Structured Boolean Factorization
- Successive Concept Differentiation as Observation Refinement
- Terminal response and worst-case bounded-run switching near a parabolic critical branch
- The MIND: Five Finite Constructions — P2 mathematical addendum
- What Observation Topology Does Not Determine Operational counterexamples, constrained invariance, and bounded recovery synthesis
- When a Reference Goes Stale: Self-Diagnosis under Shared Sensor Drift
- When Checking Takes Time: An Exact Two-Probe Stopping Frontier
- When Delayed Threshold Sensing Cannot Help: An Exact Scalar Acquisition-Timing Addendum
- When Does an Explicit Self-Model Help? Calibration and Control under Internal Change in a Finite-State Pilot
- When to Split and When to Merge Task-driven observation concepts with paid audits and repeated revision
Concepts
- Acquiring distinctions with permitted tests · formal
- A historical target with a specified archive-access contract · formal
- Alternating observations and actions · formal
- Exact minimax frontier with a forbidden exact probe · formal
- Executable minimax certificates without symmetry · formal
- Identical transcripts bound prediction risk · formal
- Observation-law oracle and attainable decisions · formal
- Record compatibility under shared clocks · formal
- Reportable targets and the finest transcript partition · formal
- Adaptive versus fixed-order testing · formal
- Admissible (repair-safe) queries · formal
- Charging the first exclusion of the true state · formal
- Enlarging a carrier can break a later risk bound · formal
- Finite-history conditional-risk program and exact benchmarks · formal
- Local RF admissibility · formal
- Repair-safe identification on two-ended antichains · formal
- Separating states at the start is not enough · formal
- Being and Becoming · interpretive
- Boolean modules and logical state vectors · proposed
- Boolean normal forms and parity · formal
- Boolean readout of a continuous system and its margin · formal
- A two-node system with no finite Boolean quotient · formal
- Critical boundary and a sufficient range for protective switching · formal
- Delayed-intervention margin and the exact bounded-run optimizer · formal
- Finite-jet rigidity of sign patterns · formal
- Regularity and degree needed away from the walls · formal
- Sharp cubic margin laws and worst schedules · formal
- Sharp margin over all formulas and feedback networks · formal
- Terminal response near a parabolic critical branch · formal
- When a continuous conjunction has an exact Boolean abstraction · formal
- Which Boolean functions a regularity class can realize · formal
- Zero margin outside the sufficient range · formal
- Correspondence and logical matrices · formal
- Boolean superposition of aligned operators · formal
- Certified guards and coordinate probes · formal
- CM-IR — compiled CM programs · computational
- CM applications — policies, configurations and circuits
- Compiler studies with failed utility gates
- Execution strategies for CM programs
- Fair exact comparisons and timing evidence
- Recognition campaigns — advice behind exact checks
- Same-frame fusion of operator tokens
- Sharing, CSE and canonical interning
- Soundness and completeness of the structural compiler fragment
- Correspondence and logical tensors · formal
- Flattenings, block lifts and rank separability · formal
- Guard degree against number of tests · formal
- LM frame normal form and valuation · formal
- Logical pairing · formal
- One-hot states and CM selection · formal
- Operand frames, signed frames and polarity · formal
- Operator chambers of a continuous score model · formal
- XOR–AND algebra and basis decomposition · formal
- Exact binary information bounds · formal
- Exact Boolean factorization · formal
- Bounded factorization search campaigns · computational
- Conditioning and counting on a stored decomposition · formal
- Higher-order four-corner defects · formal
- Rank against prototype dictionaries · formal
- Reproducibility audit of decomposition artifacts · computational
- Vtree cuts and semantic primeness · formal
- What a persistent decomposition must retain · formal
- Executable queries and acquisition cost · formal
- Checking a proposed policy · computational
- Costed conflict covering · formal
- Exact adaptive acquisition recurrences · formal
- Sufficiency can fail to be executable · formal
- Finite-state systems with known dynamics · formal
- Indistinguishability and quotients · formal
- Information exchange across a boundary · proposed
- Local-to-global reconstruction (gluing) · formal
- Descent defects and exact gluing · formal
- Nerves of observation covers · formal
- Observation–refinement descent and cone theorem · formal
- Logic under continuous change · proposed
- Maintaining the means of observation · formal
- Calibration feasibility and matching-order sample bounds · formal
- Conditional versus unconditional calibration cost · formal
- Diagnosis error as a function of reference age · formal
- Epistemic viability kernel · formal
- Exact risk–coverage–cost interval frontier · formal
- Nominal reset error can understate report-time error · formal
- Periodic calibration is optimal among history-dependent policies · formal
- Reliability surcharge when the reference itself can drift · formal
- Routine readings cannot detect shared drift · formal
- Tracking and prediction error of a driven binary memory · formal
- Unlabeled calibration likelihood and sufficiency · formal
- Modal models on the CM rotation algebra · formal
- A closed binary-modal completion · formal
- A possibilistic Bell contradiction without signalling · formal
- Boolean valuation cannot produce chain-ring amplitudes · formal
- CM oracles and phase-path counting · formal
- Conversion between chain-ring resources · formal
- Exact messages and teleportation from a chain-ring resource · formal
- Exact query bounds in characteristic two · formal
- Exact width of nilpotent-tag detectors · formal
- No strong contextuality with two binary settings · formal
- Nonzero amplitudes cannot all be possible · formal
- Signed and integral lifts of CM rotation · formal
- Smith invariants classify contextuality · formal
- The bridge after enriching the scalars · formal
- The native gate algebra of the phase ring · formal
- The rotation algebra and its two-party normal form · formal
- Transfer, activation and no-cloning limits · formal
- Valuation commutes with logical-matrix contraction · formal
- What the four rotations can and cannot represent · formal
- Noisy readouts and error–cost trade-offs · formal
- Observation families and signatures · formal
- Observation refinement · formal
- A useful distinction transfers only with a distribution bound · formal
- Carrier splitting under a new observation · formal
- Distinction complexes · formal
- Every finite shape occurs; homotopy neutrality is undecidable · formal
- Evidence that authorizes a split or merge · formal
- Fibre-profile normal form of a refinement · formal
- Persistence and zigzags of refinement · proposed
- Tests for refinements that leave the shape unchanged · formal
- What merging two concepts costs a task · formal
- When another paid validation query is worth buying · formal
- Observation-generated topology · formal
- An observation order does not fix recovery probabilities · formal
- Continuous maps preserve information order · formal
- Interior, closure and observational boundary · formal
- Observable negation and Heyting implication · formal
- Partitions and complete descriptions · formal
- Redundant recoding changes topology but not task risk · formal
- Signature distances · formal
- Order complexes of finite posets · formal
- Predictive equivalence · formal
- Feasible predictive quotients · formal
- Recoverable registers under replacement · formal
- A self-report is another output
- Auditing a replacement along one trajectory
- Error growth over repeated migrations
- Executable decoders and adversarial migration
- Minimum trusted replacement record
- Observational non-identifiability
- Record needed to preserve capabilities across a replacement
- The universal permutation quotient
- Repair that erases evidence · formal
- Reproducible evidence and correction trails · computational
- Self-model calibration under internal change · formal
- A defect outside the audit · formal
- A SAT study where risk-constrained selection picks the exact solver · computational
- Actual change versus a changing estimate · interpretive
- Bayesian evidence use versus restricted rules · computational
- Choosing which computation to trust · formal
- Compensating for a fault without attributing it · formal
- Drift makes solver calibration stale · formal
- Exact loss at a fixed budget; the no-clock optimum is a saturating counter · computational
- Exact stopping frontier when checking takes time · formal
- Explicit, compiled and external trackers match · formal
- Frozen no-clock designs transfer identically to held-out change processes · computational
- Learning solver reliability from audits · formal
- Memory needed depends on the required interface · formal
- The fixed-memory self-model comparison, performed in one finite model · computational
- Verification can pay off on later tasks · formal
- What a comparison of nested controller classes can show · formal
- What a fixed noisy audit can identify · formal
- When the noise is no larger than the flip rate, two states suffice · formal
- With a free stage index, monotone rounding of a calibrated belief loses nothing · formal
- Symmetry, group actions and quotients · formal
- The MIND — proposed cognitive readings · interpretive
- Truth vectors and truth regions · formal
- What a bounded memory can keep for prediction · formal
- A finite memory forces forgetting · formal
- Acquisition, forgetting and target-change identity · formal
- Adaptive sampling helps at three coordinates, not at two · formal
- Exact synthesis of costly sensing with persistent memory · formal
- Noisy random-access risk identity · formal
- Selective one-bit sensing beats every fixed schedule · formal
- Streaming memory costs more than terminal bits · formal
Videos
- P01 — What a truth table becomes when its labels matter
- P02 — What can a yes-only observer know?
- P03 — When a new distinction removes a connection
- P04 — What changes when an observation becomes finer?
- P05 — Similar is not the same as indistinguishable
- P06 — Can a Boolean whole really be split into parts?
- P07 — Can the tests you are allowed to use support prediction?
- P08 — How much information can two yes-or-no variables share?
- When does a self-model help?
- Why distinctions matter
Courses
- Being and Becoming
10 lessons
- What is a state—and what is a description of a state?
- What can an observer actually distinguish?
- Can two states look the same now but have different futures?
- What information matters for the task?
- How do you choose what to observe next?
- What changes when you act?
- How does a model stay useful through change?
- How does continuous change become a discrete description?
- Can a system model its own changing machinery?
- What have these models explained—and what remains open?
- Correspondence Matrices — Advanced
53 lessons
- Boolean rules and exact decisions
- Expression, table, and function
- A truth function in a matrix layout
- The sixteen two-input operator CMs
- Logical matrices and tensor construction
- A filled grid and a shared program
- Live support and display dimensions
- Choose the required answer
- Repeated work in a raw tree
- Reusing identical subexpressions
- Canonicalization Interning
- Shared nodes and actual reuse
- Flattening without losing sharing
- Identifying a distinct compiler mechanism
- CM-IR Persistence
- Eager and deferred computation
- Packing truth outputs into bits
- Small operator tokens and construction routes
- Choosing materialization boundaries
- Selector Width Limit
- Output cones and semantic support
- Exact policy rewrites and their cost
- Safe reuse when configurations change
- Parallel work and complete request cost
- Instructions, operations, and memory
- When preparation is repaid
- The boundaries of a timing result
- Animation and experimental evidence
- Guards for a fair exact comparison
- The corrected B2/B4 comparison
- What replication adds
- Epfl Parity
- Reading timing ratios and intervals
- Keeping comparison scope explicit
- Why there is no universal winner chart
- Choosing an eligible representation
- Match the tool to the artifact
- Binding a video to its evidence
- Preserving the correction trail
- Advice behind an exact check
- Exact decomposition and learned transfer
- Supervision, ranking, and transfer
- The exact source-ANF core
- Routing, restart, and conversion
- Exact screening and artifact admission
- Policy gates and fixed exact arms
- Matching the best-artifact task
- Fresh sources and host transfer
- Rewrites across complete tasks
- Exact transfer without a runtime win
- The cost of abstaining
- Recognition D10
- Task-aware BDD and SAT advice
- Correspondence Matrices: From Logic to Code
23 lessons
- From truth tables to operator CMs
- Build CMs from four basis matrices
- Calculate a CM measurement
- Derive the paper’s implication example
- Expressions first, values second
- Two logical matrices become a 4×4
- Build and check a four-variable rule
- Find a cell in the repository layout
- Change the layout, keep the function
- Swap operands by transposing a CM
- Negate an input, or negate the output
- Compose and decompose over XOR
- Remove shared features with a CM quotient
- Combine rules with a shared ordered basis
- Complement and factor logical matrices
- Measure with a logical matrix
- Generalize the tensor construction
- Transform and combine larger CMs
- Explicit CM versus the repository’s CM-IR
- Build, query and validate a CM in code
- Packed evaluation, execution choices and output cost
- When preparation pays: a fair comparison
- A small end-to-end access-policy example
- ProLT: Propositional Logic and Topology
37 lessons
- Why give logic a topology?
- Sets: a language for possible states
- Propositional logic and truth tables
- From formulas to truth regions
- Partitions, minterms, and complete descriptions
- What is a distance?
- What is a topology?
- How a few sets generate a topology
- Equivalence and order: two ways to compare states
- Observation signatures: what the interface records
- Building a propositional logical topological space
- Indistinguishable states and the T0 quotient
- One-sided and two-sided observation
- The specialization preorder: preserving positive information
- XOR and weighted Hamming distance
- Why symmetric distance gives a different topology
- Directed distance: the cost of losing observations
- How directed distance recovers the topology
- Interior and closure: what can observations settle?
- Boundary is ambiguity, not XOR
- Better observations: refining the topology
- Learning a premise: restricting the possible worlds
- Inference as inclusion of truth regions
- Modus Ponens and Modus Tollens, one state at a time
- Hypothetical syllogism and eight possible worlds
- Functions, inverse images, and continuity
- Continuous maps preserve the information order
- Observable negation and double negation
- Observable implication and the Heyting rule
- Pullbacks: matching two premises to the same world
- Why the pullback has the induced topology
- One observation table, the whole framework
- What the paper establishes, and what remains open
- Connectedness without geometry
- Compatibility complexes and first homology
- Local contexts and global consistency
- Designing observations for a purpose
Edges are conceptual and navigational links between B-Theory pages, papers, concepts and videos. They are not theorem or proof dependencies. Concepts and lesson tags are hand-curated from the manuscripts, research records and courses; each concept cites where it is stated.

