Generalized quantifier and a bounded arithmetic theory for LOGCFL
From MaRDI portal
Publication:884960
DOI10.1007/S00153-007-0052-4zbMath1115.03082OpenAlexW2030330223MaRDI QIDQ884960
Publication date: 7 June 2007
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-007-0052-4
First-order arithmetic and fragments (03F30) Logic with extra quantifiers and operators (03C80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties that characterize LOGCFL
- Extensions to Barrington's M-program model
- Two Applications of Inductive Counting for Complementation Problems
- Theories for TC0 and Other Small Complexity Classes
- Computer Science Logic
- Notes on polynomially bounded arithmetic
- The descriptive complexity approach to LOGCFL
This page was built for publication: Generalized quantifier and a bounded arithmetic theory for LOGCFL
