- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Syllogistic with Unity
Journal of Philosophical Logic 42 (2):391-407 (2013)
Abstract
We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowedLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
The Hamiltonian Syllogistic.Ian Pratt-Hartmann - 2011 - Journal of Logic, Language and Information 20 (4):445-474.
Fragments of language.Ian Pratt-Hartmann - 2004 - Journal of Logic, Language and Information 13 (2):207-223.
Syllogisms with fractional quantifiers.Fred Johnson - 1994 - Journal of Philosophical Logic 23 (4):401 - 422.
How many syllogisms are there?Colwyn Williamson - 1988 - History and Philosophy of Logic 9 (1):77-85.
Syllogistic with Indefinite Terms.Enrique Alvarez & Manuel Correia - 2012 - History and Philosophy of Logic 33 (4):297-306.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Non-standard categorical syllogisms: four that leibniz forgot.Don Emil Herget - 1987 - History and Philosophy of Logic 8 (1):1-13.
A Diagrammatic Calculus of Syllogisms.Ruggero Pagnan - 2012 - Journal of Logic, Language and Information 21 (3):347-364.
Complexly fractionated syllogistic quantifiers.Philip L. Peterson - 1991 - Journal of Philosophical Logic 20 (3):287 - 313.
A System of Relational Syllogistic Incorporating Full Boolean Reasoning.Nikolay Ivanov & Dimiter Vakarelov - 2012 - Journal of Logic, Language and Information 21 (4):433-459.
Solving categorical syllogisms with singular premises.Hugo Mercier & Guy Politzer - 2008 - Thinking and Reasoning 14 (4):434-454.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Analytics
Added to PP
2012-04-21
Downloads
66 (#244,969)
6 months
12 (#208,861)
2012-04-21
Downloads
66 (#244,969)
6 months
12 (#208,861)
Historical graph of downloads
Citations of this work
References found in this work
Formal Logic, or the Calculus of Inference, Necessary and Probable.Augustus de Morgan - 1847 - London, England: Taylor & Walton.
Logics for the relational syllogistic.Ian Pratt-Hartmann & Lawrence S. Moss - 2009 - Review of Symbolic Logic 2 (4):647-683.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-g9b9l uwo