Arithmetizations of Syllogistic à la Leibniz

  title={Arithmetizations of Syllogistic {\`a} la Leibniz},
  author={V. Sotirov},
  journal={J. Appl. Non Class. Logics},
  • V. Sotirov
  • Published 1999
  • Computer Science, Mathematics
  • J. Appl. Non Class. Logics
Two models of the Aristotelian syllogistic in arithmetic of natural numbers are built as realizations of an old Leibniz idea. In the interpretation, called Scholastic, terms are replaced by integer... 

Topics from this paper

Aristotelian assertoric syllogistic
Aristotelian assertoric syllogistic, which is currently of growing interest, has attracted the attention of the founders of modern logic, who approached it in several (semantical and syntactical)Expand
Leibnizian Intensional Semantics for Syllogistic Reasoning
Venn diagrams are standardly used to give a semantics for Syllogistic reasoning. This interpretation is extensional. Leibniz, however, preferred an intensional interpretation, according to which aExpand
Leibniz's logic
  • W. Lenzen
  • Mathematics, Computer Science
  • The Rise of Modern Logic: From Leibniz to Frege
  • 2004
This chapter focuses on an extensive reconstruction of the formal core of Leibniz's logic and shows the way in which the theory of the syllogism becomes provable within the logical calculus. Expand
Leibniz’s Logical Systems: A Reconstruction
The system of logic plays a central role in Leibniz’s methodology of science. According to his basic ideas, any scientific question should be posed in the form “Is S a P?”and its answer might beExpand
On Leibniz ’ Characteristic Numbers
In 1679, Leibniz wrote nine manuscripts on three different arithmetical models of Aristotelian logic. This was a part of his project of a “calculus universalis”. First we show the precise relationsExpand
Equivalential Structures for Binary and Ternary Syllogistics
The relational logics (without Boolean connectives) are introduced and a model-theoretic proof of decidability for they are presented and algebraic semantics (bounded meet semi-lattice) of the logics using congruence theory is developed. Expand
Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole
It is argued that Boole's development of an algebra of reasoning was in a large part successful due to its ability to marry the two types of computation that are exemplified in Llull's and Leibniz's works. Expand
On Logics of Transitive Verbs With and Without Intersective Adjectives
Abstract The purpose of this paper is to contribute to the natural logic program which invents logics in natural language. This study presents two logics: a logical system called d R(∀,∃) containingExpand
Leibniz on Logic, Language and Signs: a Bibliography (A- K)
  • 2016
Andrews, F.E. 1983. "Leibniz's Logic within His Philosophical System." Dionysius no. 7:73-128. "The work purports to provide a philosophical history of Leibniz's logical works. The principalExpand
Leibniz and the Calculus Ratiocinator
This paper deals with the interconnections between mathematics, metaphysics, and logic in the work of Leibniz. On the one hand, it touches upon some practical aspects such as Leibniz’s constructionExpand


Aristotelian syllogisms and generalized quantifiers
The paper elaborates two points: i) There is no principal opposition between predicate logic and adherence to subject-predicate form, ii) Aristotle's treatment of quantifiers fits well into a modernExpand
On the Interpretation of Aristotelian Syllogistic
(theorem 6, ? 4) we show that in Wedberg's system [14] with primitives 'Aab', 'a" (not a), it is possible to find a mapping a -T(a) as above such that 'Aab' is equivalent to '92(a) is contained inExpand
Generalized quantifiers and modal logic
Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. Expand
Computability and logic
This book discusses Computability Theory, Modal logic and provability, and its applications to first-order logic, which aims to clarify and clarify the role of language in the development of computability. Expand
Set Containment Inference and Syllogisms
Necessary and sufficient conditions for consistency, as well as sound and complete sets of inference rules, are presented for binary containment inference, which is solved by rules essentially equivalent to Aristotle's syllogisms. Expand
Information Systems, Similarity Relations and Modal Logics
The completeness theorems for the introduced modal logics with respect to their standard semantics are introduced and their “query meaning” is discussed. Expand
Cardinalities of Models for Pure Calculi of Names
Fragmente zur Logik