• Corpus ID: 18079150

Implementing program extraction from CL1-proofs

  title={Implementing program extraction from CL1-proofs},
  author={Meixia Qu and Ke Chen and Daming Zhu and Junfeng Luan},
Computability logic (CoL) is a formal theory of interactive computation. It understands computational problems as games played by two players: a machine and its environment, uses logical formalism to describe valid principles of computability and formulas to represent computational problems. Logic CL1 is a deductive system for a fragment of CoL. The logical vocabulary contains all of the operators of classical logic and choice operators, the atoms represent elementary games i.e. predicates of… 



Propositional computability logic II

The earlier article “Propositional computability logic I” proved soundness and completeness for the (in a sense) minimal nontrivial fragment CL1 of computable logic, which is extended to the significantly more expressive propositional system CL2.

Propositional computability logic I

This article gives a detailed exposition of a soundness and completeness proof for the rather new type of a deductive propositional system CL1, the logical vocabulary of which contains operators for the so called parallel and choice operations, and the atoms of which represent elementary problems, that is, predicates in the standard sense.

From truth to computability II

From truth to computability I

Introduction to computability logic

  • G. Japaridze
  • Philosophy, Computer Science
    Ann. Pure Appl. Log.
  • 2003

Sequential operators in computability logic

Toggling operators in computability logic

Towards applied theories based on computability logic

  • G. Japaridze
  • Computer Science
    The Journal of Symbolic Logic
  • 2010
A new deductive system CL12 is introduced and its soundness and completeness with respect to the semantics of CL are proved and it is shown that this system presents a reasonable, computationally meaningful, constructive alternative to classical logic as a basis for applied theories.

Computability Logic: a formal theory of interaction

The present chapter contains a comprehensive yet relatively compact overview of this very recently introduced framework and research program, computability logic, written in a semitutorial style with general computer science, logic and mathematics audiences in mind.

Many Concepts and Two Logics of Algorithmic Reduction

The present article shows that turning the logic of the first sort of reduction into the Logic of the secondsort of reduction takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization.