Thinking about misleading higher-order evidence naturally leads to a puzzle about epistemic rationality: If one’s total evidence can be radically misleading regarding itself, then two widely-accepted requirements of rationality come into conflict, suggesting that there are rational dilemmas. This paper focuses on an often misunderstood and underexplored response to this (and similar) puzzles, the so-called conflicting-ideals view. Drawing on work from defeasible logic, I propose understanding this view as a move away from the default metaepistemological position according to (...) which rationality requirements are strict and governed by a strong, but never explicitly stated logic, toward the more unconventional view, according to which requirements are defeasible and governed by a comparatively weak logic. When understood this way, the response is not committed to dilemmas. (shrink)

We contend that it is possible to argue reasonably for and against arguments from classifications and definitions, provided they are seen as defeasible (subject to exceptions and critical questioning). Arguments from classification of the most common sorts are shown to be based on defeasible reasoning of various kinds represented by patterns of logical reasoning called defeasible argumentation schemes. We show how such schemes can be identified with heuristics, or short-cut solutions to a problem. We examine a variety (...) of arguments of this sort, including argument from abductive classification, argument from causal classification, argument from analogy-based classification and arguments from classification based on generalizations. (shrink)

The applicability of Bayesian conditionalization in setting one’s posterior probability for a proposition, α, is limited to cases where the value of a corresponding prior probability, PPRI(α|∧E), is available, where ∧E represents one’s complete body of evidence. In order to extend probability updating to cases where the prior probabilities needed for Bayesian conditionalization are unavailable, I introduce an inference schema, defeasible conditionalization, which allows one to update one’s personal probability in a proposition by conditioning on a proposition that represents (...) a proper subset of one’s complete body of evidence. While defeasible conditionalization has wider applicability than standard Bayesian conditionalization (since it may be used when the value of a relevant prior probability, PPRI(α|∧E), is unavailable), there are circumstances under which some instances of defeasible conditionalization are unreasonable. To address this difficulty, I outline the conditions under which instances of defeasible conditionalization are defeated. To conclude the article, I suggest that the prescriptions of direct inference and statistical induction can be encoded within the proposed system of probability updating, by the selection of intuitively reasonable prior probabilities. (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)

According to informal logic, the possibilities of deductive logic as a tool for analysing and evaluating ordinary arguments are very limited. While I agree with this claim in general, I question it in the case of the argument from cause to effect. In this paper I first show, on the basis of carefully chosen examples, that we usually react differently to falsification of the conclusion of the argument from cause to effect than we do to the falsification of (...) the conclusion of other defeasible arguments. I then identify general conditions and assumptions under which the causal argument from cause to effect can be reconstructed as deductive. Finally, I compare the causal argument with the expert argument, which is a typical example of a defeasible argument in the narrower sense. (shrink)

In this chapter, we begin by sketching in the broadest possible strokes the ideas behind two formal systems that have been introduced with to goal of explicating the ways in which reasons interact to support the actions and conclusions they do. The first of these is the theory of defeasible reasoning developed in the seminal work of Pollock; the second is a more recent theory due to Horty, which adapts and develops the default logic introduced by Reiter to (...) provide an account of reasons. However, the implementations are complex enough, in both cases, to prevent anything more than this sketch. And we would not want to give the impression that we think that work on the logic of reasons must follow the path mapped out in either of these theories—indeed, we feel that the field is wide open. In the remainder of the chapter, therefore, will concentrate on a number of issues bearing on the logic of reasons that are either not treated in the work of Pollock and Horty, or whose treatment there is, we feel, either inadequate or incomplete. These are: first, the question of whether it is necessary to understand logical interactions among reasons themselves, rather than simply between reasons and the actions or conclusions they support, and if so, what principles might govern these interactions; second, priority relations among reasons and the notion of reason accrual; and third, some problems posed by undercutting defeat. (shrink)

