A PSPACE-complete first-order fragment of computability logic
From MaRDI portal
Publication:5410328
DOI10.1145/2559949zbMath1287.03067arXiv1201.4856MaRDI QIDQ5410328
Publication date: 16 April 2014
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.4856
03B70: Logic in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On the toggling-branching recurrence of computability logic, Build your own clarithmetic I: Setup and completeness
Cites Work
- Unnamed Item
- Unnamed Item
- Introduction to clarithmetic. II
- Introduction to clarithmetic. III
- Introduction to clarithmetic. I
- A game semantics for linear logic
- First-order linear logic without modalities is NEXPTIME-hard
- Introduction to computability logic
- From truth to computability. II.
- From truth to computability. I.
- Soundness and completeness of the Cirquent calculus system CL6 for computability logic
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- In the beginning was game semantics
- Propositional computability logic I
- Propositional computability logic II