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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJames C. Owings Jr (1989). A Cardinality Version of Biegel's Nonspeedup Theorem. Journal of Symbolic Logic 54 (3):761-767.
Andreas Blass (1984). There Are Not Exactly Five Objects. Journal of Symbolic Logic 49 (2):467-469.
David Braun (2011). Implicating Questions. Mind and Language 26 (5):574-595.
Till Tantau (2005). Weak Cardinality Theorems. Journal of Symbolic Logic 70 (3):861 - 878.
George C. Nelson (1998). Preservation Theorems Without Continuum Hypothesis. Studia Logica 60 (3):343-355.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,921 of 549,122 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
