The paper presents an exhaustive menu of nonmonotonic logics. The options are individuated in terms of the principles they reject. I locate, e.g., cumulative logics and relevance logics on this menu. I highlight some frequently neglected options, and I argue that these neglected options are particularly attractive for inferentialists.

I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity fails, (...) but for good reasons. Intuitionism and classical logic can easily be recovered from the system. (shrink)

We extend causal theories and study actions in domains involving multiple agents. Causal theories, invented by Yoav Shoham, are based on a temporal nonmonotonic logic and have computationally tractable aspects. Since Shoham's formalism does not provide an adequate mechanism for representing simultaneous actions and specifying their consequences, we introduce the notion of counteractions while preserving the efficiency and model-theoretic properties of causal theories.

This paper discusses an almost sixty year old problem in the philosophy of science -- that of a logic of confirmation. We present a new analysis of Carl G. Hempel's conditions of adequacy (Hempel 1945), differing from the one Carnap gave in §87 of his Logical Foundations of Probability (1962). Hempel, it is argued, felt the need for two concepts of confirmation: one aiming at true theories and another aiming at informative theories. However, he also realized that these two (...) concepts are conflicting, and he gave up the concept of confirmation aiming at informative theories. We then show that one can have Hempel's cake and eat it, too: There is a (rank-theoretic and genuinely nonmonotonic) logic of confirmation -- or rather, theory assessment -- that takes into account both of these two conflicting aspects. According to this logic, a statement H is an acceptable theory for the data E if and only if H is both sufficiently plausible given E and sufficiently informative about E. Finally, the logic sheds new light on Carnap's analysis (and solves another problem of confirmation theory). (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of the combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC + TR, whose semantics is based on the notion of rational closure, as well as on the distributed semantics of probabilistic Description Logics, and is equipped with a cognitive heuristic used by humans for concept composition. We first extend the logic of typicality ALC + TR (...) by typicality inclusions of the form p :: T(C) v D, whose intuitive meaning is that “we believe with degree p about the fact that typical Cs are Ds”. As in the distributed semantics, we define different scenarios containing only some typicality inclusions, each one having a suitable probability. We then exploit such scenarios in order to ascribe typical properties to a concept C obtained as the combination of two prototypical concepts. We also show that reasoning in the proposed Description Logic is EXPTIME-complete as for the underlying standard Description Logic ALC. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of combining prototypical concepts, an open problem in the fields of AI and cognitive modelling. Our logic extends the logic of typicality ALC + TR, based on the notion of rational closure, by inclusions p :: T(C) v D (“we have probability p that typical Cs are Ds”), coming from the distributed semantics of probabilistic Description Logics. Additionally, it embeds a set of (...) cognitive heuristics for concept combination. We show that the complexity of reasoning in our logic is EXPTIME-complete as in ALC. (shrink)

This paper starts by indicating the analysis of Hempel's conditions of adequacy for any relation of confirmation (Hempel, 1945) as presented in Huber (submitted). There I argue contra Carnap (1962, Section 87) that Hempel felt the need for two concepts of confirmation: one aiming at plausible theories and another aiming at informative theories. However, he also realized that these two concepts are conflicting, and he gave up the concept of confirmation aiming at informative theories. The main part of the paper (...) consists in working out the claim that one can have Hempel's cake and eat it too - in the sense that there is a logic of theory assessment that takes into account both of the two conflicting aspects of plausibility and informativeness. According to the semantics of this logic, a is an acceptable theory for evidence β if and only if a is both sufficiently plausible given β and sufficiently informative about β. This is spelt out in terms of ranking functions (Spohn, 1988) and shown to represent the syntactically specified notion of an assessment relation. The paper then compares these acceptability relations to explanatory and confirmatory consequence relations (Flach, 2000) as well as to nonmonotonic consequence relations (Kraus et al., 1990). It concludes by relating the plausibility-informativeness approach to Carnap's positive relevance account, thereby shedding new light on Carnap's analysis as well as solving another problem of confirmation theory. (shrink)

