A model-theoretic proof for P ≠ NP over all infinite Abelian groups

Journal of Symbolic Logic 67 (1):235 - 238 (2002)
  Copy   BIBTEX

Abstract

We give a model-theoretic proof of the fact that for all infinite Abelian groups P ≠ NP in the sense of binary nondeterminism. This result has been announced 1994 by Christine Gabner

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
A game‐theoretic proof of analytic Ramsey theorem.Kazuyuki Tanaka - 1992 - Mathematical Logic Quarterly 38 (1):301-304.
On superstable CSA-groups.Abderezak Houcine - 2008 - Annals of Pure and Applied Logic 154 (1):1-7.
On superstable CSA-groups.Abderezak Ould Houcine - 2008 - Annals of Pure and Applied Logic 154 (1):1-7.
The dp-rank of Abelian groups.Yatir Halevi & Daniel Palacín - 2019 - Journal of Symbolic Logic 84 (3):957-986.
Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.

Analytics

Added to PP
2009-01-28

Downloads
445 (#64,009)

6 months
8 (#574,086)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.

Add more citations

References found in this work

Characterizations of the class Δ ta 2 over Euclidean spaces.Armin Hemmerling - 2004 - Mathematical Logic Quarterly 50 (4):507-519.

Add more references