The logic of interactive turing reduction
From MaRDI portal
Publication:3426573
DOI10.2178/jsl/1174668394zbMath1161.03015arXivcs/0512100OpenAlexW3098668213WikidataQ56912345 ScholiaQ56912345MaRDI QIDQ3426573
Publication date: 12 March 2007
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0512100
Logic in computer science (03B70) Metamathematics of constructive systems (03F50) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
The intuitionistic fragment of computability logic at the propositional level, The parallel versus branching recurrences in computability logic, The taming of recurrences in computability logic through cirquent calculus. II, The taming of recurrences in computability logic through cirquent calculus. I, Separating the basic logics of the basic recurrences, Toggling operators in computability logic, Build your own clarithmetic I: Setup and completeness, Introduction to clarithmetic. I, Towards applied theories based on computability logic, A new face of the branching recurrence of computability logic, Sequential operators in computability logic, Many concepts and two logics of algorithmic reduction, Introduction to clarithmetic. II
Cites Work