In order to reason in a non-trivializing way with contradictions, para- consistent logics reject some classically valid inferences. As a way of re- covering some of these inferences, Graham Priest ([Priest, 1991]) proposed to nonmonotonically strengthen the Logic of Paradox by allowing the se- lection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied (...) to contradictory assumptions. In Priest’s approach the inconsistent parts of models are compared in an extensional way by considering their inconsis- tent objects. This distinguishes his system from the standard format of (inconsistency-)adaptive logics pioneered by Diderik Batens, according to which (atomic) contradictions validated in models form the basis of their comparison. A well-known problem for Priest’s extensional approach is its lack of the Strong Reassurance property, i.e., for specific settings there may be infinitely descending chains of less and less inconsistent models, thus never reaching a minimally inconsistent model. In this paper, we demonstrate that Strong Reassurance holds for the extensional approach under a cardinality-based comparison of the incon- sistent parts of models. Furthermore, we introduce and investigate the metatheory of the class of first-order nonmonotonic inconsistency-tolerant construct over the extensional or quantitative comparisons of their respec- tive models. Core model-theoretic properties for these logics, such as the Löwenheim-Skolem theorems, along with other nonmonotonic properties, are further studied. (shrink)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

This paper briefly outlines some advancements in paraconsistent logics for modelling knowledge representation and reasoning. Emphasis is given on the so-called Logics of Formal Inconsistency (LFIs), a class of paraconsistent logics that formally internalize the very concept(s) of consistency and inconsistency. A couple of specialized systems based on the LFIs will be reviewed, including belief revision and probabilistic reasoning. Potential applications of those systems in the AI area of KRR are tackled by illustrating some examples that emphasizes the importance of (...) a fine-tuned treatment of consistency in modelling reputation systems, preferences, argumentation, and evidence. (shrink)

Bayesian epistemologists support the norms of probabilism and conditionalization using Dutch book and accuracy arguments. These arguments assume that rationality requires agents to maximize practical or epistemic value in every doxastic state, which is evaluated from a subjective point of view (e.g., the agent’s expectancy of value). The accuracy arguments also presuppose that agents are opinionated. The goal of this paper is to discuss the assumptions of these arguments, including the measure of epistemic value. I have designed AI agents based (...) on the Bayesian model and a nonmonotonic framework and tested how they achieve practical and epistemic value in conditions in which an alternative set of assumptions holds. In one of the tested conditions, the nonmonotonic agent, which is not opinionated and fulfills neither probabilism nor conditionalization, outperforms the Bayesian in the measure of epistemic value that I argue for in the paper (α-value). I discuss the consequences of these results for the epistemology of rationality. (shrink)

Formalizing commonsense knowledge for reasoning about time has long been a central issue in AI. It has been recognized that the existing formalisms do not provide satisfactory solutions to some fundamental problems, viz. the frame problem. Moreover, it has turned out that the inferences drawn do not always coincide with those one had intended when one wrote the axioms. These issues call for a well-defined formalism and useful computational utilities for reasoning about time and change. Yoav Shoham of Stanford University (...) introduced in his 1986 Yale doctoral thesis an appealing temporal nonmonotonic logic and identified a class of theories, causal theories, which have computationally simple model-theoretic properties. This paper is a study towards building upon Shoham's work on causal theories. We concentrate on improving computational aspects of causal theories while preserving their model-theoretic properties. (shrink)

In substructural logics, structural principles may hold in some fragments of a consequence relation without holding globally. I look at this phenomenon in my preferred substructural logic, in which Weakening and Cut fail but which is supra-intuitionistic. I introduce object language operators that keep track of the admissibility of Weakening and of intuitionistic implications. I end with some ideas about local transitivity.

