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)
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)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273991
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 34,998
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total downloads
23 ( #263,556 of 2,273,608 )

Recent downloads (6 months)
5 ( #86,979 of 2,273,608 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature