Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T11:30:54.429Z Has data issue: false hasContentIssue false

LOGICS FOR THE RELATIONAL SYLLOGISTIC

Published online by Cambridge University Press:  01 December 2009

IAN PRATT-HARTMANN*
Affiliation:
School of Computer Science, University of Manchester
LAWRENCE S. MOSS*
Affiliation:
Department of Mathematics, Indiana University
*
*SCHOOL OF COMPUTER SCIENCE, UNIVERSITY OF MANCHESTER, MANCHESTER M13 9PL, UK
†DEPARTMENT OF MATHEMATICS, INDIANA UNIVERSITY, 831 EAST THIRD STREET, BLOOMINGTON, IN 47405-7106, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause. The logics we present are extensions of the classical syllogistic, and we pay special attention to the question of whether reductio ad absurdum is needed. Thus our main goal is to derive results on the existence (or nonexistence) of syllogistic proof systems for relational fragments. We also determine the computational complexity of all our fragments.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009