This paper introduces a novel strategy for responding to skeptical arguments based on the epistemic possibility of error or lack of certainty. I show that a nonclassical logic motivated by recent work on epistemic modals can be used to render such skeptical arguments invalid. That is, one can grant that knowledge is incompatible with the possibility of error and grant that error is possible, all while avoiding the skeptic’s conclusion that we lack knowledge.

Revisionary theories of logic or truth require revisionary theories of mind. This essay outlines nonclassically based theories of rational belief, desire, and decision making, singling out the supervaluational family for special attention. To see these nonclassical theories of mind in action, this essay examines a debate between David Lewis and Derek Parfit over what matters in survival. Lewis argued that indeterminacy in personal identity allows caring about psychological connectedness and caring about personal identity to amount to the same (...) thing. The essay argues that Lewis's treatment of two of Parfit's puzzle cases—degreed survival and fission—presuppose different nonclassical treatments of belief and desire. (shrink)

Joyce (1998) gives an argument for probabilism: the doctrine that rational credences should conform to the axioms of probability. In doing so, he provides a distinctive take on how the normative force of probabilism relates to the injunction to believe what is true. But Joyce presupposes that the truth values of the propositions over which credences are defined are classical. I generalize the core of Joyce’s argument to remove this presupposition. On the same assumptions as Joyce uses, the credences of (...) a rational agent should always be weighted averages of truth value assignments. In the special case where the truth values are classical, the weighted averages of truth value assignments are exactly the probability functions. But in the more general case, probabilistic axioms formulated in terms of classical logic are violated—but we will show that generalized versions of the axioms formulated in terms of non-classical logics are satisfied. (shrink)

What is commonly referred to as the Adoption Problem is a challenge to the idea that the principles of logic can be rationally revised. The argument is based on a reconstruction of unpublished work by Saul Kripke. As the reconstruction has it, Kripke extends the scope of Willard van Orman Quine's regress argument against conventionalism to the possibility of adopting new logical principles. In this paper we want to discuss the scope of this challenge. Are all revisions of (...) class='Hi'>logic subject to the Adoption Problem? If not, are there significant cases of logical revision that are subject to the Adoption Problem? We will argue that both questions should be answered negatively. (shrink)

The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are (...) identical. In this paper we examine the prospects for obtaining a satisfactory naive theory of classes. We start from a result by Ross Brady, which demonstrates the consistency of something resembling a naive theory of classes. We generalize Brady’s result somewhat and extend it to a recent system developed by Andrew Bacon. All of the theories we prove consistent contain an extensionality rule or axiom. But we argue that given the background logics, the relevant extensionality principles are too weak. For example, in some of these theories, there are universal classes which are not declared coextensive. We elucidate some very modest demands on extensionality, designed to rule out this kind of pathology. But we close by proving that even these modest demands cannot be jointly satisfied. In light of this new impossibility result, the prospects for a naive theory of classes are bleak. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach (...) can be naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

The review gives a short description of the content of the book and discusses the treatment of conditionals in it.

We here make preliminary investigations into the model theory of DeMorgan logics. We demonstrate that Łoś's Theorem holds with respect to these logics and make some remarks about standard model-theoretic properties in such contexts. More concretely, as a case study we examine the fate of Cantor's Theorem that the classical theory of dense linear orderings without endpoints is $\aleph_{0}$-categorical, and we show that the taking of ultraproducts commutes with respect to previously established methods of constructing nonclassical structures, namely, Priest's (...) Collapsing Lemma and Dunn's Theorem in 3-Valued Logic. (shrink)

In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been (...) made to axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

Entailment is an interesting sigmatoid: It should mean one thing, but it means another, just for starters. When used in Mathematics, it is usually with the sense of saying that something is definitely true. That would be the use in Classical Logic then. When used in Logic, it became something else. Now it was about how the logical system, which can be any nonclassical one, could be making a proposition become true or false. The major issue we (...) found in 2000, when learning from the own nonclassicists what they do, was that they talk about Nonclassical Logic, therefore a way of thinking that is not Cartesian, yet they stick to the notion of entailment we use in Mathematics, and therefore to the Classical Logic ways. We here discuss exactly this. (shrink)

In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The (...) definition of compositionality these accounts use, however, is too strong, as the standard translation from modal logic to first-order logic is not compositional in this sense. In light of this, we will explore a weaker version of this notion that we will call schematicity and show that there is no schematic translation either from first-order logic to propositional logic or from intuitionistic logic to classical logic. (shrink)

