An Algorithm to Determine, For any Prime $p$, A Polynomial-Sized Horn Sentence which Expresses "The Cardinality is not $p$"
Tulipani, Sauro
J. Symbolic Logic, Tome 50 (1985) no. 1, p. 1062-1064 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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)$.
Publié le : 1985-12-14
Classification:  
@article{1183741978,
     author = {Tulipani, Sauro},
     title = {An Algorithm to Determine, For any Prime $p$, A Polynomial-Sized Horn Sentence which Expresses "The Cardinality is not $p$"},
     journal = {J. Symbolic Logic},
     volume = {50},
     number = {1},
     year = {1985},
     pages = { 1062-1064},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741978}
}

Tulipani, Sauro. An Algorithm to Determine, For any Prime $p$, A Polynomial-Sized Horn Sentence which Expresses "The Cardinality is not $p$". J. Symbolic Logic, Tome 50 (1985) no. 1, pp.  1062-1064. http://gdmltest.u-ga.fr/item/1183741978/