Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Logic

arXiv:1412.3246 (math)
[Submitted on 10 Dec 2014 (v1), last revised 13 Jun 2015 (this version, v2)]

Title:Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic

Authors:Ján Pich (Charles University in Prague)
View PDF
Abstract: We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this theorem was known). This includes a formalization of the existence and of some properties of the (n,d,{\lambda})-graphs in PV1.
Subjects: Logic (math.LO); Computational Complexity (cs.CC)
Cite as: arXiv:1412.3246 [math.LO]
  (or arXiv:1412.3246v2 [math.LO] for this version)
  https://doi.org/10.48550/arXiv.1412.3246
Journal reference: Logical Methods in Computer Science, Volume 11, Issue 2 (June 16, 2015) lmcs:1568
Related DOI: https://doi.org/10.2168/LMCS-11%282%3A8%292015

Submission history

From: J [view email] [via LMCS proxy]
[v1] Wed, 10 Dec 2014 10:23:05 UTC (61 KB)
[v2] Sat, 13 Jun 2015 07:24:31 UTC (70 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.LO
< prev   |   next >
new | recent | 2014-12
Change to browse by:
cs
cs.CC
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)