Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T07:29:25.308Z Has data issue: false hasContentIssue false

A theory for Log-Space and NLIN versus co-NLIN

Published online by Cambridge University Press:  12 March 2014

Chris Pollett*
Affiliation:
214 Macquarrie Hall, Department of Computer Science, San Jose State University, 1 Washington Square, San Jose CA 95192, USA, E-mail: pollett@cs.sjsu.edu

Abstract

The use of Nepomnjaščiǐ's Theorem in the proofs of independence results for bounded arithmetic theories is investigated. Using this result and similar ideas, it is shown that at least one of S 1 or TLS does not prove the Matiyasevich-Robinson-Davis-Putnam Theorem. It is also established that TLS does not prove a statement that roughly means nondeterministic linear time is equal to co-nondeterministic linear time. Here S 1 is a conservative extension of the well-studied theory IΔ0 and TLS is a theory for LOGSPACE reasoning.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable