Giorgi Japaridze

乔治 札帕日泽
（名） （姓）

Computability Logic
可计算性逻辑
Lecture course given at Xiamen University
June 19 - July 28, 2007
在厦门大学教的课程
2007年6月19号 – 7月28号

0
 Episode 1

Introduction
• What is computability logic
• Computability logic versus classical logic
• The current state of develpment

0
1.1

Traditional (classical) logic = formal theory of truth

Computability logic (CL) = formal theory of computability

= formal theory of knowledge

Traditional logic provides a systematic answer to

Theory What is true?

Computability logic provides a systematic answer to

What can be computed?
Theory
What can be found (known) by an agent?
How can be computed?
Practice CL --- problem-solving tool
How can be found?
1.2
• Computability logic is a conservative extension of classical logic
• It has an open-ended formalism and extent
• In a broader sense, CL is a program for redeveloping logic
• Open problems prevail over answered questions
• Officially born in 2003 in
G.Japaridze, Introduction to computability logic,
Annals of Pure and Applied Logic 123, pages 1-99.

Computability logic ?
?

? Virgin soil ?

? 处女地 ? ?
?
?
? ? ?
Answered questions
?
Classical logic ?
?