The logic of interactive Turing reduction

Details The logic of interactive Turing reduction The logic of interactive Turing reduction

2005-12-28

arxiv.org/abs/cs/0512100v4

Journal of Symbolic Logic 72 (2007), pp. 243-276

Computer Science

Logic in Computer Science

Scientific paper

10.2178/jsl/1174668394

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. See http://www.cis.upenn.edu/~giorgi/cl.html for a comprehensive online source on computability logic.

Affiliated with

Also associated with

No associations

Rating

The logic of interactive Turing reduction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The logic of interactive Turing reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The logic of interactive Turing reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-668959