pith. machine review for the scientific record. sign in
theorem

hardProblemStance_count

proved
show as:
view math explainer →
module
IndisputableMonolith.Philosophy.HardProblemOfConsciousnessFromRS
domain
Philosophy
line
29 · github
papers citing
none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Philosophy.HardProblemOfConsciousnessFromRS on GitHub at line 29.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

  26  | panpsychismNeutralMonism
  27  deriving DecidableEq, Repr, BEq, Fintype
  28
  29theorem hardProblemStance_count :
  30    Fintype.card HardProblemStance = 5 := by decide
  31
  32structure HardProblemCert where
  33  five_stances : Fintype.card HardProblemStance = 5
  34
  35def hardProblemCert : HardProblemCert where
  36  five_stances := hardProblemStance_count
  37
  38end IndisputableMonolith.Philosophy.HardProblemOfConsciousnessFromRS

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.