Reverse mathematics, countable and uncountable: a computational approach
Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove them. Its setting is countable mathematics and subsystems of second order arithmetic. We present a similar analysis based on (recursion-theoretic) computation...
Uložené v:
| Vydané v: | Effective Mathematics of the Uncountable Ročník Series Number 41; s. 150 - 163 |
|---|---|
| Hlavný autor: | |
| Médium: | Kapitola |
| Jazyk: | English |
| Vydavateľské údaje: |
United States
Cambridge University Press
31.10.2013
|
| Predmet: | |
| ISBN: | 1107014514, 9781107014510 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove them. Its setting is countable mathematics and subsystems of second order arithmetic. We present a similar analysis based on (recursion-theoretic) computational complexity instead. In the countable case, this view is implicit in many of results in the area. By making it explicit and precise, we provide an alternate approach to this type of analysis for countable mathematics. It may be more intelligible to some mathematicians in that it replaces logic and proof systems with relative computability. In the uncountable case, second order arithmetic and its proof theory is insufficient for the desired analysis. Our computational approach, however, supplies a ready made paradigm for similar analyses. It can be implemented with any appropriate notion of computation on uncountable sets.§1. Introduction. The enterprise of calibrating the strength of theorems of classical mathematics in terms of the (set existence) axioms needed to prove them, was begun by Harvey Friedman in the 1970s (as in [6] and [7]). It is now called Reverse Mathematics as, to prove that some set of axioms is actually necessary to establish a given theorem, one reverses the standard paradigm by proving that the axioms follow from the theorem (in some weak base theory). The original motivations for the subject were foundational and philosophical. It has become a remarkably fruitful and successful endeavor supplying a framework for both the philosophical questions about existence assumptions and foundational or mathematical ones about construction techniques needed to actually produce the objects that the theorems assert exist. |
|---|---|
| AbstractList | Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove them. Its setting is countable mathematics and subsystems of second order arithmetic. We present a similar analysis based on (recursion-theoretic) computational complexity instead. In the countable case, this view is implicit in many of results in the area. By making it explicit and precise, we provide an alternate approach to this type of analysis for countable mathematics. It may be more intelligible to some mathematicians in that it replaces logic and proof systems with relative computability. In the uncountable case, second order arithmetic and its proof theory is insufficient for the desired analysis. Our computational approach, however, supplies a ready made paradigm for similar analyses. It can be implemented with any appropriate notion of computation on uncountable sets.§1. Introduction. The enterprise of calibrating the strength of theorems of classical mathematics in terms of the (set existence) axioms needed to prove them, was begun by Harvey Friedman in the 1970s (as in [6] and [7]). It is now called Reverse Mathematics as, to prove that some set of axioms is actually necessary to establish a given theorem, one reverses the standard paradigm by proving that the axioms follow from the theorem (in some weak base theory). The original motivations for the subject were foundational and philosophical. It has become a remarkably fruitful and successful endeavor supplying a framework for both the philosophical questions about existence assumptions and foundational or mathematical ones about construction techniques needed to actually produce the objects that the theorems assert exist. |
| Author | Shore, Richard A. |
| Author_xml | – sequence: 1 givenname: Richard A. surname: Shore fullname: Shore, Richard A. |
| BookMark | eNqNUMlOwzAQNWIRpfQPOOQDaJmJl9pwKhVQpEqVEJwjx5nQQhKHLIjPx6IIqXDhMk-zvPdm5oQdVL4ixs4QJgg4vZhfr8xUI3IDsZYmngCYPTbaqe2zE0SYAgqJ4ogNtFJCgAZ9zEZt-wIAiFIZrgds8UDv1LQUlbZbUwgb155HzvdVZ9OCIltlUV_95JeRDc2y7rsw6StbRLauG2_d-pQd5rZoafSNQ_Z0e_M4X4yXq7v7-Ww5digFjA1yZzjmmjKp8jzmCkkYcpmyxnGKgXgYQyUxRSWkSLVEcqSzNMtMbCwfMr7VDbZvPbVdQqn3r46qrrGFW9u6C_ckwYwrMAETVBBYsy3L2TJtNtkzJc43X8w22fld8lEWye8nz8JGQePqj0bq_8v-BI9rfsg |
| ContentType | Book Chapter |
| Copyright | Symbolic Logic 2013 |
| Copyright_xml | – notice: Symbolic Logic 2013 |
| DBID | FFUUA |
| DEWEY | 511.352 |
| DOI | 10.1017/CBO9781139028592.009 |
| DatabaseName | ProQuest Ebook Central - Book Chapters - Demo use only |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISBN | 9781139028592 1139028596 9781107503496 1107503493 |
| Editor | Hirschfeldt, Denis Greenberg, Noam Hamkins, Joel David Miller, Russell |
| Editor_xml | – sequence: 1 fullname: Greenberg, Noam – sequence: 2 fullname: Hamkins, Joel David – sequence: 3 fullname: Miller, Russell – sequence: 4 fullname: Hirschfeldt, Denis |
| EndPage | 163 |
| ExternalDocumentID | EBC1543609_15_160 9781139028592_xml_CBO9781139028592A016 |
| GroupedDBID | -G2 -VX 38. A4J AAAAZ AABBV AAHFW ABARN ABESS ABMFC ABMRC ABWAU ABZUC ACCTN ACLGV ACNOG ADCGF ADQZK ADVEM AEDFS AERYV AEWAL AEWQY AFQOZ AHAWV AHWGJ AIAQS AIXPE AJFER AJXXZ ALMA_UNASSIGNED_HOLDINGS AMJDZ ANGWU ASYWF AZZ BBABE BFIBU BOIVQ BPBUR COBLI COXPH CYGLA CZZ DUGUG EBSCA EBZNK ECOWB FH2 FVPQW GEOUK ICERG MYL OLDIN OTBUH OZASK OZBHS PP- PQQKQ S36 SACVX SN- SUPCW XI1 ZXKUE ABQPQ FFUUA |
| ID | FETCH-LOGICAL-c1540-913c931f8ed56ff2361e49ecd6a9c3e20e35401651b16454b851ece8dbdd929a3 |
| ISBN | 1107014514 9781107014510 |
| IngestDate | Wed May 28 23:27:04 EDT 2025 Fri Feb 21 01:52:56 EST 2025 Wed Jul 30 03:57:25 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum | QA9.59.E34 2013eb |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1540-913c931f8ed56ff2361e49ecd6a9c3e20e35401651b16454b851ece8dbdd929a3 |
| OCLC | 866440808 |
| PQID | EBC1543609_15_160 |
| PageCount | 14 |
| ParticipantIDs | proquest_ebookcentralchapters_1543609_15_160 cambridge_corebooks_9781139028592_xml_CBO9781139028592A016 cambridge_cbo_9781139028592_xml_CBO9781139028592A016 |
| PublicationCentury | 2000 |
| PublicationDate | 20131031 2013 |
| PublicationDateYYYYMMDD | 2013-10-31 2013-01-01 |
| PublicationDate_xml | – month: 10 year: 2013 text: 20131031 day: 31 |
| PublicationDecade | 2010 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Effective Mathematics of the Uncountable |
| PublicationYear | 2013 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| SSID | ssj0001156938 |
| Score | 1.4250158 |
| Snippet | Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove them. Its setting... |
| SourceID | proquest cambridge |
| SourceType | Publisher |
| StartPage | 150 |
| SubjectTerms | Mathematical logic Mathematical theory of computation |
| Title | Reverse mathematics, countable and uncountable: a computational approach |
| URI | http://dx.doi.org/10.1017/CBO9781139028592.009 https://doi.org/10.1017/CBO9781139028592.009?locatt=mode:legacy http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=1543609&ppg=160 |
| Volume | Series Number 41 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELYK7aFw6YOqQIt86K2kjeM8bG4ULV2pFVQVK3GL_IpYqc1WBND-fMaOnfXu9kCReslGUTwa-XPG49mZbxD6AHu6YSJXCRGsTHIt0kTm1hhWmuVclI3irlD4e3V2xi4v-Q_fOLFz7QSqtmXzOf_zX6GGZwC2LZ39B7gHofAA7gF0uALscF3xiJdjr9MFGfHUdRQKfKxdyAOYtK4zhC2WGgIrVz7P1hfYfzz-FC-in8Zmbdgc10GYfXkQ4_56uF2I7UunlesUEaKMgbU8ji8QGhnmcMy0Z0TX0jeNTB3pCWP9rkl6M7VmkHsWp5Mv504MtVwxBbccqXyxAQ1pgUvv1PPfv-rVgcfgoW6gjaoCk_b06-h88m0RUIOTKKfMdYPy6uae02tQP9ROkurz31SK-TXW9mbncFy8QNu2CAXb6hBQ_SV6YtpXaCvC9DUae3BwBM4hHqDAAA2OoDnCAi8BgwMwO2hyOro4GSe-L0aiiM1j4YQqTknDjC7KprH0OSbnRulScEVNlhobzCNlQSSxhG0SvGqjDNNSa_CGBX2DNttZa94iLGTGtJBaigqsuWyYziqT0kxlhWJSFrsoH2akVnJWPwyiXXQUDYOFbD-I7sGDD8PM126gT1NW_ZR3NUwCLVMOvzUp073HqbiPnofVTrJ3aPPm-ta8R8_U3c20uz7wi-sebd5vSQ |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Effective+Mathematics+of+the+Uncountable&rft.au=Shore%2C+Richard+A.&rft.atitle=Reverse+mathematics%2C+countable+and+uncountable%3A+a+computational+approach&rft.date=2013-10-31&rft.isbn=9781107014510&rft.spage=150&rft.epage=163&rft_id=info:doi/10.1017%2FCBO9781139028592.009&rft.externalDocID=9781139028592_xml_CBO9781139028592A016 |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fassets.cambridge.org%2F97811070%2F14510%2Fcover%2F9781107014510.jpg |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F1543609-l.jpg |