Neste trabalho, é apresentada uma investigação do que poderia ser chamado de formalização lógica do processo de mudança de teorias devido a anomalias. Por anomalia entende-se um fato observado que faz parte do escopo explanatório de uma teoria, mas que vai de encontro à previsão da mesma. Uma abordagem clássica para restaurar o poder explicativo de uma teoria ameaçada por uma anomalia é a postulação de hipóteses novas e provisórias que, em conjunto com as demais hipóteses auxiliares originais, sejam capazes (...) de resolver a anomalia. Após chegar à algumas conclusões sobre a estrutura de tal processo, propomos um framework lógico multimodal e não-monotônico capaz de representar alguns aspectos-chave dessa faceta importante da dinâmica de teorias científicas. Devido à necessidade de acomodar hipóteses provisórias incompatíveis, esse framework incorpora uma forma fraca de paraconsistência. Como um estudo de caso, analisamos o comportamento anômalo do planeta Urano que ameaçou a mecânica celeste Newtoniana por mais de meio século e ensejou a descoberta do planeta Netuno. -/- In this work, an investigation of what could be called the logical formalization of the theory change process due to anomalies is presented. An anomaly is understood as an observed fact that is part of the explanatory scope of a theory, but that goes against its prediction. A classic approach to restoring the explanatory power of a theory threatened by an anomaly is to postulate new and provisional hypotheses that, together with the other original auxiliary hypotheses, are capable of resolving the anomaly. After reaching some conclusions about the structure of such a process, we propose a multimodal and non-monotonic logical framework capable of representing some key aspects of this important facet of the dynamics of scientific theories. Due to the need to accommodate incompatible provisional hypotheses, this framework incorporates a weak form of paraconsistency. As a case study, we analyze the anomalous behavior of the planet Uranus that threatened Newtonian celestial mechanics for more than half a century and prompted the discovery of the planet Neptune. (shrink)

Combining typical knowledge to generate novel concepts is an important creative trait of human cognition. Dealing with such ability requires, from an AI perspective, the harmonization of two conflicting requirements that are hardly accommodated in symbolic systems: the need of a syntactic compositionality (typical of logical systems) and that one concerning the exhibition of typicality effects (see Frixione and Lieto, 2012). In this work we provide a logical framework able to account for this type of human-like concept combination. We propose (...) a nonmonotonic Description Logic of typicality called TCL (Typicality-based Compositional Logic). (shrink)

Textual entailment is a relationship that obtains between fragments of text when one fragment in some sense implies the other fragment. The automation of textual entailment recognition supports a wide variety of text-based tasks, including information retrieval, information extraction, question answering, text summarization, and machine translation. Much ingenuity has been devoted to developing algorithms for identifying textual entailments, but relatively little to saying what textual entailment actually is. This article is a review of the logical and philosophical issues involved in (...) providing an adequate definition of textual entailment. We show that many natural definitions of textual entailment are refuted by counterexamples, including the most widely cited definition of Dagan et al. We then articulate and defend the following revised definition: T textually entails H = df typically, a human reading T would be justified in inferring the proposition expressed by H from the proposition expressed by T. We also show that textual entailment is context-sensitive, nontransitive, and nonmonotonic. (shrink)

It is usually accepted that deductions are non-informative and monotonic, inductions are informative and nonmonotonic, abductions create hypotheses but are epistemically irrelevant, and both deductions and inductions can’t provide new insights. In this article, I attempt to provide a more cohesive view of the subject with the following hypotheses: (1) the paradigmatic examples of deductions, such as modus ponens and hypothetical syllogism, are not inferential forms, but coherence requirements for inferences; (2) since any reasoner aims to be coherent, any (...) inference must be deductive; (3) a coherent inference is an intuitive process where the premises should be taken as sufficient evidence for the conclusion, which on its turn should be viewed as necessary evidence for the premises in some modal range; (4) inductions, properly understood, are abductions, but there are no abductions beyond the fact that in any inference the conclusion should be regarded as necessary evidence for the premises; (5) monotonicity is not only compatible with the retraction of past inferences given new information, but it is a requirement for it; (6) this explanation of inferences holds true for discovery processes, predictions and trivial inferences. (shrink)

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the (...) performance of the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. (shrink)