We present two defeasible logics of norm-propositions (statements about norms) that (i) consistently allow for the possibility of normative gaps and normative conflicts, and (ii) map each premise set to a sufficiently rich consequence set. In order to meet (i), we define the logic LNP, a conflict- and gap-tolerant logic of norm-propositions capable of formalizing both normative conflicts and normative gaps within the object language. Next, we strengthen LNP within the adaptive logic framework for non-monotonic reasoning (...) in order to meet (ii). This results in the adaptive logics LNPr and LNPm, which interpret a given set of premises in such a way that normative conflicts and normative gaps are avoided ‘whenever possible’. LNPr and LNPm are equipped with a preferential semantics and a dynamic proof theory. (shrink)

In this paper, by suggesting a formal representation of science based on recent advances in logic-based Artificial Intelligence (AI), we show how three serious concerns around the realisation of traditional scientific realism (the theory/observation distinction, over-determination of theories by data, and theory revision) can be overcome such that traditional realism is given a new guise as ‘naturalised’. We contend that such issues can be dealt with (in the context of scientific realism) by developing a formal representation of science based (...) on the application of the following tools from Knowledge Representation: the family of Description Logics, an enrichment of classical logics via defeasible statements, and an application of the preferential interpretation of the approach to Belief Revision. (shrink)

We propose a solution to the problem of logical omniscience in what we take to be its fundamental version: as concerning arbitrary agents and the knowledge attitude per se. Our logic of knowledge is a spin-off from a general theory of thick content, whereby the content of a sentence has two components: an intension, taking care of truth conditions; and a topic, taking care of subject matter. We present a list of plausible logical validities and invalidities for the (...) class='Hi'>logic of knowledge per se for arbitrary agents, and isolate three explanatory factors for them: the topic-sensitivity of content; the fragmentation of knowledge states; the defeasibility of knowledge acquisition. We then present a novel dynamic epistemic logic that yields precisely the desired validities and invalidities, for which we provide expressivity and completeness results. We contrast this with related systems and address possible objections. (shrink)

This paper discusses some key connexive principles construed as principles about reasons, that is, as principles that express logical properties of sentences of the form ‘_p_ is a reason for _q_’. Its main goal is to show how the theory of reasons outlined by Crupi and Iacona, which is based on their evidential account of conditionals, yields a formal treatment of such sentences that validates a restricted version of the principles discussed, overcoming some limitations that affect most extant accounts of (...) conditionals. (shrink)

J. L. Schellenberg, in “A New Logical Problem of Evil,” published in The Blackwell Companion to the Problem of Evil, argues that (if God exists) God has, of necessity, a disappreciation of evil, operating at a metalevel in such a way as to give God a non-defeasible reason to rule out actualizing a world containing evil. He also argues that since God’s motive in creating the world is to share with finite beings the good that God experiences prior to (...) creation, which is good without evil, it follows that God will create a world that contains no evil. I investigate in detail the foregoing lines of argument and provide grounds for rejecting them. My paper is published in Vol 38 No.2, whose date is nominally April 2021 although the issue is not in fact available yet. (shrink)

Dual-role approaches to reasons say, roughly, that reasons can relate to actions in two fundamentally different ways: they can either require conformity, or justify an action without requiring that it be taken. This paper develops a formal dual-role approach, combining ideas from defeasible logic and practical philosophy. It then uses the approach to shed light on the phenomenon of supererogation and resolve a well-known puzzle about supererogation, namely, Horton’s All or Nothing Problem.

According to conciliatory views on the significance of disagreement, it’s rational for you to become less confident in your take on an issue in case your epistemic peer’s take on it is different. These views are intuitively appealing, but they also face a powerful objection: in scenarios that involve disagreements over their own correctness, conciliatory views appear to self-defeat and, thereby, issue inconsistent recommendations. This paper provides a response to this objection. Drawing on the work from defeasible logics paradigm (...) and abstract argumentation, it develops a formal model of conciliatory reasoning and explores its behavior in the troubling scenarios. The model suggests that the recommendations that conciliatory views issue in such scenarios are perfectly reasonable—even if outwardly they may look odd. (shrink)

It is quite plausible to say that you may read or write implies that you may read and you may write (though possibly not both at once). This so-called free choice principle is well-known in deontic logic. Sadly, despite being so intuitive and seemingly innocent, this principle causes a lot of worries. The paper briefly but critically examines leading accounts of free choice permission present in the literature. Subsequently, the paper suggests to accept the free choice principle, but only (...) as a default (or defeasible) rule, issuing to it a ticket-of-leave, granting it some freedom, until it commits an undesired inference. (shrink)

Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is (...) determined dynamically during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly. (shrink)

