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

researchr

You are not signed in
Sign in
Sign up

Sauro Tulipani. 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.

@article{Tulipani85,
  title = {An Algorithm to Determine, For any Prime p, A Polynomial-Sized Horn Sentence which Expresses  The Cardinality is not p },
  author = {Sauro Tulipani},
  year = {1985},
  researchr = {https://researchr.org/publication/Tulipani85},
  cites = {0},
  citedby = {0},
  journal = {Journal of Symbolic Logic},
  volume = {50},
  number = {4},
  pages = {1062-1064},
}

runs on WebDSL