This paper shows how to conservatively extend classical logic with a transparent truth predicate, in the face of the paradoxes that arise as a consequence. All classical inferences are preserved, and indeed extended to the full (truth—involving) vocabulary. However, not all classical metainferences are preserved; in particular, the resulting logical system is nontransitive. Some limits on this nontransitivity are adumbrated, and two proof systems are presented and shown to be sound and complete. (One proof system allows for Cut—elimination, but (...) the other does not.). (shrink)

A key question in the philosophy of logic is how we have epistemic justification for claims about logical entailment (assuming we have such justification at all). Justification holism asserts that claims of logical entailment can only be justified in the context of an entire logical theory, e.g., classical, intuitionistic, paraconsistent, paracomplete etc. According to holism, claims of logical entailment cannot be atomistically justified as isolated statements, independently of theory choice. At present there is a developing interest in—and endorsement of—justification (...) holism due to the revival of an abductivist approach to the epistemology of logic. This paper presents an argument against holism by establishing a foundational entailment-sentence of deduction which is justified independently of theory choice and outside the context of a whole logical theory. (shrink)

In this paper we re-assess the philosophical foundation of Exactly True Logic ($$\mathcal {ET\!L}$$ ET L ), a competing variant of First Degree Entailment ($$\mathcal {FDE}$$ FDE ). In order to do this, we first rebut an argument against it. As the argument appears in an interview with Nuel Belnap himself, one of the fathers of $$\mathcal {FDE}$$ FDE, we believe its provenance to be such that it needs to be taken seriously. We submit, however, that the argument ultimately (...) fails, and that $$\mathcal {ET\!L}$$ ET L cannot easily be dismissed. We then proceed to give an overview of the research that was inspired by this logic over the last decade, thus providing further motivation for the study of $$\mathcal {ET\!L}$$ ET L and, more generally, of $$\mathcal {FDE}$$ FDE -related logics that result from semantical analyses alternative to Belnap’s canonical one. We focus, in particular, on philosophical questions that these developments raise. (shrink)

At least since Aristotle’s famous 'sea-battle' passages in On Interpretation 9, some substantial minority of philosophers has been attracted to the doctrine of the open future--the doctrine that future contingent statements are not true. But, prima facie, such views seem inconsistent with the following intuition: if something has happened, then (looking back) it was the case that it would happen. How can it be that, looking forwards, it isn’t true that there will be a sea battle, while also being true (...) that, looking backwards, it was the case that there would be a sea battle? This tension forms, in large part, what might be called the problem of future contingents. A dominant trend in temporal logic and semantic theorizing about future contingents seeks to validate both intuitions. Theorists in this tradition--including some interpretations of Aristotle, but paradigmatically, Thomason (1970), as well as more recent developments in Belnap, et. al (2001) and MacFarlane (2003, 2014)--have argued that the apparent tension between the intuitions is in fact merely apparent. In short, such theorists seek to maintain both of the following two theses: (i) the open future: Future contingents are not true, and (ii) retro-closure: From the fact that something is true, it follows that it was the case that it would be true. It is well-known that reflection on the problem of future contingents has in many ways been inspired by importantly parallel issues regarding divine foreknowledge and indeterminism. In this paper, we take up this perspective, and ask what accepting both the open future and retro-closure predicts about omniscience. When we theorize about a perfect knower, we are theorizing about what an ideal agent ought to believe. Our contention is that there isn’t an acceptable view of ideally rational belief given the assumptions of the open future and retro-closure, and thus this casts doubt on the conjunction of those assumptions. (shrink)