In this article, we redefine classical notions of theory reduction in such a way that model-theoretic preferential semantics becomes part of a realist depiction of this aspect of science. We offer a model-theoretic reconstruction of science in which theory succession or reduction is often better - or at a finer level of analysis - interpreted as the result of model succession or reduction. This analysis leads to 'defeasible reduction', defined as follows: The conjunction of the assumptions of a reducing (...) theory T with the definitions translating the vocabulary of a reduced theory T' to the vocabulary of T, defeasibly entails the assumptions of reduced T'. This relation of defeasible reduction offers, in the context of additional knowledge becoming available, articulation of a more flexible kind of reduction in theory development than in the classical case. Also, defeasible reduction is shown to solve the problems of entailment that classical homogeneous reduction encounters. Reduction in the defeasible sense is a practical device for studying the processes of science, since it is about highlighting different aspects of the same theory at different times of application, rather than about naive dreams concerning a metaphysical unity of science. (shrink)

This paper offers a probabilistic treatment of the conditions for argument cogency as endorsed in informal logic: acceptability, relevance, and sufficiency. Treating a natural language argument as a reason-claim-complex, our analysis identifies content features of defeasible argument on which the RSA conditions depend, namely: change in the commitment to the reason, the reason’s sensitivity and selectivity to the claim, one’s prior commitment to the claim, and the contextually determined thresholds of acceptability for reasons and for claims. Results contrast (...) with, and may indeed serve to correct, the informal understanding and applications of the RSA criteria concerning their conceptual dependence, their function as update-thresholds, and their status as obligatory rather than permissive norms, but also show how these formal and informal normative approachs can in fact align. (shrink)

This paper argues that a priori justification is, in principle, compatible with naturalism—if the a priori is understood in a way that is free of the inessential properties that, historically, have been associated with the concept. I argue that empirical indefeasibility is essential to the primary notion of the a priori ; however, the indefeasibility requirement should be interpreted in such a way that we can be fallibilist about apriori-justified claims. This fallibilist notion of the a priori accords with the (...) naturalist’s commitment to scientific methodology in that it allows for apriori-justified claims to be sensitive to further conceptual developments and the expansion of evidence. The fallibilist apriorist allows that an a priori claim is revisable in only a purely epistemic sense. This modal claim is weaker than what is required for a revisability thesis to establish empiricism, so fallibilist apriorism represents a distinct position. (shrink)

When there are two lines of argument that contradict each other but still end up with the same conclusion, this conclusion is called a floating conclusion. It is an open topic in skeptical defeasible reasoning if floating conclusions ought to be accepted. Inter- estingly, the answer seems to be changing for different examples. In this paper, we propose a solution for explaining the different treatments of the floating conclusion in the various examples from the literature. We collect the examples (...) from the literature, extend them with additional examples and test various hypotheses for explaining the difference by means of the examples. We will argue for a framework that accepts a floating conclusion by default but allows for reasons to deviate from the default in order to reject it. These reasons nicely explain the different underlying patterns of our intuitions. (shrink)

In this paper, I discuss the analysis of logic in the pragmatic approach recently proposed by Brandom. I consider different consequence relations, formalized by classical, intuitionistic and linear logic, and I will argue that the formal theory developed by Brandom, even if provides powerful foundational insights on the relationship between logic and discursive practices, cannot account for important reasoning patterns represented by non-monotonic or resource-sensitive inferences. Then, I will present an incompatibility semantics in the framework of linear (...) logic which allow to refine Brandom’s concept of defeasible inference and to account for those non-monotonic and relevant inferences that are expressible in linear logic. Moreover, I will suggest an interpretation of discursive practices based on an abstract notion of agreement on what counts as a reason which is deeply connected with linear logic semantics. (shrink)

