Theoretical Computer Science
Propositional computability logic I
ACM Transactions on Computational Logic (TOCL)
Propositional computability logic II
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
From truth to computability II
Theoretical Computer Science
On Game Semantics of the Affine and Intuitionistic Logics
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Sequential operators in computability logic
Information and Computation
Toggling operators in computability logic
Theoretical Computer Science
Introduction to clarithmetic I
Information and Computation
The taming of recurrences in computability logic through cirquent calculus, Part I
Archive for Mathematical Logic
The taming of recurrences in computability logic through cirquent calculus, Part II
Archive for Mathematical Logic
Hi-index | 0.00 |
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and "truth" is understood as algorithmic solvability, CL potentially offers a comprehensive logical basis for constructive applied theories and computing systems inherently requiring constructive and computationally meaningful underlying logics. Among the best known constructivistic logics is Heyting's intuitionistic calculus INT, whose language can be seen as a special fragment of that of CL. The constructivistic philosophy of INT, however, just like the resource philosophy of linear logic, has never really found an intuitively convincing and mathematically strict semantical justification. CL has good claims to provide such a justification and hence a materialization of Kolmogorov's known thesis "INT = logic of problems". The present paper contains a soundness proof for INT with respect to the CL semantics.