A theory for Log-Space and NLIN versus coNLIN
Pollett, Chris
J. Symbolic Logic, Tome 68 (2003) no. 1, p. 1082-1090 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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 S1 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 S1 is a conservative extension of the well-studied theory IΔ and TLS is a theory for LOGSPACE reasoning.
Publié le : 2003-12-14
Classification:  bounded arithmetic,  independence results,  MRDP,  03F30,  68Q15 
@article{1067620174,
     author = {Pollett, Chris},
     title = {A theory for Log-Space and NLIN versus coNLIN},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 1082-1090},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1067620174}
}

Pollett, Chris. A theory for Log-Space and NLIN versus coNLIN. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  1082-1090. http://gdmltest.u-ga.fr/item/1067620174/