True contradictions are taken increasingly seriously by philosophers and logicians. Yet, the belief that contradictions are always false remains deeply intuitive. This paper confronts this belief head-on by explaining in detail how one specific contradiction is true. The contradiction in question derives from Priest's reworking of Berkeley's argument for idealism. However, technical aspects of the explanation offered here differ considerably from Priest's derivation. The explanation uses novel formal and epistemological tools to guide the reader through a valid argument with, not (...) just true, but eminently acceptable premises, to an admittedly unusual conclusion: a true contradiction. The novel formal and epistemological tools concern points of view and changes in points of view. The result is an understanding of why the contradiction is true. (shrink)

The first degree entailment (FDE) family is a group of logics, a many-valued semantics for each system of which is obtained from classical logic by adding to the classical truth-values true and false any subset of {both, neither, indeterminate}, where indeterminate is an infectious value (any formula containing a subformula with the value indeterminate itself has the value indeterminate). In this paper, we see how to extend a version of star semantics for the logics whose many-valued semantics lack indeterminate (...) to star semantics for logics whose many-valued semantics include indeterminate. The equivalence of the many-valued semantics and star semantics is established by way of a soundness and completeness proof. The upshot of the novel semantics in terms of the applied semantics of these logics, and specifically infectiousness, is explored, settling on the idea that infectiousness concerns ineffability. (shrink)

*These notes were folded into the published paper "Probability and nonclassical logic*. Revising semantics and logic has consequences for the theory of mind. Standard formal treatments of rational belief and desire make classical assumptions. If we are to challenge the presuppositions, we indicate what is kind of theory is going to take their place. Consider probability theory interpreted as an account of ideal partial belief. But if some propositions are neither true nor false, or are half true, (...) or whatever—then it’s far from clear that our degrees of belief in it and its negation should sum to 1, as classical probability theory requires (?, cf.). There are extant proposals in the literature for generalizing (categorical) probability theory to a non-classical setting, and we will use these below. But subjective probabilities themselves stand in functional relations to other mental states, and we need to trace the knock-on consequences of revisionism for this interrelationship (arguably, degrees of belief only count as kinds of belief in virtue of standing in these functional relationships). (shrink)

We present in this paper the neutrosophic randomized variables, which are a generalization of the classical random variables obtained from the application of the neutrosophic logic (a new nonclassical logic which was founded by the American philosopher and mathematical Florentin Smarandache, which he introduced as a generalization of fuzzy logic especially the intuitionistic fuzzy logic ) on classical random variables. The neutrosophic random variable is changed because of the randomization, the indeterminacy and the values it (...) takes, which represent the possible results and the possible indeterminacy. Then we classify the neutrosophic randomized variables into two types of discrete and continuous neutrosophic random variables and we define the expected value and variance of the neutrosophic random variable then offer some illustrative examples. -/- . (shrink)

Graham Priest's book In Contradiction is a bold defense of the existence of true contradictions. Although Priest's case is impressive, and many of his arguments are correct, his approach is not the only one allowing for true contradictions. As against Priest's, there is at least one contradictorialist approach which establishes a link between true contradictions and degrees of truth. All in all, such an alternative is more conservative, closer to mainstream analytical philosophy. The two approaches differ as regards the floodgate (...) problem. Priest espouses a confinement policy banning contradictions except in a few special domains, particularly those of pure semantics and set-theory , whereas the alternative approach admits two negations -- natural or weak negation and strong negation, the latter being classical; accordingly, the alternative approach prohibits any contradiction involving strong negation, thus providing a syntactic test of what contradictions have to be rejected. (shrink)

This article is devoted to the topical aspects of the transformation of society, science, and man in the context of E. László’s work «Macroshift». The author offers his own attempt to consider the attributes of macroshift and then use these attributes to operationalize further analysis, highlighting three essential elements: the world has come to a situation of technological indistinguishability between the natural and the artificial, to machines that know everything about humans. Antiquity aspired to beauty and saw beauty in realistic (...) art, but technology made indistinguishability possible, bringing the risks of deepfakes and post-truth. Following J. Bernal’s logic, the author distinguishes between different types of the future, comparing them with the Kantian triad of ethical questions: (1) What can we know? (2) What should we do? (3) What can I hope for? Under these conditions, the fact that technology has become a real tool of geopolitics is no longer just a matter for discussion, but a subject of deep philosophical consideration. AI is becoming not only an opportunity, but also a threat, on a scale that has never been seen before in our civilizational history. Therefore, the former, linear development of science gives way to nonlinearity. Society in the macroshift will be radically transformed, and the author identifies five main transformations of the current macroshift. The post-nonclassical approach in the analysis of scenarios for modeling the future, both accidentally possible and preferred, is becoming the most important tool of futurology and prognostics. The author describes the future around five social trends that will determine the economy and society of the coming decades. In addition, opportunities for the future development of science are proposed, subject to significant penetration of AI technologies. These technologies will have a fundamental impact on all aspects of our society, economy, and human existence. (shrink)

