[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-86344-en":3,"doc-seo-86344-105":30,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":13,"seo_description":14,"update_tm":28,"read_time":29},86344,1099513958607,"Jiven","https://ap-avatar.wpscdn.com/avatar/100002390cf8733938c?x-image-process=image/resize,m_fixed,w_180,h_180&k=1778829742770036399",8,"Research & Report","Countability versus Computability","Countability versus Computability investigates the relationship between Cantor’s notion of countable sets and the later emergence of computable sets from Godel, Church, and Turing. It defines counting bijections and introduces enumerable sets via computable counting bijections. The work proves key equivalences: a set is enumerable iff it is computable, and a set is countable iff it admits a counting order. It further characterizes increasing counting bijections through first-order arithmetic definability, yielding implications that challenge a standard countability argument.","arXiv :2406 .08493v2 [ cs .CC] 10 Jul 2026  \nCountability versus Computability  \nHantao Zhang  \nDepartment of Computer Science  \nThe University of Iowa  \nIowa City, Iowa, USA  \n[hantao-zhang@uiowa.edu](hantao-zhang@uiowa.edu)  \nJuly 10, 2026  \nAbstract  \nThe concept of countable sets is attributed to Georg Cantor, who established the distinction between countable and uncountable sets in 1874 . The concept of computable sets emerged in the 1930s through the foundational work on computing models by G¨odel, Church, and Turing. In this paper, we investigate the connection between countability and computability. A counting bijection of a set S is a bijection from theset of natural numbers to S. We say S is enumerable if it is either finite or admitting a computable counting bijection. Our initial investigation shows that a set S is enumerable if and only if it is computable. This equivalence offers new insights into set theory and computability theory.  \nWe further show that a set is countable if and only if it admits a counting order, which is a well order satisfying the proximal property. Based on this concept, we provide a procedure whose existence gives a necessary and sufficient condition for a set to be countable. This procedure is an algorithm if and only if the set is computable. A counting bijection f is increasing if f(x) > f (y) whenever x > y. We prove that an infinite set S of natural numbers is definable in first-order arithmetic if and only if S has an increasing counting bijection. This result has a significant implication:  \nthe standard proof that every set S of natural numbers is countable is invalid. This is because the existing proof establishes that S has an increasing counting bijection, which (by our result) would imply that S is definable in first-order arithmetic. This leads to a contradiction with Tarski’s undefinability theorem when S is the set of G¨odel numbers of the true arithmetic sentences.  \n1 Introduction  \nIn 1874, Georg Cantor [1] published the first proof that there is no one-to-one correspondence between the set of all real numbers (which is uncountable) and the set of all natural numbers (which is countable) . In 1891, Cantor simplified his proof using the well-known diagonal argument, which has since found important applications in both set theory and computability theory [11] .  \nIn the 1930s, several independent attempts were made to formalize the notion of computability: Kurt G¨odel’s partial recursive functions [6], Alonzo Church’s lambda calculus [2], and Turing’s formal model, later known as Turing machines [17] . Church and Turing proved that these three notions of computable functions coincide and proposed the wellknown conjecture called the Church–Turing thesis: a function is computable if it is Turing computable [3] . Other formal attempts to characterize computability, including Kleene’s recursion theory [9] and von Neumann’s random-access stored-programs (RASP) models, have further strengthened this view. Since we cannot exhaust all possible computing models, the Church–Turing thesis—though enjoying near-universal acceptance—cannot be formally proved.  \nNine decades have passed, yet it remains puzzling that the deep connection between countability and computability has not been fully investigated. To facilitate the presentation of our investigation, we first review some key concepts. Following Cantor, a set S is countable if either S is finite or there exists a bijection f : N 7→ S, where N is the set of natural numbers [1] . From now on, we refer to any such bijection f : N 7→ S as a counting bijection of S. We say S is countably infinite if it admits a counting bijection. A set S is enumerable if it is either finite or admits a computable counting bijection. Finally, S is increasingly countable if S ⊆ N and it admits an increasing counting bijection f (i.e. , f (x) > f (y) whenever x > y) .  \nOur investigation of the connection between countability and computability has focuse","cbCaikGOE67lgNcg","https://ap.wps.com/l/cbCaikGOE67lgNcg","pdf",253795,2,1,13,"English","en",105,"# Abstract\n# Introduction\n## Countable, enumerable, and increasingly countable sets\n## Recognizable and decidable languages\n## Proximal orders and counting orders\n## Definability in first-order arithmetic\n# Main implications and revised arguments","[{\"question\":\"How does the paper define countable, enumerable, and increasingly countable sets?\",\"answer\":\"A set is countable if it is finite or admits a bijection from the natural numbers to the set. It is enumerable if it is finite or admits a computable counting bijection. For increasingly countable sets (subsets of natural numbers), it must admit an increasing counting bijection.\"},{\"question\":\"What main equivalence does the paper establish between countability-related notions and computability?\",\"answer\":\"The initial investigation shows that a set S is enumerable if and only if it is computable. It also ties countability to structural order properties via counting orders.\"},{\"question\":\"What is the significance of increasing counting bijections for first-order arithmetic?\",\"answer\":\"The paper proves that an infinite set of natural numbers is definable in first-order arithmetic iff it has an increasing counting bijection. This leads to an implication that the standard proof every subset of N is countable is invalid under the paper’s strengthened assumptions.\"}]",1784210696,33,{"code":4,"msg":31,"data":32},"ok",{"site_id":25,"language":24,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":28},"countability-versus-computability","",{"@graph":36,"@context":85},[37,53,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,47,50],{"item":41,"name":42,"@type":43,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":20},"https://docshare.wps.com/document/","Document",{"item":48,"name":12,"@type":43,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":43,"position":52},"https://docshare.wps.com/document/countability-versus-computability/86344/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":24,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":41,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-25","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"How does the paper define countable, enumerable, and increasingly countable sets?","Question",{"text":75,"@type":76},"A set is countable if it is finite or admits a bijection from the natural numbers to the set. It is enumerable if it is finite or admits a computable counting bijection. For increasingly countable sets (subsets of natural numbers), it must admit an increasing counting bijection.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"What main equivalence does the paper establish between countability-related notions and computability?",{"text":80,"@type":76},"The initial investigation shows that a set S is enumerable if and only if it is computable. It also ties countability to structural order properties via counting orders.",{"name":82,"@type":73,"acceptedAnswer":83},"What is the significance of increasing counting bijections for first-order arithmetic?",{"text":84,"@type":76},"The paper proves that an infinite set of natural numbers is definable in first-order arithmetic iff it has an increasing counting bijection. This leads to an implication that the standard proof every subset of N is countable is invalid under the paper’s strengthened assumptions.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":25},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":21,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":20,"doc_module":4,"doc_module_name":46,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":46,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":46,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":46,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":46,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":46,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":46,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":46,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]