Computability Logic | Giorgi Japaridze, Computability theory, Classical logic, Church-Turing thesis, Conservative extension, Intuitionistic logic, Linear logic, Logic

Frederic P. Miller (u. a.)

ISBN 10: 6130821352 / ISBN 13: 9786130821357

Published by OmniScriptum, 2026

About this Item

Computability Logic | Giorgi Japaridze, Computability theory, Classical logic, Church-Turing thesis, Conservative extension, Intuitionistic logic, Linear logic, Logic | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130821357 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 113248753

Bibliographic Details

• Title: Computability Logic | Giorgi Japaridze, Computability theory, Classical logic, Church-Turing thesis, Conservative extension, Intuitionistic logic, Linear logic, Logic
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6130821352
• ISBN 13: 9786130821357
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 125 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Introduced by Giorgi Japaridze in 2003, computability logic is a research programme and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. In this approach logical formulas represent computational problems and their validity means being "always computable". Computational problems and resources are understood in their most general - interactive sense. They are formalized as games played by a machine against its environment, and computability means existence of a machine that wins the game against any possible behavior by the environment. Defining what such game-playing machines mean, computability logic provides a generalization of the Church-Turing thesis to the interactive level.