We here propose a solution to the problem we have raised. Basically, the mathematical notion of entailment seems to be connected to the inferential rules from Classical Logic, so that if we have P: x belongs to the reals, and Q: x+2=5 => x=3, P |= Q. Notwithstanding, we would also have that if P: x belongs to the interval (7,10), and Q: x+2=5 => x=3, P |= Q. The second instance of entailment does not seem to be justifiable (...) if our intuition is consulted: Even though we could say that absurdity implies anything in Classical Logic, entailment should be a concept that belongs to the metalogic, not to the logic of the system, so that we should not be inside of the Classical Logic World by the time we assess things in what regards entailment. As another point, our discussions in Entailment led us to choose the sense has as a consequence for entailment, so that it is not really acceptable that we have, as a consequence, using normal language, of x being inside of the real interval (7,10) that if x+2=5, then x=3. If x is in that interval, x+2 should not be 5, unless we are talking about moduli of vectors. However, when we transfer to Classical Logic, in having the antecedent false, and the consequent false as well, we have that the implication, which some call material, is true. We here discuss this sort of matter in detail, and hope to get to the bottom of the issue, and perhaps to a universal solution. (shrink)

Why should we be means-end rational? Why care whether someone’s mental states exhibit certain formal patterns, like the ones formalized in causal decision theory? This paper establishes a dominance argument for these constraints in a finite setting. If you violate the norms of causal decision theory, then your desires will be aptness dominated. That is, there will be some alternative set of desires that you could have had, which would be more apt (closer to the actual values fixed by your (...) sensibility/ what you intrinsically care about) no matter which world is actual. If we care about having apt desires, then, we should never let ourselves violate these norms of means-end rationality. This argument shares a form with now-standard accuracy arguments for probabilism, opening up a new terrain for that discussion. I show that the foundational assumptions about the shape of accuracy and of aptness required to run the arguments for means-end rationality and for probabilism run closely parallel. I show the argument is robust under different theories of subjective actual value, including nonclassical treatments of indeterminacy in actual value; I show the argument may (but need not!) be generalized to objective theories of value. The upshot is that aptness-domination arguments for decision theories should be added to the philosophical playbook. (shrink)

The operational semantics of Urquhart is a deep and important part of the development of relevant logics. In this paper, I present an overview of work on Urquhart’s operational semantics. I then present the basics of collection frames. Finally, I show how one kind of collection frame, namely, functional set frames, is equivalent to Urquhart’s semilattice semantics.

Consider the set of inferences that are acceptable to use in all our theory building endeavors. Call this set of inferences the universal theory building toolkit, or just ’the toolkit’ for short. It is clear that the toolkit is tightly connected to logic in a variety of ways. Beall, for example, has argued that logic just is the toolkit. This paper avoids making a stand on that issue and instead investigates reasons for thinking that, logic or not, (...) the toolkit is substructural. It is presented as a dialogue for the simple reason that it summarizes a range of dialogues on this subject that the author has had with various folks over the past few years. The method I use to investigate the toolkit is inspired in both philosophical and technical details by Alasdair Urquhart’s work on semantics for relevance logics from the early 1970s. (shrink)

Consider the set of inferences that are acceptable to use in all our theory building endeavors. Call this set of inferences the universal theory building toolkit, or just ’the toolkit’ for short. It is clear that the toolkit is tightly connected to logic in a variety of ways. Beall, for example, has argued that logic just is the toolkit. This paper avoids making a stand on that issue and instead investigates reasons for thinking that, logic or not, (...) the toolkit is substructural. It is presented as a dialogue for the simple reason that it summarizes a range of dialogues on this subject that the author has had with various folks over the past few years. The method I use to investigate the toolkit is inspired in both philosophical and technical details by Alasdair Urquhart’s work on semantics for relevance logics from the early 1970s. (shrink)

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 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)