Given that conspiracies exist, can we be justified in dismissing conspiracy theories without concerning ourselves with specific details? I answer this question by focusing on contrarian conspiracy theories, theories about conspiracies that conflict with testimony from reliable sources of information. For example, theories that say the CIA masterminded the assassination of John F. Kennedy, 9/11 was an inside job, or the Freemasons are secretly running the world are contrarian conspiracy theories. When someone argues for a contrarian conspiracy theory, their options (...) are to appeal to eyewitness testimony, incriminating documents, photographs, audio recordings, video recordings, allegedly scientific evidence, anomalies, or considerations of cui bono (who benefits). Most laypeople don’t know how to adequately respond to arguments for contrarian conspiracy theories, but this doesn’t mean that it’s dogmatic to reject them. I argue that many laypeople are defeasibly justified in rejecting a variety of contrarian conspiracy theories based on testimony and this justification is rarely defeated by arguments for contrarian conspiracy theories even if we don’t know how to respond to these arguments. (shrink)

This paper investigates the logic of reasons. Its aim is to provide an analysis of the sentences of the form ‘p is a reason for q’ that yields a coherent account of their logical properties. The idea that we will develop is that ‘p is a reason for q’ is acceptable just in case a suitably defined relation of incompatibility obtains between p and ¬q. As we will suggest, a theory of reasons based on this idea can solve three (...) challenging puzzles that concern, respectively, contraposing reasons, conflicting reasons, and supererogatory reasons, and opens a new perspective on some classical issues concerning non-deductive inferences. (shrink)

The epistemic modal auxiliaries must and might are vehicles for expressing the force with which a proposition follows from some body of evidence or information. Standard approaches model these operators using quantificational modal logic, but probabilistic approaches are becoming increasingly influential. According to a traditional view, must is a maximally strong epistemic operator and might is a bare possibility one. A competing account—popular amongst proponents of a probabilisitic turn—says that, given a body of evidence, must \ entails that \\) (...) is high but non-maximal and might \ that \\) is significantly greater than 0. Drawing on several observations concerning the behavior of must, might and similar epistemic operators in evidential contexts, deductive inferences, downplaying and retractions scenarios, and expressions of epistemic tension, I argue that those two influential accounts have systematic descriptive shortcomings. To better make sense of their complex behavior, I propose instead a broadly Kratzerian account according to which must \ entails that \ = 1\) and might \ that \ > 0\), given a body of evidence and a set of normality assumptions about the world. From this perspective, must and might are vehicles for expressing a common mode of reasoning whereby we draw inferences from specific bits of evidence against a rich set of background assumptions—some of which we represent as defeasible—which capture our general expectations about the world. I will show that the predictions of this Kratzerian account can be substantially refined once it is combined with a specific yet independently motivated ‘grammatical’ approach to the computation of scalar implicatures. Finally, I discuss some implications of these results for more general discussions concerning the empirical and theoretical motivation to adopt a probabilisitic semantic framework. (shrink)

A prevailing thought is that generics have a covert modal operator at logical form. I claim that if this is right, the covert generic modality is a weak necessity modal. In this paper, I pr...

One might ask of two or more texts—what can be inferred from them, taken together? If the texts happen to contradict each other in some respect, then the unadorned answer of standard logic is EVERYTHING. But it seems to be a given that we often successfully reason with inconsistent information from multiple sources. The purpose of this paper is to attempt to develop an adequate approach to accounting for this given.

This chapter proposes a dialectical approach to legal interpretation, consisting of three dimensions: a formalization of the canons of interpretation in terms of argumentation schemes; a dialectical classification of interpretive schemes; and a logical and computational model for comparing the arguments pro and contra an interpretation. The traditional interpretive maxims or canons used in both common and civil law are translated into defeasible patterns of arguments, which can be evaluated through sets of corresponding critical questions. These interpretive argumentation schemes (...) are classified in general categories and a distinction is drawn between schemes supporting and rebutting an interpretation. This framework allows conceiving statutory interpretation as a dialectical procedure consisting in weighing arguments pro and contra an interpretation. This procedure is formalized and represented computationally through tools from formal argumentation systems. (shrink)

