Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.14021 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911781450940416 |
|---|---|
| author | Sudhir, Abhimanyu Pallavi Tran-Thanh, Long |
| author_facet | Sudhir, Abhimanyu Pallavi Tran-Thanh, Long |
| contents | Prediction markets are useful for estimating probabilities of claims whose truth will be revealed at some fixed time -- this includes questions about the values of real-world events (i.e. statistical uncertainty), and questions about the values of primitive recursive functions (i.e. logical or algorithmic uncertainty). However, they cannot be directly applied to questions without a fixed resolution criterion, and real-world applications of prediction markets to such questions often amount to predicting not whether a sentence is true, but whether it will be proven. Such questions could be represented by countable unions or intersections of more basic events, or as First-Order-Logic sentences on the Arithmetical Hierarchy (or even beyond FOL, as hyperarithmetical sentences). In this paper, we propose an approach to betting on such events via options, or equivalently as bets on the outcome of a "verification-falsification game". Our work thus acts as an alternative to the existing framework of Garrabrant induction for logical uncertainty, and relates to the stance known as constructivism in the philosophy of mathematics; furthermore it has broader implications for philosophy and mathematical logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_14021 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Betting on what is neither verifiable nor falsifiable Sudhir, Abhimanyu Pallavi Tran-Thanh, Long Computer Science and Game Theory Artificial Intelligence Logic in Computer Science 91B26 (Primary), 03F03 (Secondary) F.4.1; I.2.11 Prediction markets are useful for estimating probabilities of claims whose truth will be revealed at some fixed time -- this includes questions about the values of real-world events (i.e. statistical uncertainty), and questions about the values of primitive recursive functions (i.e. logical or algorithmic uncertainty). However, they cannot be directly applied to questions without a fixed resolution criterion, and real-world applications of prediction markets to such questions often amount to predicting not whether a sentence is true, but whether it will be proven. Such questions could be represented by countable unions or intersections of more basic events, or as First-Order-Logic sentences on the Arithmetical Hierarchy (or even beyond FOL, as hyperarithmetical sentences). In this paper, we propose an approach to betting on such events via options, or equivalently as bets on the outcome of a "verification-falsification game". Our work thus acts as an alternative to the existing framework of Garrabrant induction for logical uncertainty, and relates to the stance known as constructivism in the philosophy of mathematics; furthermore it has broader implications for philosophy and mathematical logic. |
| title | Betting on what is neither verifiable nor falsifiable |
| topic | Computer Science and Game Theory Artificial Intelligence Logic in Computer Science 91B26 (Primary), 03F03 (Secondary) F.4.1; I.2.11 |
| url | https://arxiv.org/abs/2402.14021 |