An algorithm to determine, for any prime p, a polynomial-sized horn sentence which expresses "the cardinality is not p"

Journal of Symbolic Logic 50 (4):1062-1064 (1985)
  Copy   BIBTEX

Abstract

Given a prime p, we exhibit a Horn sentence H p which expresses "the cardinality is not p" and has size O(p 5 log p)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

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

Cancellation laws for polynomial-time p-isolated sets.John N. Crossley & J. B. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):147-172.
Degree complexity for a modified pigeonhole principle.Maria Luisa Bonet & Nicola Galesi - 2003 - Archive for Mathematical Logic 42 (5):403-414.
Stability of nilpotent groups of class 2 and prime exponent.Alan H. Mekler - 1981 - Journal of Symbolic Logic 46 (4):781-788.
Contentual approach to negation1.Piotr Ł Łukowski - 2018 - Studies in Logic, Grammar and Rhetoric 54 (1):47-60.
Consequences of the Provability of NP ⊆ P/poly.Stephen Cook & Jan Krajíček - 2007 - Journal of Symbolic Logic 72 (4):1353 - 1371.
Universal structures in power ℵ1.Alan H. Mekler - 1990 - Journal of Symbolic Logic 55 (2):466-477.
On the complexity of Gödel's proof predicate.Yijia Chen & Jörg Flum - 2010 - Journal of Symbolic Logic 75 (1):239-254.
Ideals Over $\omega$ and Cardinal Invariants of the Continuum.P. Matet & J. Pawlikowski - 1998 - Journal of Symbolic Logic 63 (3):1040-1054.

Analytics

Added to PP
2009-01-28

Downloads
38 (#116,676)

6 months
8 (#1,326,708)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references