An algorithm to determine, for any prime <i>p</i>, a polynomial-sized Horn sentence which expresses “The cardinality is not <i>p</i>” (Q4723703)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to determine, for any prime p, a polynomial-sized Horn sentence which expresses “The cardinality is not p” |
scientific article; zbMATH DE number 3995625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to determine, for any prime <i>p</i>, a polynomial-sized Horn sentence which expresses “The cardinality is not <i>p</i>” |
scientific article; zbMATH DE number 3995625 |
Statements
An algorithm to determine, for any prime <i>p</i>, a polynomial-sized Horn sentence which expresses “The cardinality is not <i>p</i>” (English)
0 references
1985
0 references
prime
0 references
Horn sentence
0 references
