The logic of interactive turing reduction
From MaRDI portal
Publication:3426573
DOI10.2178/jsl/1174668394zbMath1161.03015arXivcs/0512100WikidataQ56912345 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
03B70: Logic in computer science
03F50: Metamathematics of constructive systems
03B20: Subsystems of classical logic (including intuitionistic logic)
Related Items
Introduction to clarithmetic. II, Separating the basic logics of the basic recurrences, Toggling operators in computability logic, Introduction to clarithmetic. I, A new face of the branching recurrence of computability logic, Sequential operators in computability logic, Many concepts and two logics of algorithmic reduction, 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, The intuitionistic fragment of computability logic at the propositional level, Build your own clarithmetic I: Setup and completeness, Towards applied theories based on computability logic
Cites Work
