The Syllogistic with Unity
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2011
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909178431275008 |
|---|---|
| author | Pratt-Hartmann, Ian |
| author_facet | Pratt-Hartmann, Ian |
| contents | 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 allowed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1110_2317 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | The Syllogistic with Unity Pratt-Hartmann, Ian Logic in Computer Science Logic 03B65 F.4.0 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 allowed. |
| title | The Syllogistic with Unity |
| topic | Logic in Computer Science Logic 03B65 F.4.0 |
| url | https://arxiv.org/abs/1110.2317 |