On abstract resource semantics and computability logic

Authors:
Ilya Mezhirov;Nikolay Vereshchagin
Affiliations:
The German Research Center for Artificial, Intelligence, TU Kaiserslautern, Germany;Lomonosov Moscow State University, Leninskie Gory, Moscow 119991, Russia
Venue:
Journal of Computer and System Sciences
Year:
2010

Citing 6
Cited 3

Linear logic

Theoretical Computer Science
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Propositional computability logic II

ACM Transactions on Computational Logic (TOCL)
Introduction to Cirquent Calculus and Abstract Resource Semantics* This material is based upon work supported by the National Science Foundation under Grant No. 0208816, and 2005 Summer Research Grant from Villanova University.

Journal of Logic 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the uniform validity is equivalent to the non-uniform validity for Blass' semantics of [A. Blass, A game semantics for linear logic, Ann. Pure Appl. Logic 56 (1992) 183-220]. We present a shorter proof (than that of [G. Japaridze, The intuitionistic fragment of computability logic at the propositional level, Ann. Pure Appl. Logic 147 (3) (2007) 187-227]) of the completeness of the positive fragment of intuitionistic logic for this semantics, computability logic semantics, and the abstract resource semantics.