Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394589zbMATH OpenOpenAlexFDO

Authors Antonina Kolokolova

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• scientific article; zbMATH DE number 1670480
• scientific article; zbMATH DE number 4059391
• scientific article; zbMATH DE number 218509
• Fragments of Bounded Arithmetic and Bounded Query Classes
• Witnessing functions in bounded arithmetic and search problems

Cited in

(5)

• scientific article; zbMATH DE number 1670480 (Why is no real title available?)
• The critical number of a variable in a function
• scientific article; zbMATH DE number 218509 (Why is no real title available?)
• scientific article; zbMATH DE number 1420845 (Why is no real title available?)
• Generalized quantifier and a bounded arithmetic theory for LOGCFL

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394589)