@inproceedings{3d827195262049a39930f18f8e244253,
title = "No syllogisms for the numerical syllogistic",
abstract = "The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional syllogistic, a finite collection of rules, similar in spirit to the classical syllogisms, constitutes a sound and complete proof-system. The question arises as to whether such a proof system exists for the numerical syllogistic. This paper answers that question in the negative: no finite collection of syllogism-like rules, broadly conceived, is sound and complete for the numerical syllogistic. {\textcopyright} 2009 Springer Berlin Heidelberg.",
author = "Ian Pratt-Hartmann",
year = "2009",
doi = "10.1007/978-3-642-01748-3_13",
language = "English",
isbn = "3642017479",
volume = "5533",
series = "Lecture notes in computer science",
publisher = "Springer Nature",
pages = "192--203",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",
address = "United States",
note = "Symposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday ; Conference date: 01-07-2009",
}