Zbl 1201.03055 ¡ J
Total Page:16
File Type:pdf, Size:1020Kb
Japaridze, Giorgi £ Towards applied theories based on computability logic. (English) ¢Zbl 1201.03055 ¡ J. Symb. Log. 75, No. 2, 565-601 (2010). The paper is a continuation of the author’s Computability Logic program for “developing logic as a formal theory of computability”, opposing the traditional view of logic as a formal theory of truth (or provability). Familiarity with the previous single-authored papers on Computability Logic (CL) from 2003 onward is assumed for reading the paper. Formulas in CL represent computational problems, truth of a formula means existence of an algorithmic solutions, while the proofs encode such solutions. In the present paper, a new deductive system is introduced and its soundness and completeness is proved for the semantics of CL. Also a computability-logic-based arithmetic, as a counterpart of Peano Arithmetic based on CL, is introduced and further developed. Reviewer: Saeed Salehi (Tabriz) MSC: 03F50 Metamathematics of constructive systems Cited in 1 Review 03B70 Logic in computer science Cited in 9 Documents 03F30 First-order arithmetic and fragments Keywords: computability logic; game semantics; Peano arithmetic; constructive logics Full Text: DOI arXiv References: [1] DOI: 10.1093/logcom/exl005 · Zbl 1113.03023 · doi:10.1093/logcom/exl005 [2] DOI: 10.1145/1131313.1131318 · Zbl 1367.03056 · doi:10.1145/1131313.1131318 [3] DOI: 10.1007/3-540-34874-3_9 · Zbl 1266.03046 · doi:10.1007/3-540-34874-39 [4] DOI: 10.1016/S0168-0072(03)00023-X · Zbl 1028.03025 · doi:10.1016/S0168-0072(03)00023-X [5] Introduction to metamathematics (1952) [6] DOI: 10.1007/s11225-009-9164-7 · Zbl 1162.03016 · doi:10.1007/s11225-009-9164-7 [7] Games: Unifying logic, language, and philosophy pp 249– (2009) [8] DOI: 10.1016/j.ic.2008.10.001 · Zbl 1161.03016 · doi:10.1016/j.ic.2008.10.001 [9] DOI: 10.1093/logcom/exn019 · Zbl 1170.03028 · doi:10.1093/logcom/exn019 [10] DOI: 10.1016/j.apal.2007.05.001 · Zbl 1143.03014 · doi:10.1016/j.apal.2007.05.001 [11] The logic of interactive Turing reduction 72 pp 243– (2007) · Zbl 1161.03015 [12] Acta Cybernetica 18 pp 77– (2007) [13] DOI: 10.1016/j.tcs.2007.01.004 · Zbl 1118.03021 · doi:10.1016/j.tcs.2007.01.004 [14] DOI: 10.1145/1131313.1131319 · Zbl 1367.03057 · doi:10.1145/1131313.1131319 [15] DOI: 10.1016/j.tcs.2006.03.014 · Zbl 1094.03019 · doi:10.1016/j.tcs.2006.03.014 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching. Edited by FIZ Karlsruhe, the European Mathematical Society and the Heidelberg Academy of Sciences and Humanities © 2021 FIZ Karlsruhe GmbH Page 1.