An algorithm to determine, for any prime p, a polynomial-sized Horn sentence which expresses “The cardinality is not p”
From MaRDI portal
Publication:4723703
DOI10.2307/2273991zbMath0615.03001OpenAlexW1972112689MaRDI QIDQ4723703
Publication date: 1985
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273991
Related Items (2)
Horn sentences excluding a prime ⋮ European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
Cites Work
This page was built for publication: An algorithm to determine, for any prime p, a polynomial-sized Horn sentence which expresses “The cardinality is not p”