After a review of situation theory and previous attempts at 'computational' situation theory, we present a new programming environment, BABY-SIT, which is based on situation theory. We then demonstrate how problems requiring formal temporal reasoning can be solved in this framework. Specifically, the Yale Shooting Problem, which is commonly regarded as a canonical problem for nonmonotonic temporal reasoning, is implemented in BABY-SIT using Yoav Shoham's causal theories.

This article discusses various dangers that accompany the supposedly benign methods in behavioral evoltutionary biology and evolutionary psychology that fall under the framework of "methodological adaptationism." A "Logic of Research Questions" is proposed that aids in clarifying the reasoning problems that arise due to the framework under critique. The live, and widely practiced, " evolutionary factors" framework is offered as the key comparison and alternative. The article goes beyond the traditional critique of Stephen Jay Gould and Richard C. Lewontin, (...) to present problems such as the disappearance of evidence, the mishandling of the null hypothesis, and failures in scientific reasoning, exemplified by a case from human behavioral ecology. In conclusion the paper shows that "methodological adaptationism" does not deserve its benign reputation. (shrink)

In the fifth version of our response-paper [26] to Imamura’s criticism, we recall that NonStandard Neutrosophic Logic was never used by neutrosophic community in no application, that the quarter of century old neutrosophic operators (1995-1998) criticized by Imamura were never utilized since they were improved shortly after but he omits to tell their development, and that in real world applications we need to convert/approximate the NonStandard Analysis hyperreals, monads and binads to tiny intervals with the desired accuracy – otherwise (...) they would be inapplicable. We point out several errors and false statements by Imamura [21] with respect to the inf/sup of nonstandard subsets, also Imamura’s “rigorous definition of neutrosophic logic” is wrong and the same for his definition of nonstandard unit interval, and we prove that there is not a total order on the set of hyperreals (because of the newly introduced Neutrosophic Hyperreals that are indeterminate), whence the Transfer Principle from R to R* is questionable. After his criticism, several response publications on theoretical nonstandard neutrosophics followed in the period 2018-2022. As such, I extended the NonStandard Analysis by adding the left monad closed to the right, right monad closed to the left, pierced binad (we introduced in 1998), and unpierced binad - all these in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of NonStandard Unit Interval and NonStandard Neutrosophic Logic, together with NonStandard Neutrosophic Operators are presented. (shrink)

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that (...) deductions in normal form have the subformula property. (shrink)

Although arguments for and against competing theories of vagueness often appeal to claims about the use of vague predicates by ordinary speakers, such claims are rarely tested. An exception is Bonini et al. (1999), who report empirical results on the use of vague predicates by Italian speakers, and take the results to count in favor of epistemicism. Yet several methodological difficulties mar their experiments; we outline these problems and devise revised experiments that do not show the same results. We then (...) describe three additional empirical studies that investigate further claims in the literature on vagueness: the hypothesis that speakers confuse ‘P’ with ‘definitely P’, the relative persuasiveness of different formulations of the inductive premise of the Sorites, and the interaction of vague predicates with three different forms of negation. (shrink)

The present volume is a sequel to Deontic Logic: Introductory and Systematic Readings : its purpose is to offer a view of some of the main directions of research in contemporary deontic logic. Most of the articles included in Introductory and Systematic Readings represent what may be called the standard modal approach to deontic logic, in which de on tic logic is treated as a branch of modal logic, and the normative concepts of obligation, permission (...) and prohibition are regarded as analogous to the "alethic" modalities necessity, possibility and impossibility. As Simo Knuuttila shows in his contribution to the present volume, this approach goes back to late medieval philosophy. Several 14th century philosophers observed the analogies between deontic and alethic modalities and discussed the deontic interpretations of various laws of modal logic. In contemporary deontic logic the modal approach was revived by G. H. von Wright's classic paper 'Deontic Logic'. Certain analogies between deontic and alethic modalities are obvious and uncontroversial, but the standard approach has often been criticized on the ground that it exaggerates the analogies and tends to ignore those features of normative concepts which distinguish them from other modalities. (shrink)

