This book presents novel formalizations of three of the most important medieval logical theories: supposition, consequence and obligations. In an additional fourth part, an in-depth analysis of the concept of formalization is presented - a crucial concept in the current logical panorama, which as such receives surprisingly little attention.Although formalizations of medieval logical theories have been proposed earlier in the literature, the formalizations presented here are all based on innovative vantage points: supposition theories as algorithmic hermeneutics, theories of consequence (...) analyzed with tools borrowed from model-theory and two-dimensional semantics, and obligations as logical games. For this reason, this is perhaps the first time that these medieval logical theories are made fully accessible to the modern philosopher and logician who wishes to obtain a better grasp of them, but who has always been held back by the lack of appropriate ‘translations' into modern terms.Moreover, the book offers a reflection on the very nature of logic, a reflection that is prompted by the comparisons between medieval and modern logic, their similarities and dissimilarities. It is thus a contribution not only to the history of logic, but also to the philosophy of logic, the philosophy of language and semantics.The analysis of medieval logic is also relevant for the modern philosopher and logician in that, being the unifying methodology used across all disciplines at that time, logic really provided unity to science. It thus presents a unified model of scientific investigation, where logic plays the aggregating role. (shrink)

This paper presents a formalization of informal logic using the Carneades Argumentation System, a formal, computational model of argument that consists of a formal model of argument graphs and audiences. Conflicts between pro and con arguments are resolved using proof standards, such as preponderance of the evidence. CAS also formalizes argumentation schemes. Schemes can be used to check whether a given argument instantiates the types of argument deemed normatively appropriate for the type of dialogue.

In this paper I discuss a prevailing view by which logical terms determine forms of sentences and arguments and therefore the logical validity of arguments. This view is common to those who hold that there is a principled distinction between logical and nonlogical terms and those holding relativistic accounts. I adopt the Tarskian tradition by which logical validity is determined by form, but reject the centrality of logical terms. I propose an alternative framework for logic where logical terms no (...) longer play a distinctive role. This account employs a new notion of semantic. (shrink)

The overarching aim of this excellent book is to demonstrate the common ground between medieval logic and logical theories of the twentieth century by analyzing some important medieval approaches to three important topics in medieval logic and then showing that in each case, once we determine what is really going on in the medieval theory, it can be formalized in such a way as to show how it resembles one or more developments in twentieth-century logical theory. Analysis in (...) terms of modern logical theory has a lot to offer the study of medieval logical theories, the author claims, and twentieth-century theory can learn some interesting lessons from examining its medieval counterparts. Much of the material in these specific discussions has been presented in earlier versions in the author's published articles. "The Philosophy of Formalization" , however, is new. English translations are used in the text, though the Latin is supplied in the footnotes. (shrink)

Logic is formal in the sense that all arguments of the same form as logically valid arguments are also logically valid and hence truth-preserving. However, it is not known whether all arguments that are valid in the usual model-theoretic sense are truthpreserving. Tarski claimed that it could be proved that all arguments that are valid (in the sense of validity he contemplated in his 1936 paper on logical consequence) are truthpreserving. But he did not offer the proof. The question (...) arises whether the usual modeltheoretic sense of validity and Tarski's 1936 sense are the same. I argue in this paper that they probably are not, and that the proof Tarski had in mind, although unusable to prove that model-theoretically valid arguments are truth-preserving, can be used to prove that arguments valid in Tarski's 1936 sense are truth-preserving. (shrink)

It is well-known that intuitionistic logics can be formalized by means of Heyting algebras, i.e. relatively pseudocomplemented semilattices. Within such algebras the logical connectives implication and conjunction are formalized as the relative pseudocomplement and the semilattice operation meet, respectively. If the Heyting algebra has a bottom element |$0$|⁠, then the relative pseudocomplement with respect to |$0$| is called the pseudocomplement and it is considered as the connective negation in this logic. Our idea is to consider an arbitrary meet-semilattice with (...) |$0$| satisfying only the Ascending Chain Condition (these assumptions are trivially satisfied in finite meet-semilattices) and introduce the operators formalizing the connectives negation |$x^{0}$| and implication |$x\rightarrow y$| as the set of all maximal elements |$z$| satisfying |$x\wedge z=0$| and as the set of all maximal elements |$z$| satisfying |$x\wedge z\leq y$|⁠, respectively. Such a negation and implication is ‘unsharp’ since it assigns to one entry |$x$| or to two entries |$x$| and |$y$| belonging to the semilattice, respectively, a subset instead of an element of the semilattice. Surprisingly, this kind of negation and implication still shares a number of properties of these connectives in intuitionistic logic, in particular the derivation rule Modus Ponens. Moreover, unsharp negation and unsharp implication can be characterized by means of five, respectively seven simple axioms. We present several examples. The concepts of a deductive system and of a filter are introduced as well as the congruence determined by such a filter. We finally describe certain relationships between these concepts. (shrink)

