Generalized quantifier and a bounded arithmetic theory for LOGCFL
type: Item
instance of: scholarly article
title: Generalized quantifier and a bounded arithmetic theory for LOGCFL
zbMATH Open document ID: 1115.03082
author: Satoru Kuroda
published in: Archive for Mathematical Logic
publication date: 2007-06-07T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 03C80
zbMATH DE Number: 5162361
MaRDI profile type: Publication
full work available at URL: s00153-007-0052-4
OpenAlex ID: W2030330223
cites work: Extensions to Barrington's M-program model
cites work: Two Applications of Inductive Counting for Complementation Problems
cites work: Q3794177
cites work: Q5465359
cites work: Computer Science Logic
cites work: Q4856172
cites work: The descriptive complexity approach to LOGCFL
cites work: Theories for TC0 and Other Small Complexity Classes
cites work: Properties that characterize LOGCFL
cites work: Notes on polynomially bounded arithmetic
DOI: 10.1007/S00153-007-0052-4
description: scientific article; zbMATH DE number 5162361