Formal Theories for Logspace Counting

Details Formal Theories for Logspace Counting Formal Theories for Logspace Counting

2010-01-12

arxiv.org/abs/1001.1960v1

Computer Science

Logic in Computer Science

33 pages, uses newalg.sty (file included)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Formal Theories for Logspace Counting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Formal Theories for Logspace Counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Theories for Logspace Counting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459892