A Unified Representation of Natural-Science Propositional Networks: A Readable and Computable Framework with Three-Axis Constraints on Knowledge Points and 11 Classes of Logical Relations

This paper proposes a unified, readable, and computable representation framework for natural-science knowledge. It defines each knowledge point as a propositional node and assigns three mutually orthogonal labels to every node: abstraction level, evidential status, and historical status. Relations between propositions are represented by 11 logical types, each accompanied by a minimal natural-language explanation and traceable source. The paper also provides standard subgraph templates for induction, hypothesis–deduction–test cycles, prerequisite chains, historical supersession, and theory-to-practice mapping, showing how common reasoning structures in natural-science textbooks and research papers can be encoded in a traceable and structurally verifiable way.