@article{lmcs:1568,
    title      = {Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic},
    author     = {Ján Pich},
    url        = {https://lmcs.episciences.org/1568},
    doi        = {10.2168/LMCS-11(2:8)2015},
    journal    = {Logical Methods in Computer Science},
    issn       = {1860-5974},
    volume     = {Volume 11, Issue 2},
    eid        = 8,
    year       = {2015},
    month      = {Jun},
    keywords   = {Mathematics - Logic, Computer Science - Computational Complexity},
}