Computability logic
Computability logic (CoL) is a research program 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. It was introduced and so named by Giorgi Japaridze in 2003. Traditional proof systems such as natural deduction and sequent calculus are insufficient for axiomatizing nontrivial fragments of CoL. This has necessitated developing alternative, more general and flexible methods of proof, such as cirquent calculus.
- Comment
- enComputability logic (CoL) is a research program 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. It was introduced and so named by Giorgi Japaridze in 2003. Traditional proof systems such as natural deduction and sequent calculus are insufficient for axiomatizing nontrivial fragments of CoL. This has necessitated developing alternative, more general and flexible methods of proof, such as cirquent calculus.
- Date
- enMay 2020
- Depiction
- DifferentFrom
- Computational logic
- Has abstract
- enComputability logic (CoL) is a research program 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. It was introduced and so named by Giorgi Japaridze in 2003. In classical logic, formulas represent true/false statements. In CoL, formulas represent computational problems. In classical logic, the validity of a formula depends only on its form, not on its meaning. In CoL, validity means being always computable. More generally, classical logic tells us when the truth of a given statement always follows from the truth of a given set of other statements. Similarly, CoL tells us when the computability of a given problem A always follows from the computability of other given problems B1,...,Bn. Moreover, it provides a uniform way to actually construct a solution (algorithm) for such an A from any known solutions of B1,...,Bn. CoL formulates computational problems in their most general – interactive sense. CoL defines a computational problem as a game played by a machine against its environment. Such problem is computable if there is a machine that wins the game against every possible behavior of the environment. Such game-playing machine generalizes the Church-Turing thesis to the interactive level. The classical concept of truth turns out to be a special, zero-interactivity-degree case of computability. This makes classical logic a special fragment of CoL. Thus CoL is a conservative extension of classical logic. Computability logic is more expressive, constructive and computationally meaningful than classical logic. Besides classical logic, independence-friendly (IF) logic and certain proper extensions of linear logic and intuitionistic logic also turn out to be natural fragments of CoL. Hence meaningful concepts of "intuitionistic truth", "linear-logic truth" and "IF-logic truth" can be derived from the semantics of CoL. CoL systematically answers the fundamental question of what can be computed and how; thus CoL has many applications, such as constructive applied theories, knowledge base systems, systems for planning and action. Out of these, only applications in constructive applied theories have been extensively explored so far: a series of CoL-based number theories, termed "clarithmetics", have been constructed as computationally and complexity-theoretically meaningful alternatives to the classical-logic-based Peano arithmetic and its variations such as systems of bounded arithmetic. Traditional proof systems such as natural deduction and sequent calculus are insufficient for axiomatizing nontrivial fragments of CoL. This has necessitated developing alternative, more general and flexible methods of proof, such as cirquent calculus.
- Hypernym
- Program
- Is primary topic of
- Computability logic
- Label
- enComputability logic
- Link from a Wikipage to an external page
- arxiv.org/abs/1612.04513
- www.csc.villanova.edu/~japaridz/CL/clx.html
- web.archive.org/web/20160303174250/http:/www.csc.villanova.edu/~japaridz/CL/gsoll.html
- www.csc.villanova.edu/~japaridz/CL/
- web.archive.org/web/20190419120954/http:/www.csc.villanova.edu/~japaridz/
- www.mathnet.ru/php/presentation.phtml%3Foption_lang=eng&presentid=4373
- Link from a Wikipage to another Wikipage
- Algorithm
- Bounded arithmetic
- Category:Computability theory
- Category:Logic in computer science
- Category:Non-classical logic
- Church-Turing thesis
- Cirquent calculus
- Classical logic
- Computability
- Computational problem
- Computation in the limit
- Conservative extension
- Decidability (logic)
- File:Operators of computability logic.png
- Game semantics
- Giorgi Japaridze
- Independence-friendly logic
- Interactive computation
- Intuitionistic logic
- Linear logic
- Logic
- Logics for computability
- Many-one reduction
- Natural deduction
- Peano axioms
- Recursively enumerable set
- Sequent calculus
- Turing reduction
- SameAs
- 4huro
- Lógica da computabilidade
- Logica della computabilità
- m.02x0 x
- Q5157263
- 可计算性逻辑
- Subject
- Category:Computability theory
- Category:Logic in computer science
- Category:Non-classical logic
- Text
- enAll references in this article are exclusively by a single author, G. Japaridze.
- Thumbnail
- WasDerivedFrom
- Computability logic?oldid=1018752096&ns=0
- WikiPageLength
- 18414
- Wikipage page ID
- 616985
- Wikipage revision ID
- 1018752096
- WikiPageUsesTemplate
- Template:Distinguish
- Template:Logic
- Template:One source
- Template:Reflist