This paper presents a formalization of informal logic using the Carneades Argumentation System, a formal, computational model of argument that consists of a formal model of argument graphs and audiences. Conflicts between pro and con arguments are resolved using proof standards, such as preponderance of the evidence. Carneades also formalizes argumentation schemes. Schemes can be used to check whether a given argument instantiates the types of argument deemed normatively appropriate for the type of dialogue.

In the common man reasoning the presence of vague predicates is pervasive and under the name “fuzzy logic in narrow sense” or “formal fuzzy logic” there are a series of attempts to formalize such a kind of phenomenon. This paper is devoted to discussing the limits of these attempts both from a technical point of view and with respect the original and principal task: to define a mathematical model of the vagueness. For example, one argues that, since vagueness (...) is necessarily connected with the intuition of the continuum, we have to look at the order-based topology of the interval [0,1] and not at the discrete topology of the set {0,1}. In accordance, in switching from classical logic to a logic for the vague predicates, we cannot avoid the use of the basic notions of real analysis as, for example, the ones of “approximation“, “convergence“, “continuity“. In accordance, instead of defining the compactness of the logical consequence operator and of the deduction operator in terms of finiteness, we have to define it in terms of continuity. Also, the effectiveness of the deduction apparatus has to be defined by using the tools of constructive real analysis and not the one of recursive arithmetic. This means that decidability and semi-decidability have to be defined by involving effective limit processes and not by finite steps stopping processes. (shrink)

Discussive logic was introduced by Jaskowski as a logic of discussion. In this note we show that some natural translation-based formalizations of discussive logic in modal logic do not yield a paraconsistent logic but rather classical logic. Some alternative modal formalizations of discussive logic that avoid the collapse into classical logic are put forward.

Two cut-free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei-Ardeshir's calculi for Visser's Basic Propositional Logic.

In this paper by using a model-theoretic approach, we prove Craig interpolation property for Formal Propositional Logic, FPL, Basic propositional logic, BPL and the uniform left-interpolation property for FPL. We also show that there are countably infinite extensions of FPL with the uniform interpolation property.

"Logic", one of the central words in Western intellectual history, compre hends in its meaning such diverse things as the Aristotelian syllogistic, the scholastic art of disputation, the transcendental logic of the Kantian critique, the dialectical logic of Hegel, and the mathematical logic of the Principia Mathematica of Whitehead and Russell. The term "Formal Logic", following Kant is generally used to distinguish formal logical reasonings, precisely as formal, from the remaining universal truths based on reason. (...) (Cf. SCHOLZ, 1931). A text-book example of a formal-logical inference which from "Some men are philosophers" and "All philosophers are wise" concludes that "Some men are wise" is called formal, because the validity of this inference depends only on the form ofthe given sentences -in particular it does not depend on the truth or falsity of these sentences. (On the dependence of logic on natural language, English, for example, compare Section 1 and 8). The form of a sentence like "Some men are philosophers", is that which remains preserved when the given predicates, here "men" and "philosophers" are replaced by arbitrary ones. The form itself can thus be represented by replacing the given predicates by variables. Variables are signs devoid of meaning, which may serve merely to indicate the place where meaningful constants (here the predicates) are to be inserted. As variables we shall use - as did Aristotle - letters, say P, Q and R, as variables for predicates. (shrink)

Some people approve of certain general rules of behavior, or some concrete cases. The others disapprove of or are indifferent to them. In this paper I suggest an axiom system which formalizes the use of these utterances. It may be considered as a special (individualistic) approach to deontic logic.

What role, if any, does formal logic play in characterizing epistemically rational belief? Traditionally, belief is seen in a binary way - either one believes a proposition, or one doesn't. Given this picture, it is attractive to impose certain deductive constraints on rational belief: that one's beliefs be logically consistent, and that one believe the logical consequences of one's beliefs. A less popular picture sees belief as a graded phenomenon.

This book was designed primarily as a textbook; though the author hopes that it will prove to be of interests to others beside logic students. Part I of this book covers the fundamentals of the subject the propositional calculus and the theory of quantification. Part II deals with the traditional formal logic and with the developments which have taken that as their starting-point. Part III deals with modal, three-valued, and extensional systems.

Perfect for students with no background in logic or philosophy, Simple Formal Logic provides a full system of logic adequate to handle everyday and philosophical reasoning. By keeping out artificial techniques that aren’t natural to our everyday thinking process, Simple Formal Logic trains students to think through formal logical arguments for themselves, ingraining in them the habits of sound reasoning. Simple Formal Logic features: a companion website with abundant exercise worksheets, study supplements (including flashcards for (...) symbolizations and for deduction rules), and instructor’s manual two levels of exercises for beginning and more advanced students a glossary of terms, abbreviations and symbols. This book arose out of a popular course that the author has taught to all types of undergraduate students at Loyola University Chicago. He teaches formal logic without the artificial methods–methods that often seek to solve farfetched logical problems without any connection to everyday and philosophical argumentation. The result is a book that teaches easy and more intuitive ways of grappling with formal logic–and is intended as a rigorous yet easy-to-follow first course in logical thinking for philosophy majors and non-philosophy majors alike. (shrink)