In this paper I investigate how differences in approach to truth and logic (in particular, a deflationist vs. a substantivist approach to these fields) affect philosophers’ views concerning pluralism and normativity in these fields. My perspective on truth and logic is largely epistemic, focusing on the role of truth in knowledge (rather than on the use of the words “true” and “truth” in natural language), and my reference group includes Carnap (1934), Harman (1986), Horwich (1990), Wright (1992), Beall (...) and Restall (2006), Field (2009), Lynch (2009), and Sher (2016a).1 Whenever possible, I focus on positive rather than negative views on the issues involved, although in some cases this is not possible. (shrink)

Many theories of rational belief give a special place to logic. They say that an ideally rational agent would never be uncertain about logical facts. In short: they say that ideal rationality requires "logical omniscience." Here I argue against the view that ideal rationality requires logical omniscience on the grounds that the requirement of logical omniscience can come into conflict with the requirement to proportion one’s beliefs to the evidence. I proceed in two steps. First, I rehearse an influential (...) line of argument from the "higher-order evidence" debate, which purports to show that it would be dogmatic, even for a cognitively infallible agent, to refuse to revise her beliefs about logical matters in response to evidence indicating that those beliefs are irrational. Second, I defend this "anti-dogmatism" argument against two responses put forth by Declan Smithies and David Christensen. Against Smithies’ response, I argue that it leads to irrational self-ascriptions of epistemic luck, and that it obscures the distinction between propositional and doxastic justification. Against Christensen’s response, I argue that it clashes with one of two attractive deontic principles, and that it is extensionally inadequate. Taken together, these criticisms will suggest that the connection between logic and rationality cannot be what it is standardly taken to be—ideal rationality does not require logical omniscience. (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)

Gila Sher interviewed by Chen Bo: -/- I. Academic Background and Earlier Research: 1. Sher’s early years. 2. Intellectual influence: Kant, Quine, and Tarski. 3. Origin and main Ideas of The Bounds of Logic. 4. Branching quantifiers and IF logic. 5. Preparation for the next step. -/- II. Foundational Holism and a Post-Quinean Model of Knowledge: 1. General characterization of foundational holism. 2. Circularity, infinite regress, and philosophical arguments. 3. Comparing foundational holism and foundherentism. 4. A post-Quinean model (...) of knowledge. 5. Intellect and figuring out. 6. Comparing foundational holism with Quine’s holism. 7. Evaluation of Quine’s Philosophy -/- III. Substantive Theory of Truth and Relevant Issues: 1. Outline of Sher’s substantive theory of truth. 2. Criticism of deflationism and treatment of the Liar. 3. Comparing Sher’s substantive theory of truth with Tarski’s theory of truth. -/- IV. A New Philosophy of Logic and Comparison with Other Theories: 1. Foundational account of logic. 2. Standard of logicality, set theory and logic. 3. Psychologism, Hanna’s and Maddy’s conceptions of logic. 4. Quine’s theses about the revisability of logic. -/- V. Epilogue. (shrink)

In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is (...) directly motivated in terms of the simple, universal Kripke semantics for S5. The sequent system is cut-free and the circuit proofs are normalising. (shrink)

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule for (...) implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic. (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)

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)

In this paper, I set out some basic elements of a deontic logic with an implementation appropriate for handling conflicting legal obligations for purposes of programming autonomous machine agents. Kantian justice demands that the prescriptive system of enforceable public laws be consistent, yet statutes or case holdings may often describe legal obligations that contradict; moreover, even fundamental constitutional rights may come into conflict. I argue that a deontic logic of the law should not try to work around such (...) conflicts but, instead, identify and expose them so that the rights and duties that generate inconsistencies in public law can be explicitly qualified and the conflicts resolved. I then argue that a credulous, non-monotonic deontic logic can describe inconsistent legal obligations while meeting Kant’s demand for consistency in the prescriptive system of public law. Finally, I propose an implementation of this logic via a modified form of “answer set programming,” which I demonstrate with some simple examples. (shrink)

This brief note corrects an error in one of the reduction steps in my paper 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks' published in the Journal of Applied Logics 8/2 (2021): 531-556.

