Translator Disclaimer
March 2007 The logic of interactive Turing reduction
Giorgi Japaridze
J. Symbolic Logic 72(1): 243-276 (March 2007). DOI: 10.2178/jsl/1174668394

Abstract

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.

Citation

Download Citation

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

Information

Published: March 2007
First available in Project Euclid: 23 March 2007

zbMATH: 1161.03015
MathSciNet: MR2298481
Digital Object Identifier: 10.2178/jsl/1174668394

Subjects:
Primary: 03B47
Secondary: 03B70, 03F50, 68Q10, 68T27, 68T30, 91A05

Rights: Copyright © 2007 Association for Symbolic Logic

JOURNAL ARTICLE
34 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.72 • No. 1 • March 2007
Back to Top