A note on da Costa-Doria “exotic formalizations”

Archive for Mathematical Logic 49 (7-8):813-821 (2010)
  Copy   BIBTEX

Abstract

We analyze N. C. A. da Costa and F. A. Doria’s “exotic formalization” of the conjecture P = NP [3–7]. For any standard axiomatic PA extension T and any number-theoretic sentence ${\varphi }$ , we let ${\varphi ^{\star} := \varphi \vee \lnot \mathsf{Con}\left( \mathsf{T}\right)}$ and prove the following “exotic” inferences 1–3. 1. ${\mathsf{T}+\varphi ^{\star}}$ is consistent, if so is T, 2. ${\mathsf{T}+\varphi}$ is consistent, provided that ${\mathsf{T}+\varphi ^{\star}}$ is ω-consistent, 3. ${\mathsf{T}+\varphi}$ is consistent, provided that T is consistent and has the same provably total recursive functions as ${\mathsf{T}+\left( \varphi \leftrightarrow \varphi ^{\star }\right) }$ . Furthermore we show that 1–3 continue to hold for ${\varphi ^{\star} := \varphi _{S} :=\varphi \vee \lnot S}$ , where ${S=\forall x\exists yR\left( x,y\right)}$ is any ${\Pi _{2}^{0}}$ sentence satisfying: 4. ${\left( \forall n\in \omega \right) \left( \mathsf{T}\vdash S_{x}\left[ \underline{n}\right] \right) }$ , 5. ${\mathsf{Con}\left( \mathsf{T}\right) \Rightarrow \mathsf{T}\nvdash S}$ . We observe that if ${\varphi :=\left[ \mathsf{P}=\mathsf{NP}\right] }$ and ${S:= \left[\digamma total\right] }$ , where ${\digamma=\digamma _{\mathsf{T}}}$ is da Costa-Doria “exotic” function with respect to T, then 4, 5 are satisfied for most familiar (presumably) consistent T in question, while ${\varphi _{S}}$ becomes equivalent to da Costa-Doria “exotic formalization” ${\left[ \mathsf{P}=\mathsf{NP}\right]^{\digamma}}$ . Moreover, the corresponding “exotic” inferences 1–3 generalize analogous da Costa-Doria results. Hence these “exotic” inferences are universal for all number-theoretic sentences and not characteristic to the conjecture P = NP. Nor do they infer relative consistency of P = NP (see Conclusion 15 in the text)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
A guided tour of minimal indices and shortest descriptions.Marcus Schaefer - 1998 - Archive for Mathematical Logic 37 (8):521-548.
On Interpretability in the Theory of Concatenation.Vítězslav Švejdar - 2009 - Notre Dame Journal of Formal Logic 50 (1):87-95.
Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
Models of transfinite provability logic.David Fernández-Duque & Joost J. Joosten - 2013 - Journal of Symbolic Logic 78 (2):543-561.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
Stretchings.O. Finkel & J. P. Ressayre - 1996 - Journal of Symbolic Logic 61 (2):563-585.

Analytics

Added to PP
2013-11-23

Downloads
24 (#639,942)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?