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. The traditional proof systems such as natural deduction or sequent calculus turn out to be insufficient for axiomatizing any more or less nontrivial fragments of CoL. This has necessitated developing alternative, more general and flexible methods of proof, such as cirquent calculus.
differentFrom
primaryTopic
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. The traditional proof systems such as natural deduction or sequent calculus turn out to be insufficient for axiomatizing any more or less nontrivial fragments of CoL. This has necessitated developing alternative, more general and flexible methods of proof, such as cirquent calculus.
has abstract
Computability logic (CoL) is a ...... of, such as cirquent calculus.
@en
Introduzido por Giorgi Japarid ...... esquisa em contínuo andamento.
@pt
相对于是真理的形式理论的经典逻辑,Giorgi Japari ...... 它的各种片段找到演绎系统并探索它们的性质是正在研究中的领域。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
744,868,053
hypernym
comment
Computability logic (CoL) is a ...... of, such as cirquent calculus.
@en
Introduzido por Giorgi Japarid ...... am serem "sempre computáveis".
@pt
相对于是真理的形式理论的经典逻辑,Giorgi Japari ...... 它的各种片段找到演绎系统并探索它们的性质是正在研究中的领域。
@zh
label
Computability logic
@en
Lógica da Computabilidade
@pt
可计算性逻辑
@zh