A logical basis for constructive systems

DOI10.1093/LOGCOM/EXR009zbMath1256.03066arXiv1003.0425OpenAlexW2108532883MaRDI QIDQ2893325

Giorgi Japaridze

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

zbMATH Keywords

game semanticscomputability logicimplicit computational complexityinteractive computationconstructive logicsefficiency logics

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Metamathematics of constructive systems (03F50) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (6)

Introduction to clarithmetic. III ⋮ 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 ⋮ Introduction to clarithmetic. I ⋮ Introduction to clarithmetic. II

This page was built for publication: A logical basis for constructive systems