Drawing on the puzzling behavior of ordinary knowledge ascriptions that embed an epistemic (im)possibility claim, we tentatively conclude that it is untenable to jointly endorse (i) an unfettered classical logic for epistemic language, (ii) the general veridicality of knowledge ascription, and (iii) an intuitive ‘negative transparency’ thesis that reduces knowledge of a simple negated ‘might’ claim to an epistemic claim without modal content. We motivate a strategic trade-off: preserve veridicality and (generalized) negative transparency, while abandoning the general validity of (...) contraposition. We criticize various approaches to incorporating veridicality into domain semantics, a paradigmatic ‘information-sensitive’ framework for capturing negative transparency and, more generally, the non-classical behavior of sentences with epistemic modals. We then present a novel information-sensitive semantics that successfully executes our favored strategy: stable acceptance semantics, extending a vanilla bilateral state-based semantics for epistemic modals with a knowledge operator loosely inspired by the defeasibility theory of knowledge. (shrink)

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay (...) outlines a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.1. (shrink)

This paper investigates the emotive (or expressive) meaning of words commonly referred to as “loaded” or “emotive,” which include slurs, derogative or pejorative words, and ethical terms. We claim that emotive meaning can be reinterpreted from a pragmatic and argumentative perspective, which can account for distinct aspects of ethical terms, including the possibility of being modified and its cancellability. Emotive meaning is explained as a defeasible and automatic or automatized evaluative and intended inference commonly associated with the use of (...) specific terms, which can be represented and assessed considering its logical structure and its defeasibility conditions. This automatic inference is conceived as part of the connotation of an ethical term, and is not necessarily stable. By means of quasi-definitions, it is possible to modify the emotive meaning while maintaining the descriptive one, automaticizing the inferences drawn from an ethical word. Through examples drawn from the recent US presidential campaign, we show how re-contextualization and emotive contexts can affect emotive meaning. (shrink)

This paper analyzes selected examples of uses of argumentation tactics that exploit emotive language, many of them criticized as deceptive and even fallacious by classical and recent sources, including current informal logic textbooks. The analysis is based on six argumentation schemes, and an account of the dialectical setting in which these schemes are used. The three conclusions are (1) that such uses of emotive language are often reasonable and necessary in argumentation based on values, (2) but that they are (...) defeasible, and hence need to be seen as open to critical questioning (3) and that when they are used fallaciously, it is because they interfere with critical questioning or conceal the need for it. The analysis furnishes criteria for distinguishing between arguments based on the use of emotive words that are reasonable tools of persuasion, and those that are fallacious tactics used to conceal and distort information. (shrink)