In this paper, we present an expansion of one of the well-known classical inventory management models, which is the static model of inventory management without a deficit and for a single substance, based on the neutrosophic logic, where we provide through this study a basis for dealing with all data, whether specific or undefined in the field of inventory management, as it provides safe environment to manage inventory without running into deficit , and give us an approximate ideal volume (...) of inventory. Since the ideal size is affected by the rate of demand for inventory, we present in this paper a study of the rate of demand for inventory when it is not precisely refined, and we find that the indeterminate values of the demand rate cannot be ignored, because they actually affect determining the ideal size of inventory and calculating its costs, thus affecting on the efficiency of the facility and achieve great profits for it. (shrink)

This paper deals with the study of the nature of mind, its processes and its relations with the other filed known as logic, especially the contribution of most notable contemporary analytical philosophy Ludwig Wittgenstein. Wittgenstein showed a critical relation between the mind and logic. He assumed that every mental process is logical. Mental field is field of space and time and logical field is a field of reasoning (inductive and deductive). It is only with the advancement in (...) class='Hi'>logic, we are today in the era of scientific progress and technology. Logic played an important role in the cognitive part or we can say in the ‗philosophy of mind‘ that this branch is developed only because of three crucial theories i.e. rationalism, empiricism, and criticism. In this paper, it is argued that innate ideas or truth are equated with deduction and acquired truths are related with induction. This article also enhance the role of language in the makeup of the world of mind, although mind and the thought are the terms that are used by the philosophers synonymously but in this paper they are taken and interpreted differently. It shows the development in the analytical tradition subjected to the areas of mind and logic and their critical relation. (shrink)

There are many domains about which we think we are reliable. When there is prima facie reason to believe that there is no satisfying explanation of our reliability about a domain given our background views about the world, this generates a challenge to our reliability about the domain or to our background views. This is what is often called the reliability challenge for the domain. In previous work, I discussed the reliability challenges for logic and for deductive inference. I (...) argued for four main claims: First, there are reliability challenges for logic and for deduction. Second, these reliability challenges cannot be answered merely by providing an explanation of how it is that we have the logical beliefs and employ the deductive rules that we do. Third, we can explain our reliability about logic by appealing to our reliability about deduction. Fourth, there is a good prospect for providing an evolutionary explanation of the reliability of our deductive reasoning. In recent years, a number of arguments have appeared in the literature that can be applied against one or more of these four theses. In this paper, I respond to some of these arguments. In particular, I discuss arguments by Paul Horwich, Jack Woods, Dan Baras, Justin Clarke-Doane, and Hartry Field. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional (...) class='Hi'>logic with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

The paper tries to spell out a connection between deductive logic and rationality, against Harman's arguments that there is no such connection, and also against the thought that any such connection would preclude rational change in logic. One might not need to connect logic to rationality if one could view logic as the science of what preserves truth by a certain kind of necessity (or by necessity plus logical form); but the paper points out a serious (...) obstacle to any such view. (shrink)

