Computability Logic: a formal theory of interaction
arXiv:cs/0404024 · doi:10.1007/3-540-34874-3_9
Abstract
Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and Applied Logic 123 (2003), pp.1-99). The present paper reintroduces computability logic in a more compact and less technical way. It is written in a semitutorial style with a general computer science, logic or mathematics audience in mind. An Internet source on the subject is available at http://www.cis.upenn.edu/~giorgi/cl.html, and additional material at http://www.csc.villanova.edu/~japaridz/CL/gsoll.html .
References in corpus (3)
Cited by in corpus (26)
- Sequential operators in computability logic
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Propositional computability logic I
- Cirquent calculus deepened
- From truth to computability I
- The intuitionistic fragment of computability logic at the propositional level
- Propositional Computability Logic II
- Intuitionistic computability logic
- From truth to computability II
- Many concepts and two logics of algorithmic reduction
- Toggling operators in computability logic
- From formulas to cirquents in computability logic
- Introduction to clarithmetic II
- In the beginning was game semantics
- Towards applied theories based on computability logic
- Introduction to clarithmetic I
- A logical basis for constructive systems
- On the system CL12 of computability logic
- Separating the basic logics of the basic recurrences
- Build your own clarithmetic I: Setup and completeness
- Ptarithmetic
- Quantifying Shannon's Work Function for Cryptanalytic Attacks
- Implementing program extraction from CL1-proofs
- Extending and Automating Basic Probability Theory with Propositional Computability Logic
- What is an Algorithm?: a Modern View
- Agent-Based Proof Design via Lemma Flow Diagram