Journal of Symbolic Logic

An Algorithm to Determine, For any Prime $p$, A Polynomial-Sized Horn Sentence which Expresses "The Cardinality is not $p$"

Sauro Tulipani

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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)$.

Article information

Source
J. Symbolic Logic, Volume 50, Issue 4 (1985), 1062-1064.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183741978

Mathematical Reviews number (MathSciNet)
MR820133

Zentralblatt MATH identifier
0615.03001

JSTOR
links.jstor.org

Citation

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 50 (1985), no. 4, 1062--1064. https://projecteuclid.org/euclid.jsl/1183741978


Export citation