| 書目名稱 | Linking Game-Theoretical Approaches with Constructive Type Theory |
| 副標(biāo)題 | Dialogical Strategie |
| 編輯 | Nicolas Clerbout,Shahid Rahman |
| 視頻video | http://file.papertrans.cn/587/586770/586770.mp4 |
| 概述 | Links two of the most dominant research streams in philosophy of logic - game theory and proof theory.Builds a link between the two main theories using the dialogical approach to logic.Focuses on the |
| 叢書名稱 | SpringerBriefs in Philosophy |
| 圖書封面 |  |
| 描述 | This?title links two of the most dominant research streams in philosophy of logic, namely game theory and proof theory. As the work’s subtitle expresses, the authors will build this link by means of the dialogical approach to logic. One important aspect of the present study is that the authors restrict themselves to the logically valid fragment of Constructive Type Theory (CTT). The reason is that, once that fragment is achieved the result can be extended to cover the whole CTT system.?The first chapters in the?brief offer overviews on the two frameworks discussed in the book with an emphasis on the dialogical framework. The third chapter demonstrates the left-to-right direction of the equivalence result. This is followed by a chapter that demonstrates the use of the algorithm in showing how to transform a specific winning strategy into a CCT-demonstration of the axiom of choice. The fifth chapter develops the algorithm from CTT-demonstrations to dialogical strategies. This brief concludes by introducing elements of discussion which are to be developed in subsequent work. |
| 出版日期 | Book 2015 |
| 關(guān)鍵詞 | Axiom of Choice; Constructive Type Theory; Dialogues with Play-Objects; P-strategy out of a CTT demonst |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-319-19063-1 |
| isbn_softcover | 978-3-319-19062-4 |
| isbn_ebook | 978-3-319-19063-1Series ISSN 2211-4548 Series E-ISSN 2211-4556 |
| issn_series | 2211-4548 |
| copyright | The Author(s) 2015 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-7 05:45
發(fā)表于 2025-3-21 19:34:39
