Journal of Symbolic Logic

The logic of interactive Turing reduction

Giorgi Japaridze

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept — more precisely, the associated concept of reducibility — is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity.

Article information

J. Symbolic Logic Volume 72, Issue 1 (2007), 243-276.

First available in Project Euclid: 23 March 2007

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) {For proof-theoretic aspects see 03F52}
Secondary: 03F50: Metamathematics of constructive systems 03B70: Logic in computer science [See also 68-XX] 68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) [See also 68Q85] 68T27: Logic in artificial intelligence 68T30: Knowledge representation 91A05: 2-person games

Computability logic Intuitionistic logic Interactive computation Game semantics


Japaridze, Giorgi. The logic of interactive Turing reduction. J. Symbolic Logic 72 (2007), no. 1, 243--276. doi:10.2178/jsl/1174668394.

Export citation