Formal Theories for Logspace Counting
Logic in Computer Science
2010-01-13 v1 Computational Complexity
Abstract
We introduce two-sorted theories in the style of Cook and Nguyen for the complexity classes ParityL and DET, whose complete problems include determinants over GF(2) and Z, respectively. The definable functions in these theories are the functions in the corresponding complexity classes; thus each theory formalizes reasoning using concepts from its corresponding complexity class.
Keywords
Cite
@article{arxiv.1001.1960,
title = {Formal Theories for Logspace Counting},
author = {Lila Fontes},
journal= {arXiv preprint arXiv:1001.1960},
year = {2010}
}
Comments
33 pages, uses newalg.sty (file included)