A logical basis for constructive systems
From MaRDI portal
Publication:2893325
DOI10.1093/logcom/exr009zbMath1256.03066arXiv1003.0425MaRDI QIDQ2893325
Publication date: 20 June 2012
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.0425
game semantics; computability logic; implicit computational complexity; interactive computation; constructive logics; efficiency logics
03D15: Complexity of computation (including implicit computational complexity)
03D20: Recursive functions and relations, subrecursive hierarchies
03F50: Metamathematics of constructive systems
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Introduction to clarithmetic. II, Introduction to clarithmetic. III, Introduction to clarithmetic. I, The taming of recurrences in computability logic through cirquent calculus. II, The taming of recurrences in computability logic through cirquent calculus. I, Build your own clarithmetic I: Setup and completeness