A PSPACE-complete first-order fragment of computability logic

Authors:
Matthew S. Bauer
Affiliations:
Villanova University, Villanova, PA
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2014

Citing 8
Cited 0

First-order linear logic without modalities is NEXPTIME-hard

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
The principles of mathematics revisited

The principles of mathematics revisited
Propositional computability logic I

ACM Transactions on Computational Logic (TOCL)
Propositional computability logic II

ACM Transactions on Computational Logic (TOCL)
From truth to computability I

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
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
From truth to computability II

Theoretical Computer Science
Introduction to clarithmetic I

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not only to describe what can be computed, but also provide a mechanism for extracting computational algorithms from proofs. Among the most expressive and fundamental of these is CL4, known to be (constructively) sound and complete with respect to the underlying computational semantics. Furthermore, the ∀, &exists;-free fragment of CL4 was shown to be decidable in polynomial space. The present work extends this result and proves that this fragment is, in fact, PSPACE-complete.