This paper argues for a reinterpretation of Aristotle's concept of an enthymeme and also his wider informal logic in terms of arguments that are defeasible. They are represented by forms of argument that are called argumentation schemes, considered to be similar to forms of argument found in deductive logic, but different from the foregoing in virtue of their being defeasible. Indeed, the most interesting schemes have been put forward as a helpful way of characterizing structures of (...) human reasoning that have proved troublesome to model deductively. The paper sheds new light on Aristotle's topics and how to dene `enthymeme'. If the traditional denition of an enthymeme in logic accepted for over two thousand years is a misnomer, the question is raised whether we ought to redene it as a defeasible argumentations scheme or leave things as they are. (shrink)

Both in formal and computational natural language semantics, the classical correspondence view of meaning – and, more specifically, the view that the meaning of a declarative sentence coincides with its truth conditions – is widely held. Truth (in the world or a situation) plays the role of the given, and meaning is analysed in terms of it. Both language and the world feature in this perspective on meaning, but language users are conspicuously absent. In contrast, the inferentialist semantics that Robert (...) Brandom proposes in his magisterial book ‘Making It Explicit’ puts the language user centre stage. According to his theory of meaning, the utterance of a sentence is meaningful in as far as it is a move by a language user in a game of giving and asking for reasons (with reasons underwritten by a notion of good inferences). In this paper, I propose a proof-theoretic formalisation of the game of giving and asking for reasons that lends itself to computer implementation. In the current proposal, I flesh out an account of defeasible inferences, a variety of inferences which play a pivotal role in ordinary (and scientific) language use. (shrink)

In this paper it is shown how certain defeasible argumentation schemes can be used to represent the logical structure of the most common types of argument used for statutory interpretation both in civil and common law. The method is based on an argumentation structure in which the conclusion, namely, the meaning attributed to a legal source, is modeled as a claim that needs that is be supported by pro and con defeasible arguments. The defeasible nature of each (...) scheme is shown by means of critical questions, which identify the default conditions for the accepting interpretative arguments and provide a method for evaluating a given argument as weak or strong. (shrink)

This book looks at the affective-cognitive roots of how the human mind inquires into the workings of nature and, more generally, how the mind confronts reality. Reality is an infinitely complex system, in virtue of which the mind can comprehend it only in bits and pieces, by making up interpretations of the myriads of signals received from the world by way of integrating those with information stored from the past. This constitutes a piecemeal interpretation by which we assemble our phenomenal (...) reality. In perceiving the complex world and responding to it, the mind invokes the logic of affect and the logic of reason, the former mostly innate and implicit, and the latter generated consciously in explicit terms with reference to mind-independent relations between entities in nature. It is a strange combination of affect and reason that enables us to make decisions and inferences, --- the latter mostly of the inductive type --- thereby making possible the development of theories. Theories are our tool-kits for explaining and predicting phenomena, guiding us along in our journey in life. Theories, however, are defeasible, and need to be constantly updated, at times even radically. In this, the self and the soul are of enormous relevance. The former is the affect-based psychological engine driving all our mental processes, while the latter is the capacity of the conscious mind to examine and reconstruct the self by modulating repressed conflicts. If the soul remains inoperative, all our theories become misdirected and a rot spreads inexorably all around us. (shrink)

Formal ontologies are nowadays widely considered a standard tool for knowledge representation and reasoning in the Semantic Web. In this context, they are expected to play an important role in helping automated processes to access information. Namely: they are expected to provide a formal structure able to explicate the relationships between different concepts/terms, thus allowing intelligent agents to interpret, correctly, the semantics of the web resources improving the performances of the search technologies. Here we take into account a problem regarding (...) Knowledge Representation in general, and ontology based representations in particular; namely: the fact that knowledge modeling seems to be constrained between conflicting requirements, such as compositionality, on the one hand and the need to represent prototypical information on the other. In particular, most common sense concepts seem not to be captured by the stringent semantics expressed by such formalisms as, for example, Description Logics (which are the formalisms on which the ontology languages have been built). The aim of this work is to analyse this problem, suggesting a possible solution suitable for formal ontologies and semantic web representations. The questions guiding this research, in fact, have been: is it possible to provide a formal representational framework which, for the same concept, combines both the classical modelling view (accounting for compositional information) and defeasible, prototypical knowledge ? Is it possible to propose a modelling architecture able to provide different type of reasoning (e.g. classical deductive reasoning for the compositional component and a non monotonic reasoning for the prototypical one)? We suggest a possible answer to these questions proposing a modelling framework able to represent, within the semantic web languages, a multilevel representation of conceptual information, integrating both classical and non classical (typicality based) information. Within this framework we hypothesise, at least in principle, the coexistence of multiple reasoning processes involving the different levels of representation. (shrink)

Reductive intellectualists (e.g., Stanley & Williamson 2001; Stanley 2011a; 2011b; Brogaard 2008; 2009; 2011) hold that knowledge-how is a kind of knowledge-that. If this thesis is correct, then we should expect the defeasibility conditions for knowledge-how and knowledge-that to be uniform—viz., that the mechanisms of epistemic defeat which undermine propositional knowledge will be equally capable of imperilling knowledge-how. The goal of this paper is twofold: first, against intellectualism, we will show that knowledge-how is in fact resilient to being undermined by (...) the very kinds of traditional (propositional) epistemic defeaters which clearly defeat the items of propositional knowledge which intellectualists identify with knowledge-how. Second, we aim to fill an important lacuna in the contemporary debate, which is to develop an alternative way in which epistemic defeat for knowledge-how could be modelled within an anti-intellectualist framework. (shrink)

I outline Hume’s views about conceivability evidence. Then I critically scrutinize two threats to conceivability-based modal epistemology. Both arise from Hume’s criticism of claims to knowing necessary causal relationships: Firstly, a sceptical stance towards causal necessity may carry over to necessity claims in general. Secondly, since – according to a sceptical realist reading – Hume grants the eventuality of causal powers grounded in essential features of objects, conceivability-based claims to comprehensive metaphysical possibilities seem endangered. I argue that although normal conceivability-based (...) claims are defeasible, they are prima facie vindicated. (shrink)

According to the so-called ‘Taking Condition’ (a label due to Boghossian 2014) on inference, for a response R in circumstances C to count as an instance of reasoning or inferring, it must be the case that the agent’s taking it that R is warranted or justified in C plays (the right sort of) explanatory role in her R-ing. The Taking Condition has come under much criticism in the theory of reasoning. While I believe that these criticisms can be answered, my (...) aim in this paper is to build a positive case for the Taking Condition. More specifically, I argue that views based on the Taking Condition do a much better job accounting for crucial features of reasoning—especially once we recognize the pervasiveness and significance of defeasibility in our reasoning. (shrink)

According to the Reasoning View about normative reasons, facts about normative reasons for action can be understood in terms of facts about the norms of practical reasoning. I argue that this view is subject to an overlooked class of counterexamples, familiar from debates about Subjectivist theories of normative reasons. Strikingly, the standard strategy Subjectivists have used to respond to this problem cannot be adapted to the Reasoning View. I think there is a solution to this problem, however. I argue that (...) the norms of practical reasoning, like the norms of theoretical reasoning, are characteristically defeasible, in a sense I make precise. Recognizing this property of those norms makes space for a solution to the problem. The resulting view is in a way analogous to the familiar defeasibility theory of knowledge, but it avoids a standard objection to that theory. (shrink)

Defeasible argumentation has been applied successfully in several real-world domains in which it is necessary to handle incomplete and contradictory information. In recent years, there have been interesting attempts to carry out argumentation processes supported by massive repositories developing argumentative reasoning applications. One of such efforts builds arguments by retrieving information from relational databases using the DBI-DeLP framework; this article presents eDBI-DeLP, which extends the original DBI-DeLP framework by providing two novel aspects which refine the interaction between DeLP programs (...) and relational databases. First, we expand the expressiveness of dbi-delp programs by providing ways of controlling how the information in databases is recovered; this is done by introducing filters that enable an improved fine-grained control on the argumentation processes which become useful in applications, providing the semantics and the implementation of such filters. Second, we introduce an argument comparison criterion which can be adjusted at the level of literals to model particular features such as credibility and topic expertise, among others. These new tools can be particularly useful in environments such as medical diagnosis expert systems, decision support systems, or recommender systems based on argumentation, where datasets are often provided in the form of relational databases. (shrink)

The paper starts by describing and clarifying what Williamson calls the consequence fallacy. I show two ways in which one might commit the fallacy. The first, which is rather trivial, involves overlooking background information; the second way, which is the more philosophically interesting, involves overlooking prior probabilities. In the following section, I describe a powerful form of sceptical argument, which is the main topic of the paper, elaborating on previous work by Huemer. The argument attempts to show the impossibility of (...) defeasible justification, justification based on evidence which does not entail the (allegedly) justified proposition or belief. I then discuss the relation between the consequence fallacy, or some similar enough reasoning, and that form of argument. I argue that one can resist that form of sceptical argument if one gives up the idea that a belief cannot be justified unless it is supported by the totality of the evidence available to the subject—a principle entailed by many prominent epistemological views, most clearly by epistemological evidentialism. The justification, in the relevant cases, should instead derive solely from the prior probability of the proposition. A justification of this sort, that does not rely on evidence, would amount to a form of entitlement, in (something like) Crispin Wright’s sense. I conclude with some discussion of how to understand prior probabilities, and how to develop the notion of entitlement in an externalist epistemological framework. (shrink)

Discussion of the behaviour of pregnant women and mothers, in academic literature, medical advice given to mothers, mainstream media and social media, assumes that a mother who fails to do something to benefit her child is liable for moral criticism unless she can provide sufficient countervailing considerations to justify her decision. I reconstruct the normally implicit reasoning that leads to this assumption and show that it is mistaken. First, I show that the discussion assumes that if any action might benefit (...) her child, the mother has a defeasible duty to perform that action. I suggest that this assumption is implicitly supported by two arguments but that each argument is unsound. The first argument conflates moral reasons and defeasible duties; the second misunderstands the scope of a defeasible duty to benefit. This argument has important practical and theoretical implications: practically, it provides a response to a highly damaging discourse on maternal behaviour; theoretically, it provides the framework for a clearer understanding of the scope and nature of defeasible duties to benefit. (shrink)

One can intentionally do something only if one knows what one is doing while they are doing it. For example, one can intentionally kill one’s neighbor by opening their gas stove overnight only if one knows that the gas is likely to kill the neighbor in their sleep. One can intentionally sabotage the victory of one’s rival by putting sleeping drugs in their drink only if one knows that sleeping drugs will harm the rival’s performance. And so on. In a (...) slogan: Intentional action is action guided by knowledge. This essay reviews some motivations for a ‘knowledge-centered psychology’ — a psychology where knowledge enters center stage in an explanation of intentional action (§2). Then it outlines a novel argument for the claim that knowledge is required for intentional action (§3) and discusses some of its consequences (§§4-5). (shrink)

Once upon a time, logical conventionalism was the most popular philosophical theory of logic. It was heavily favored by empiricists, logical positivists, and naturalists. According to logical conventionalism, linguistic conventions explain logical truth, validity, and modality. And conventions themselves are merely syntactic rules of language use, including inference rules. Logical conventionalism promised to eliminate mystery from the philosophy of logic by showing that both the metaphysics and epistemology of logic fit into a scientific picture of reality. For (...) naturalists of all stripes, this was paradise. Alas, paradise was lost. By the end of the twentieth century, logical conventionalism had been almost universally abandoned. But more recently, it has been revitalized. This chapter provides an overview of logical conventionalism and its history, clears away misunderstandings, and briefly responds to both the canonical objections to conventionalism (from Quine, Dummett, Boghossian, and many others) as well as new objections (from Field and Golan). From paradise lost, to paradise regained: logical conventionalism is back. (shrink)

Two truisms about empirical justification are that experience plays a crucial role in it and that it is defeasible. There are, of course, different ways of developing these truisms into philosophical theories. I favor one particular view about the role of experience in empirical justification which may be thought to lead to problems in accommodating its defeasibility. My aim in this paper is to argue that the problems are illusory, based on an entrenched misconception how defeaters work.

This paper introduces and discusses three models of future: a determinist model, a stochastic model, and the model of True Prophetic Knowledge. All three models coexist in natural languages and are represented both in their grammatical systems and in the text-building discourse strategies speakers and authors apply to.

For many women experiencing motherhood for the first time, the message they receive is clear: mothers who do not breastfeed ought to have good reasons not to; bottle feeding by choice is a failure of maternal duty. We argue that this pressure to breastfeed arises in part from two misconceptions about maternal duty: confusion about the scope of the duty to benefit and conflation between moral reasons and duties. While mothers have a general duty to benefit, we argue that this (...) does not imply a duty to carry out any particular beneficent act. Therefore, the expectation that mothers should breastfeed unless they have sufficient countervailing reasons not to is morally unwarranted. Recognising the difference between reasons and duties can allow us to discuss the benefits of breastfeeding and the importance of supporting mothers who wish to breastfeed without subjecting mothers who bottle feed to guilt, blame and failure. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems (...) to change this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

The result of combining classical quantificational logic with modal logic proves necessitism – the claim that necessarily everything is necessarily identical to something. This problem is reflected in the purely quantificational theory by theorems such as ∃x t=x; it is a theorem, for example, that something is identical to Timothy Williamson. The standard way to avoid these consequences is to weaken the theory of quantification to a certain kind of free logic. However, it has often been noted (...) that in order to specify the truth conditions of certain sentences involving constants or variables that don’t denote, one has to apparently quantify over things that are not identical to anything. In this paper I defend a contingentist, non-Meinongian metaphysics within a positive free logic. I argue that although certain names and free variables do not actually refer to anything, in each case there might have been something they actually refer to, allowing one to interpret the contingentist claims without quantifying over mere possibilia. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, (...) but have been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)