This essay is part of larger project in which I attempt to show that Western formal logic, from its inception in Aristotle onward, has both been partially constituted by, and partially constitutive of, what has become known as racism. More specifically, (a) racist/quasi-racist/proto-racist political forces were part of the impetus for logic’s attempt to classify the world into mutually exclusive, hierarchically-valued categories in the first place; and (b) these classifications, in turn, have been deployed throughout history to justify (...) and empower racism/quasi-racism/proto-racism. In other words, (a) an important part of the chaos and messiness that so troubles logic has been the natural bio-cultural diversity of human beings as described by concepts such as race and ethnicity; and (b) once these concepts were historically in place, taken for granted, buttressed with pseudo-science, and had their origins forgotten, they became tools for the oppression of diverse human groups. The central thesis of this essay is that close readings of a variety of Leibniz’s writings (including several essays and one letter) will reveal a pattern of mutual dependency and creation in regard to logic and racism in Leibniz. My conclusion will be that there is a meaningful connection between logic and racism (or at least between logic and politics in general) in Leibniz such that one should be skeptical of his logic’s claim to offer transparent and neutral descriptions of the world as well as imperatives for action. Put differently, I want to ask the following specific question: how do Leibniz’s own racially-informed political goals, along with the emergence of race-centric European colonialism, both invest and disguise themselves within Leibniz’s mathematizing of logic? (shrink)

Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There’s little consensus, however, about how to fill out the bare-bones idea to include a characterization of logical consequence. The paper explores one methodology for choosing between the logics: pick a logic thatnorms beliefas classical consequence is standardly thought to do. The main focus of the paper considers a variant of standard supervaluational, on which we can characterizedegrees of determinacy. It applies the methodology above to focus ondegree (...) logic. This is developed first in a basic, single-premise case; and then extended to the multipremise case, and to allowdegreesof consequence. The metatheoretic properties of degree logic are set out. On the positive side, the logic is supraclassical—all classical valid sequents are degree logic valid. Strikingly, metarules such as cut and conjunction introduction fail. (shrink)

Lloyd Humberstone’s recently published Philosophical Applications of Modal Logic presents a number of new ideas in modal logic as well explication and critique of recent work of many others. We extend some of these ideas and answer some questions that are left open in the book.

In this paper, we present a survey of the development of the technique of argument diagramming covering not only the fields in which it originated - informal logic, argumentation theory, evidence law and legal reasoning – but also more recent work in applying and developing it in computer science and artificial intelligence. Beginning with a simple example of an everyday argument, we present an analysis of it visualised as an argument diagram constructed using a software tool. In the context (...) of a brief history of the development of diagramming, it is then shown how argument diagrams have been used to analyze and work with argumentation in law, philosophy and artificial intelligence. (shrink)

What is the concept of sense developed by Deleuze in his 1969 Logic of Sense? This paper attempts to answer this question analysing the three dimensions of language that Deleuze isolates: the primary order of noises and intensities ; the secondary order of sense ; and the tertiary organisation of propositions. What renders language possible is that which separates sounds from bodies and organises them into propositions, freeing them for the expressive function. Deleuze argues that it is the dimension (...) of sense that brings about this genesis of language, and he analyses in detail the three syntheses that bring about the production of this surface of sense. Yet Deleuze also distinguishes between two types of non-sense: the nonsense of Lewis Carroll's portmanteau words, which remain ensconced in the dimension of sense, and the more profound nonsense of Antonin Artaud's psychotic scream-breaths, which penetrate the almost unbearable world of the primary order of noise and intensities. In the end, the focus of Logic of Sense is less the surface domain of sense than the primary depth of corporeal intensities. What Deleuze calls a ‘minor’ use of language is nothing other than an intensive use of language that constitutes a principle of metamorphosis. (shrink)

In this paper we distinguish between various kinds of doxastic theories. One distinction is between informal and formal doxastic theories. AGM-type theories of belief change are of the former kind, while Hintikka’s logic of knowledge and belief is of the latter. Then we distinguish between static theories that study the unchanging beliefs of a certain agent and dynamic theories that investigate not only the constraints that can reasonably be imposed on the doxastic states of a rational agent but also (...) rationality constraints on the changes of doxastic state that may occur in such agents. An additional distinction is that between non-introspective theories and introspective ones. Non-introspective theories investigate agents that have opinions about the external world but no higher-order opinions about their own doxasticnstates. Standard AGM-type theories as well as the currently existing versions of Segerberg’s dynamic doxastic logic (DDL) are non-introspective. Hintikka-style doxastic logic is of course introspective but it is a static theory. Thus, the challenge remains to devise doxastic theories that are both dynamic and introspective. We outline the semantics for truly introspective dynamic doxastic logic, i.e., a dynamic doxastic logic that allows us to describe agents who have both the ability to form higher-order beliefs and to reflect upon and change their minds about their own (higher-order) beliefs. This extension of DDL demands that we give up the Preservation condition on revision. We make some suggestions as to how such a non-preservative revision operation can be constructed. We also consider extending DDL with conditionals satisfying the Ramsey test and show that Gärdenfors’ well-known impossibility result applies to such a framework. Also in this case, Preservation has to be given up. (shrink)