Max Cresswell and Hilary Putnam seem to hold the view, often shared by classical logicians, that paraconsistent logic has not been made sense of, despite its well-developed mathematics. In this paper, I examine the nature of logic in order to understand what it means to make sense of logic. I then show that, just as one can make sense of non-normal modal logics (as Cresswell demonstrates), we can make `sense' of paraconsistent logic. Finally, I turn the (...) tables on classical logicians and ask what sense can be made of explosive reasoning. While I acknowledge a bias on this issue, it is not clear that even classical logicians can answer this question. (shrink)

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces generic theories for propositional modal (...) logic to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making. (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)

Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow (...) double negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (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)

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)

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist reasoning, (...) since they do not only internalize processes of verifcation or provability but also the dual processes in terms of falsifcation or what is called dual provability. In [Wansing, 2017] a normal form theorem for N2Int is stated, here, I want to prove a cut-elimination theorem for SC2Int, i.e., if successful, this would extend the results existing so far. (shrink)

Lewis (1968) claims that his language of Counterpart Theory (CT) interprets modal discourse and he adverts to a translation scheme from the language of Quantifed Modal Logic (QML) to CT. However, everybody now agrees that his original translation scheme does not always work, since it does not always preserve the ‘intuitive’ meaning of the translated QML-formulas. Lewis discusses this problem with regard to the Necessitist Thesis, and I will extend his discourse to the analysis of the Converse Barcan Formula. (...) Everyone also agrees that there are CT-formulas that can express the QMLcontent that gets lost through the translation. The problem is how we arrive to them. In this paper, I propose new translation rules from QML to CT, based on a suggestion by Kaplan. However, I will claim that we cannot have ‘the’ translation scheme from QML to CT. The reason being that de re modal language is ambiguous. Accordingly, there are diferent sorts of QML, depending on how we resolve such ambiguity. Therefore, depending on what sort of QML we intend to translate into CT, we need to use the corresponding translation scheme. This suggests that all the translation problems might just disappear if we do what Lewis did not: begin with a fully worked out QML that tells us how to understand de re modal discourse. (shrink)

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)

What methodological approaches do research programs use to investigate the world? Elisabeth Lloyd’s Logic of Research Questions (LRQ) characterizes such approaches in terms of the questions that the researchers ask and causal factors they consider. She uses the Logic of Research Questions Framework to criticize adaptationist programs in evolutionary biology for dogmatically assuming selection explanations of the traits of organisms. I argue that Lloyd’s general criticism of methodological adaptationism is an artefact of the impoverished LRQ. My Ordered Factors (...) Proposal extends the LRQ to characterize approaches with sequences of questions and factors. I highlight the importance that ordering one’s investigation plays in approaches at the level of adaptationism by analyzing two research programs in community ecology: competitionists and neutralists. Competitionists and neutralists take opposed starting points and use explanatory and developmental heuristics to consider more factors in due time. On the Ordered Factors Proposal, these approaches are not only the ecological factors they are open to considering but also the order in which they will consider them. My disagreement with Lloyd’s over how to characterize methodological approaches reflects different views about methodological monism and pluralism. (shrink)

The idea that logic is in some sense normative for thought and reasoning is a familiar one. Some of the most prominent figures in the history of philosophy including Kant and Frege have been among its defenders. The most natural way of spelling out this idea is to formulate wide-scope deductive requirements on belief which rule out certain states as irrational. But what can account for the truth of such deductive requirements of rationality? By far, the most prominent responses (...) draw in one way or another on the idea that belief aims at the truth. In this paper, I consider two ways of making this line of thought more precise and I argue that they both fail. In particular, I examine a recent attempt by Epistemic Utility Theory to give a veritist account of deductive coherence requirements. I argue that despite its proponents’ best efforts, Epistemic Utility Theory cannot vindicate such requirements. (shrink)

While there is a growing philosophical interest in analysing olfactory experiences, the mereological structure of odours considered in respect of how they are perceptually experienced has not yet been extensively investigated. The paper argues that odours are perceptually experienced as having a mereological structure, but this structure is significantly different from the spatial mereological structure of visually experienced objects. Most importantly, in the case of the olfactory part-structure, the classical weak supplementation principle is not satisfied. This thesis is justified by (...) referring to empirical results in olfactory science concerning the human ability to identify components in complex olfactory stimuli. Further, it is shown how differences between olfactory and visual mereologies may arise from the way in which these modalities represent space. (shrink)

Imperatives cannot be true or false, so they are shunned by logicians. And yet imperatives can be combined by logical connectives: "kiss me and hug me" is the conjunction of "kiss me" with "hug me". This example may suggest that declarative and imperative logic are isomorphic: just as the conjunction of two declaratives is true exactly if both conjuncts are true, the conjunction of two imperatives is satisfied exactly if both conjuncts are satisfied—what more is there to say? Much (...) more, I argue. "If you love me, kiss me", a conditional imperative, mixes a declarative antecedent ("you love me") with an imperative consequent ("kiss me"); it is satisfied if you love and kiss me, violated if you love but don't kiss me, and avoided if you don't love me. So we need a logic of three -valued imperatives which mixes declaratives with imperatives. I develop such a logic. (shrink)