On the system CL12 of computability logic

DOI10.2168/LMCS-11(3:1)2015zbMath1448.03049arXiv1203.0103MaRDI QIDQ2941766

Giorgi Japaridze

Publication date: 25 August 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0103

zbMATH Keywords

game semanticscomputability logicimplicit computational complexityinteractive computationconstructive logicsefficiency logics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 (1)

Build your own clarithmetic I: Setup and completeness

This page was built for publication: On the system CL12 of computability logic