IndisputableMonolith.RRF.Foundation.Consciousness
The Consciousness module defines ProofState as a temporal structure with mutually disjoint past, present, and future sets, plus supporting predicates for recognition and consistency. Researchers building the Reality Recognition Framework axioms would cite it when formalizing consciousness invariants. The module supplies definitions and invariants with no derivations or tactic sequences.
claimProofState is a triple of sets $(past, present, future)$ satisfying the invariant $past, present, future$ are pairwise disjoint: $past ∩ present = ∅$, $past ∩ future = ∅$, $present ∩ future = ∅$.
background
The module sits inside the RRF Foundation layer, whose parent document states it contains the MetaPrinciple axiom, constants derived from φ, and the Ledger for double-entry bookkeeping and conservation. It introduces ProofState to capture the temporal structure of recognition, with the explicit invariant that past, present, and future remain mutually disjoint. Sibling definitions include recognize, isConsistent, validMoves, H_FreeWillExists, determinism_constraint, QualiaState, and TimeArrow, all expressed using sets from Mathlib.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
The module supplies the consciousness primitives imported by the parent RRF Foundation module, whose document lists MetaPrinciple, Constants, and Ledger as its core contents. It fills the temporal-disjointness requirement needed for the framework's recognition and free-will hypotheses.
scope and limits
- Does not prove existence of free will.
- Does not derive physical constants or the phi ladder.
- Does not equip the sets with metric or ordering structure.
- Does not connect to the eight-tick octave or D=3.
- Limits all claims to the listed sibling definitions.
used by (1)
declarations in this module (18)
-
structure
ProofState -
def
recognize -
def
isConsistent -
def
validMoves -
def
H_FreeWillExists -
theorem
free_will_exists -
theorem
determinism_constraint -
structure
QualiaState -
theorem
pain_is_high_strain -
theorem
pleasure_is_low_strain -
theorem
valence_strain_opposite -
structure
TimeArrow -
def
present_is_boundary -
theorem
proofstate_has_boundary -
structure
NavigationPoint -
theorem
navigation_requires_choice -
structure
HardProblemDissolution -
theorem
hard_problem_dissolution_consistent