forall x: Calgary is a full-featured textbook on formal logic. It covers key notions of logic such as consequence and validity of arguments, the syntax of truth-functional propositional logic TFL and truth-table semantics, the syntax of first-order (predicate) logic FOL with identity (first-order interpretations), symbolizing English in TFL and FOL, and Fitch-style natural deduction proof systems for both TFL and FOL. It also deals with some advanced topics such as modal logic, soundness, and functional completeness. (...) Exercises with solutions are available. It is provided in PDF (for screen reading, printing, and a special version for dyslexics), HTML, and in LaTeX source code. (shrink)

(1) This paper is about how to build an account of the normativity of logic around the claim that logic is constitutive of thinking. I take the claim that logic is constitutive of thinking to mean that representational activity must tend to conform to logic to count as thinking. (2) I develop a natural line of thought about how to develop the constitutive position into an account of logical normativity by drawing on constitutivism in metaethics. (3) (...) I argue that, while this line of thought provides some insights, it is importantly incomplete, as it is unable to explain why we should think. I consider two attempts at rescuing the line of thought. The first, unsuccessful response is that it is self-defeating to ask why we ought to think. The second response is that we need to think. But this response secures normativity only if thinking has some connection to human flourishing. (4) I argue that thinking is necessary for human flourishing. Logic is normative because it is constitutive of this good. (5) I show that the resulting account deals nicely with problems that vex other accounts of logical normativity. (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; (...) and (iii) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

We are reliable about logic in the sense that we by-and-large believe logical truths and disbelieve logical falsehoods. Given that logic is an objective subject matter, it is difficult to provide a satisfying explanation of our reliability. This generates a significant epistemological challenge, analogous to the well-known Benacerraf-Field problem for mathematical Platonism. One initially plausible way to answer the challenge is to appeal to evolution by natural selection. The central idea is that being able to correctly deductively reason (...) conferred a heritable survival advantage upon our ancestors. However, there are several arguments that purport to show that evolutionary accounts cannot even in principle explain how it is that we are reliable about logic. In this paper, I address these arguments. I show that there is no general reason to think that evolutionary accounts are incapable of explaining our reliability about logic. (shrink)

George Boole emerged from the British tradition of the “New Analytic”, known for the view that the laws of logic are laws of thought. Logicians in the New Analytic tradition were influenced by the work of Immanuel Kant, and by the German logicians Wilhelm Traugott Krug and Wilhelm Esser, among others. In his 1854 work An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities, Boole argues that the laws of (...) thought acquire normative force when constrained to mathematical reasoning. Boole’s motivation is, first, to address issues in the foundations of mathematics, including the relationship between arithmetic and algebra, and the study and application of differential equations (Durand-Richard, van Evra, Panteki). Second, Boole intended to derive the laws of logic from the laws of the operation of the human mind, and to show that these laws were valid of algebra and of logic both, when applied to a restricted domain. Boole’s thorough and flexible work in these areas influenced the development of model theory (see Hodges, forthcoming), and has much in common with contemporary inferentialist approaches to logic (found in, e.g., Peregrin and Resnik). (shrink)

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell, but the system, based on a different choice of axioms, is better described as a Mendelson system augmented with axiom schemes for K, T, S4, and B, and the necessitation rule as a rule of inference. The language has the false and implication as the only primitive (...) logical connectives and necessity as the only primitive modal operator. The full source code is available online and has been typechecked with Lean 3.4.2. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in (...) particular, Löwenheim and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)