{"schema_version":"ocme-site-results-v1","locale":"zh-Hant","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-at-most-countable-set"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-at-most-countable-set-01","title":{"zh-Hant":"三條自然數列的全稱編碼","en":"A universal code for three natural-number tracks"},"summary":{"zh-Hant":"N₀×{0,1,2}以c(n,j)=3n+j單射到N₀，故至多可數。","en":"N0 times {0,1,2} injects into N0 by c(n,j)=3n+j and is at most countable."},"mko_ids":["mko-at-most-countable-set"]}],"title":"概念推導導讀"}