. Artificial Intelligence (AI) has long dealt with the issue of finding a suitable formalization for commonsense reasoning. Defeasible argumentation has proven to be a successful approach in many respects, proving to be a confluence point for many alternative logical frameworks. Different formalisms have been developed, most of them sharing the common notions of argument and warrant. In defeasible argumentation, an argument is a tentative (defeasible) proof for reaching a conclusion. An argument is warranted when it ultimately prevails over (...) other conflicting arguments. In this context, defeasible consequence relationships for modelling argument and warrant as well as their logical properties have gained particular attention. This article analyzes two non-monotonic inference operators Carg and Cwar intended for modelling argument construction and dialectical analysis (warrant), respectively. As a basis for such analysis we will use the LDSar framework, a unifying approach to computational models of argument using Labelled Deductive Systems (LDS). In the context of this logical framework, we show how labels can be used to represent arguments as well as argument trees, facilitating the definition and study of non-monotonic inference operators, whose associated logical properties are studied and contrasted. We contend that this analysis provides useful comparison criteria that can be extended and applied to other argumentation frameworks. (shrink)

This paper presents and illustrates a formal logic for the abduction of singular hypotheses. The logic has a semantics and a dynamic proof theory that is sound and complete with respect to the semantics. The logic presupposes that, with respect to a specific application, the set of explananda and the set of possible explanantia are disjoint . Where an explanandum can be explained by different explanantia, the logic allows only for the abduction of their disjunction.

Not focusing on the history of classical logic, this book provides discussions and quotes central passages on its origins and development, namely from a philosophical perspective. Not being a book in mathematical logic, it takes formal logic from an essentially mathematical perspective. Biased towards a computational approach, with SAT and VAL as its backbone, this is an introduction to logic that covers essential aspects of the three branches of logic, to wit, philosophical, mathematical, and computational.

After critiquing the arguments against using formal logic to teach critical thinking, this paper argues that for theoretical, practical, and empirical reasons, instruction in the fundamentals of formal logic is essential for critical thinking, and so should be included in every class that purports to teach critical thinking.

This essay presents Husserl’s Formal and Transcendental Logic (1929) in three main sections following the layout of the work itself. The first section focuses on Husserl’s introduction where he explains the method and the aim of the essay. The method used in FTL is radical Besinnung and with it an intentional explication of proper sense of formal logic is sought for. The second section is on formal logic. The third section focuses on Husserl’s “transcendental logic,” which (...) is needed to make Husserl’s conception complete, i.e., to understand what makes Besinnung radical, how the proper sense of formal logic has been reached and how all this relates to transcendental constitution of an object in the world. Husserl’s work is connected to his context (in exact sciences) and the relevance of his views for the contemporary approaches is discussed. (shrink)

John Venn has the “uneasy suspicion” that the stagnation in mathematical logic between J. H. Lambert and George Boole was due to Kant’s “disastrous effect on logical method,” namely the “strictest preservation [of logic] from mathematical encroachment.” Kant’s actual position is more nuanced, however. In this chapter, I tease out the nuances by examining his use of Leonhard Euler’s circles and comparing it with Euler’s own use. I do so in light of the developments in logical calculus from (...) G. W. Leibniz to Lambert and Gottfried Ploucquet. While Kant is evidently open to using mathematical tools in logic, his main concern is to clarify what mathematical tools can be used to achieve. For without such clarification, all efforts at introducing mathematical tools into logic would be blind if not complete waste of time. In the end, Kant would stress, the means provided by formal logic at best help us to express and order what we already know in some sense. No matter how much mathematical notations may enhance the precision of this function of formal logic, it does not change the fact that no truths can, strictly speaking, be revealed or established by means of those notations. (shrink)

Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use actually has. In this book, Catarina Dutilh Novaes adopts a much wider conception of formal languages so as to investigate more broadly what exactly is going on when theorists put these tools (...) to use. She looks at the history and philosophy of formal languages and focuses on the cognitive impact of formal languages on human reasoning, drawing on their historical development, psychology, cognitive science and philosophy. Her wide-ranging study will be valuable for both students and researchers in philosophy, logic, psychology and cognitive and computer science. (shrink)

It is explained what it is for a statement to be logically true and it is thereby explained what it is for a statement to be formally true. It is also explained how logical truth differs from formal truth. Further, it is explained what a system of logic is. Finally, the nature of entailment is explained and, in particular, it is explained how formal entailment differs from analytic entailment.

1. There is a sense in which, quite generally, with his logic Hegel can be considered the forerunner of many projects taken up by successive (non-classical) logics—and this despite the fact that He...

This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be (...) preserved, reproduced, and made generally available to the public. To ensure a quality reading experience, this work has been proofread and republished using a format that seamlessly blends the original graphical elements with text in an easy-to-read typeface. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)