A system of relational syllogistic incorporating full Boolean reasoning

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are R-related to all B. Such primitives formalize sentences from natural language like `All students read some textbooks'. Here A and B denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.Comment: Available at http://link.springer.com/article/10.1007/s10849-012-9165-

Ancient Logic and its Modern Interpretations: Proceedings of the Buffalo Symposium on Modernist Interpretations of Ancient Logic, 21 and 22 April, 1972

Articles by Ian Mueller, Ronald Zirin, Norman Kretzmann, John Corcoran, John Mulhern, Mary Mulhern,Josiah Gould, and others. Topics: Aristotle's Syllogistic, Stoic Logic, Modern Research in Ancient Logic

Information enforcement in learning with graphics : improving syllogistic reasoning skills

This thesis is an investigation into the factors that contribute to good choices among graphical systems used in teaching, and the feasibility of implementing teaching software that uses this knowledge.The thesis describes a mathematical metric derived from a cognitive theory of human diagram processing. The theory characterises differences among representations by their ability to express information. The theory provides the factors and relationships needed to build the metric. It says that good representations are easily processed because they are more vivid, more tractable and less expressive, than poor representations.The metric is applied to abstract systems for teaching and learning syllogistic reasoning, TARSKI'S WORLD, EULER CIRCLES, VENN DIAGRAMS and CARROLL'S GAME OF LOGIC. A rank ordering reflects the value of each system predicted by the theory and the metric. The theory, the metric and the systems are then tested in empirical studies. Five studies involving sixty-eight learners, examined the benefit of software based on these abstract systems.Studies showed the theory correctly predicted learners' success with the circle systems and poorer performance with TARSKI'S WORLD. The metric showed small but clear differences in expressivity between the circle systems. Differences between results of the learners using the circle systems contradicted the predictions of the metric.Learners with mathematical training were better equipped and more successful at learning syllogistic reasoning with the systems. Performance of learners without mathematical training declined after using the software systems. Diagrams drawn by learners together with video footage collected during problem solving, led to a catalogue of errors, misconceptions and some helpful strategies for learning from graphical systems.A cognitive style test investigated the poor performance of non-mathematically trained learners. Learners with mathematics training showed serialist and versatile learning styles while learners without this training showed a holist learning style. This is consistent with the hypothesis that non-mathematically trained learners emphasise the use of semantic cues during learning and problem solving.A card-sorting task investigated learners' preferences for parts of the graphical lexicon used in the diagram systems. Preferences for the EULER lexicon increased difficulty in explaining the system's poor results in earlier studies. Video footage of learners using the systems in the final study illustrated useful learning strategies and improved performance with EULER while individual instruction was available.Further work describes a preliminary design for an adaptive syllogism tutor and other related work

Relationships amongst science, ethics and polis in pre-modern times

The emergence of the Modern Age is depicted as a replacement of a long standing political philosophy by a distinctly new one. Foundational meanings are attributed to key terms Science, Ethics and Polis, nuance in these terms is traced against those attributed meanings, and the integrating impact of that nuance on relationships amongst key terms is interpreted as changing political philosophy. Speculative questioning reflection is expressed about the nature of the next Polis

Relations between logic and mathematics in the work of Benjamin and Charles S. Peirce.

Charles Peirce (1839-1914) was one of the most important logicians of the nineteenth century. This thesis traces the development of his algebraic logic from his early papers, with especial attention paid to the mathematical aspects. There are three main sources to consider. 1) Benjamin Peirce (1809-1880), Charles's father and also a leading American mathematician of his day, was an inspiration. His memoir Linear Associative Algebra (1870) is summarised and for the first time the algebraic structures behind its 169 algebras are analysed in depth. 2) Peirce's early papers on algebraic logic from the late 1860s were largely an attempt to expand and adapt George Boole's calculus, using a part/whole theory of classes and algebraic analogies concerning symbols, operations and equations to produce a method of deducing consequences from premises. 3) One of Peirce's main achievements was his work on the theory of relations, following in the pioneering footsteps of Augustus De Morgan. By linking the theory of relations to his post-Boolean algebraic logic, he solved many of the limitations that beset Boole's calculus. Peirce's seminal paper `Description of a Notation for the Logic of Relatives' (1870) is analysed in detail, with a new interpretation suggested for his mysterious process of logical differentiation. Charles Peirce's later work up to the mid 1880s is then surveyed, both for its extended algebraic character and for its novel theory of quantification. The contributions of two of his students at the Johns Hopkins University, Oscar Mitchell and Christine Ladd-Franklin are traced, specifically with an analysis of their problem solving methods. The work of Peirce's successor Ernst Schröder is also reviewed, contrasting the differences and similarities between their logics. During the 1890s and later, Charles Peirce turned to a diagrammatic representation and extension of his algebraic logic. The basic concepts of this topological twist are introduced. Although Peirce's work in logic has been studied by previous scholars, this thesis stresses to a new extent the mathematical aspects of his logic - in particular the algebraic background and methods, not only of Peirce but also of several of his contemporaries