Based on a close study of benchmark examples in default reasoning, such as Nixon Diamond, Penguin Principle, etc., this paper provides an in depth analysis of the basic features of default reasoning. We formalize default inferences based on Modus Ponens for Default Implication, and mark the distinction between "local inferences"(to infer a conclusion from a subset of given premises) and "global inferences"(to infer a conclusion from the entire set of given premises). These conceptual analyses are captured by a formal semantics (...) that is built upon the set-selection function technique. A minimal logic system M of default reasoning that accommodates Modus Ponens for Default Implication and suitable for local inferences is proposed, and its soundness is proved. (shrink)

We prove some embedding theorems for classical conditional logic, covering 'finitely cumulative' logics, 'preferential' logics and what we call 'semi-monotonic' logics. Technical tools called 'partial frames' and 'frame morphisms' in the context of neighborhood semantics are used in the proof.

We consider the connections between belief revision, conditional logic and nonmonotonic reasoning, using as a foundation the approach to theory change developed by Alchourrón, Gärdenfors and Makinson (the AGM approach). This is first generalized to allow the iteration of theory change operations to capture the dynamics of epistemic states according to a principle of minimal change of entrenchment. The iterative operations of expansion, contraction and revision are characterized both by a set of postulates and by Grove's construction based on total (...) pre-orders on the set of complete theories of the belief logic. We present a sound and complete conditional logic whose semantics is based on our iterative revision operation, but which avoids Gärdenfors's triviality result because of a severely restricted language of beliefs and hence the weakened scope of our extended postulates. In the second part of the paper, we develop a computational approach to theory dynamics using Rott's E-bases as a representation for epistemic states. Under this approach, a ranked E-base is interpreted as standing for the most conservative entrenchment compatible with the base, reflecting a kind of foundationalism in the acceptance of evidence for a belief. Algorithms for the computation of our iterative versions of expansion, contraction and revision are presented. Finally, we consider the relationship between nonmonotonic reasoning and both conditional logic and belief revision. Adapting the approach of Delgrande, we show that the unique extension of a default theory expressed in our conditional logic of belief revision corresponds to the most conservative belief state which respects the theory: however, this correspondence is limited to propositional default theories. Considering first order default theories, we present a belief revision algorithm which incorporates the assumption of independence of default instances and propose the use of a base logic for default reasoning which incorporates uniqueness of names. We conclude with an examination of the behavior of an implemented system on some of Lifschitz's benchmark problems in nonmonotonic reasoning. (shrink)

We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Science using prototypes, plans, or schemata; formal semantics in natural language, especially the semantics of the `if-then' conditional construct; and the logic of subjunctive conditionals first developed using a possible worlds semantics by Stalnaker and Lewis. The basic premise of the paper is that both schema-based inference and the semantics of conditionals are based on (...) Dretske's notion of information flow and Barwise and Perry's notion of a constraint in situation semantics. That is, the connection between antecedent and consequent of a conditional `if were the case then would be the case' is an informational relation holding with respect to a pragmatically determined utterance situation. The bridge between AI and conditional logic is that a prototype or planning schema represents a situation type, and the background assumptions underlying the application of a schema in a situation correspond to channel conditions on the flow of information. Adapting the work of Stalnaker and Lewis, the semantics of conditionals is modeled by a refinement ordering on situations: a conditional `if then ' holds with respect to a situation if all the minimal refinements of the situation that support also support . We present new logics of situations, information flow, and subjunctive conditionals based on three-valued partial logic that formalizes our approach, and conclude with a discussion of the resulting theory of conditionals, including the "paradoxes" of conditional implication, the difference between truth conditions and assertability conditions for subjunctive conditionals, and the relationship between subjunctive and indicative conditionals. (shrink)

Entitlement is conceived as a kind of positive epistemic status, attaching to certain propositions, that involves no cognitive or intellectual accomplishment on the part of the beneficiary — a status that is in place by default. In this paper I will argue that the notion of entitlement — or something very like it — falls out of an idea that may at first blush seem rather disparate: that the evidential support relation can be understood as a kind of variably strict (...) conditional (in the sense of Lewis 1973). Lewis provided a general recipe for deriving what he termed inner modalities from any variably strict conditional governed by a logic meeting certain constraints. On my proposal, entitlement need be nothing more exotic than the inner necessity associated with evidential support. Understanding entitlement in this way helps to answer some common concerns — in particular, the concern that entitlement could only be a pragmatic, and not genuinely epistemic, status. (shrink)

Our understanding of subjunctive conditionals has been greatly enhanced through the use of possible world semantics and, more precisely, by the idea that they involve variably strict quantification over possible worlds. I propose to extend this treatment to ceteris paribus conditionals – that is, conditionals that incorporate a ceteris paribus or ‘other things being equal’ clause. Although such conditionals are commonly invoked in scientific theorising, they traditionally arouse suspicion and apprehensiveness amongst philosophers. By treating ceteris paribus conditionals as a species (...) of variably strict conditional I hope to shed new light upon their content and their logic. (shrink)

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. $${p\Rightarrow q}$$ p ⇒ q is thus defined as $${\lnot } \Diamond {(p \wedge \lnot q) \wedge } \Diamond {p \wedge } \Diamond {\lnot q}$$ ¬ ◊ (...) ( p ∧ ¬ q ) ∧ ◊ p ∧ ◊ ¬ q. We explore the logical properties of this conditional in a reflexive normal Kripke semantics, provide an axiomatic system and prove it to be sound and complete for our semantics. The implicative conditional validates transitivity and contraposition, which we take to be integral parts of reasoning and communication. But it only validates restricted versions of strengthening the antecedent, right weakening, simplification, and rational monotonicity. Apparent counterexamples to some of these properties are explained as due to contextual factors. Finally, the implicative conditional avoids the paradoxes of material and strict implication, and validates some connexive principles such as Aristotle’s theses and weak Boethius’ thesis, as well as some highly entrenched principles of conditionals, such as conjunction of consequents, disjunction of antecedents, modus ponens, cautious monotonicity and cut. (shrink)

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

The properties of belief revision operators are known to have an informal semantics which relates them to the axioms of conditional logic. The purpose of this paper is to make this connection precise via the model theory of conditional logic. A semantics for conditional logic is presented, which is expressed in terms of algebraic models constructed ultimately out of revision operators. In addition, it is shown that each algebraic model determines both a revision operator and a logic, that are related (...) by virtue of the stable Ramsey test. (shrink)

I contrast two approaches to the interpretation of generics such as ‘ravens are black:’ majority-based views, on which they are about what is the case most of the time, and inquiry-based views, on which they are about a feature we focus on in inquiry. I argue that majority-based views face far more systematic counterexamples than has previously been supposed. They cannot account for generics about kinds with multiple characteristic properties, such as ‘elephants live in Africa and Asia.’ I then go (...) on to sketch an inquiry-based view. (shrink)

We discuss similarities and residual differences, within the general semantic framework of minimality, between defeasible inference, belief revision, counterfactual conditionals, updating — and also conditional obligation in deontic logic. Our purpose is not to establish new results, but to bring together existing material to form a clear overall picture.

This paper offers an account of propositional absurdity and investigates its connection to falsity. I propose that instances of absurdity just are cases of what I call maximal abnormality. In light of the works of Smith (2016) and Pietroski and Rey (1995) on normic conditionals which link normality to explanatory demands, I suggest that absurdity also has a close tie with explanations (more precisely, the lacking thereof). Interesting consequences follow under such an account – first, I argue that we should (...) see absurdity as ceteris paribus guide to falsehood – what is absurd is expected to be false, unless further evidence suggests otherwise; second (and relatedly), when further evidence indeed suggests otherwise, absurd propositions would not cease to be absurd. (shrink)

This paper offers an account of propositional absurdity and investigates its connection to falsity. I propose that instances of absurdity just are cases of what I call maximal abnormality. In light of the works of Smith (2016) and Pietroski and Rey (1995) on normic conditionals which link normality to explanatory demands, I suggest that absurdity also has a close tie with explanations (more precisely, the lacking thereof). Interesting consequences follow under such an account – first, I argue that we should (...) see absurdity as ceteris paribus guide to falsehood – what is absurd is expected to be false, unless further evidence suggests otherwise; second (and relatedly), when further evidence indeed suggests otherwise, absurd propositions would not cease to be absurd. (shrink)

This paper offers an account of propositional absurdity and investigates its connection to falsity. I propose that instances of absurdity just are cases of what I call maximal abnormality. In light of the works of Smith (2016) and Pietroski and Rey (1995) on normic conditionals which link normality to explanatory demands, I suggest that absurdity also has a close tie with explanations (more precisely, the lacking thereof). Interesting consequences follow under such an account – first, I argue that we should (...) see absurdity as ceteris paribus guide to falsehood – what is absurd is expected to be false, unless further evidence suggests otherwise; second (and relatedly), when further evidence indeed suggests otherwise, absurd propositions would not cease to be absurd. (shrink)

Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of large subsets’ of a given index set |$I$|⁠, in the sense that it is difficult to think of a weaker, but still plausible, definition of the concept. The notion of weak ultrafilter naturally emerges and has been used in epistemic logic and other (...) knowledge representation (KR) applications. We provide a comprehensive exposition of weak filters and ultrafilters, comparing them with their classical counterparts that have found very important applications in logic, set theory and topology. Weak (ultra)filters capture the ‘majorities’ of social choice theory (which coincide with the commonsense understanding of a ‘large subset’) and in that respect, they outperform classical (ultra)filters in their role as ‘collections of large subsets’. Yet, they lack some of the elegant properties of classical (ultra)filters that make them an almost perfect match for logical theories. We investigate the extent to which some important classical results carry through in this new setting, and we focus on genuinely weak filters and genuinely weak ultrafilters. For weak ultrafilters, we proceed to provide concrete examples, answer questions of existence and characterize their construction. The class of weak (ultra)filters represents a genuine contribution of KR to set theory that might be of some interest to set theorists too and we initiate this study by providing a glimpse on natural set-theoretic questions. (shrink)

Defeasible conditionals are statements of the form ‘if A then normally B’. One plausible interpretation introduced in nonmonotonic reasoning dictates that ) is true iff B is true in ‘most’ A-worlds. In this paper, we investigate defeasible conditionals constructed upon a notion of ‘overwhelming majority’, defined as ‘truth in a cofinite subset of \’, the first infinite ordinal. One approach employs the modal logic of the frame \\), used in the temporal logic of discrete linear time. We introduce and investigate (...) conditionals, defined modally over \\); several modal definitions of the conditional connective are examined, with an emphasis on the nonmonotonic ones. An alternative interpretation of ‘majority’ as sets cofinal ) rather than cofinite ) is examined. For these modal approaches over \\), a decision procedure readily emerges, as the modal logic \ of this frame is well-known and a translation of the conditional sentences can be mechanically checked for validity; this allows also for a quick proof of \-completeness of the satisfiability problem for these logics. A second approach employs the conditional version of Scott-Montague semantics, in the form of \-many possible worlds, endowed with neighborhoods populated by collections of cofinite subsets of \. This approach gives rise to weak conditional logics, as expected. The relative strength of the conditionals introduced is compared to KLM logics and other conditional logics in the literature. (shrink)

We investigate the notion of relevance as it pertains to ‘commonsense’, subjunctive conditionals. Relevance is taken here as a relation between a property (such as having a broken wing) and a conditional (such as birds typically fly). Specifically, we explore a notion of ‘causative’ relevance, distinct from ‘evidential’ relevance found, for example, in probabilistic approaches. A series of postulates characterising a minimal, parsimonious concept of relevance is developed. Along the way we argue that no purely logical account of relevance (even (...) at the metalevel) is possible. Finally, and with minimal restrictions, an explicit definition that agrees with the postulates is given. (shrink)

Generics and frequency statements are puzzling phenomena: they are lawlike, yet contingent. They may be true even in the absence of any supporting instances, and extending the size of their domain does not change their truth conditions. Generics and frequency statements are parametric on time, but not on possible worlds; they cannot be applied to temporary generalizations, and yet are contingent. These constructions require a regular distribution of events along the time axis. Truth judgments of generics vary considerably across speakers, (...) whereas truth judgments of frequency statements are much more uniform. A generic may be false even if the vast majority of individuals in its domain satisfy the predicated property, whereas a frequency statement using, e.g., usually would be true. This paper argues that all these seemingly unrelated puzzles have a single underlying cause: generics and frequency statements express probability judgments, and these, in turn, are interpreted as statements of hypothetical relative frequency. (shrink)

According to the KK-principle, knowledge iterates freely. It has been argued, notably in Greco, that accounts of knowledge which involve essential appeal to normality are particularly conducive to defence of the KK-principle. The present article evaluates the prospects for employing normality in this role. First, it is argued that the defence of the KK-principle depends upon an implausible assumption about the logical principles governing iterated normality claims. Once this assumption is dropped, counter-instances to the principle can be expected to arise. (...) Second, it is argued that even if the assumption is maintained, there are other logical properties of normality which can be expected to lead to failures of KK. Such failures are noteworthy, since they do not depend on either a margins-for-error principle or safety condition of the kinds Williamson appeals to in motivating rejection KK. “Introduction: KK and Being in a Position to Know” Section formulates two versions of the KK-Principle; “Inexact Knowledge and Margins for Error” Section presents a version of Williamson’s margins-for-error argument against it; “Knowledge and Normality” and “Iterated Normality” Sections discuss the defence of the KK-Principle due to Greco and show that it is dependent upon the implausible assumption that the logic of normality ascriptions is at least as strong as K4; finally, “Knowledge in Abnormal Conditions” and “Higher-Order Ignorance Inside the Margins” Sections argue that a weakened version of Greco’s constraint on knowledge is plausible and demonstrate that this weakened constraint will, given uncontentious assumptions, systematically generate counter-instances to the KK-principle of a novel kind. (shrink)

We investigate an aspect of defeasibility that has somewhat been overlooked by the non-monotonic reasoning community, namely that of defeasible modes of reasoning. These aim to formalise defeasibility of the traditional notion of necessity in modal logic, in particular of its different readings as action, knowledge and others in specific contexts, rather than defeasibility of conditional forms. Building on an extension of the preferential approach to modal logics, we introduce new modal osperators with which to formalise the notion of defeasible (...) necessity and distinct possibility, and that can be used to represent expected effects, refutable knowledge, and so on. We show how KLM-style conditionals can smoothly be integrated with our richer language. We also propose a tableau calculus which is sound and complete with respect to our modal preferential semantics, and of which the computational complexity remains in the same class as that of the underlying classical modal logic. (shrink)

This paper is about an underappreciated aspect of generics: their non-specificity. Many uses of generics, utterances like ‘Seagulls swoop down to steal food’, express non-specific generalisations which do not specify their quantificational force or flavour. I consider whether this non-specificity arises as a by-product of context-sensitivity or semantic incompleteness but argue instead that generics semantically express non-specific generalisations by default as a result of quantifying existentially over more specific ones.

A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be payed to cut-simulation, which may render cut-elimination as a pointless criterion.

The animalist says we are animals. This thesis is commonly understood as the universal generalization that all human persons are human animals. This article proposes an alternative: the thesis is a generic that admits of exceptions. We defend the resulting view, which we call ‘generic animalism’, and show its aptitude for diagnosing the limits of eight case-based objections to animalism.

How do generics interact with modals? This note offers one observation about an interaction with 'might' that presents a challenge for standard theories.

This text is expository. We explain Gödel’s ‘Master Argument’ for incompleteness as distinguished from the 'official' proof of his 1931 paper, highlight its attractions and limitations, and explain how some of the limitations may be transcended by putting it in a more abstract form that makes no reference to truth.

Generics are sentences such as Birds fly, which express generalizations. They are prevalent in speech, and as far as is known, no human language lacks generics. Yet, it is very far from clear what they mean. After all, not all birds fly—penguins don’t! -/- There are two general views about the meaning of generics in the literature, and each view encompasses many specific theories. According to the inductivist view, a generic states that a sufficient number of individuals satisfy a certain (...) property—in the example above, it says that sufficiently many birds fly. This view faces the complicated problem of spelling out exactly how many is “sufficiently many” in a way that correctly captures the intuitive truth conditions of generics. -/- An alternative, the rules and regulations view, despairs from this project and proposes instead that generics directly express rules in the world. Rules are taken to be abstract objects, which are not related to the properties of specific individuals. This view faces the difficult problem of explaining how people come to know of such rules when judging the truth of falsity of generics, and accounting for the strong intuition that a sentence such as Birds fly talks about birds, not abstract objects. -/- What seems to be beyond dispute is that generics, even if they do not express rules, are lawlike: they state non-accidental generalizations. Many scholars have taken this fact to indicate that generics are parametric on possible worlds: they refer to worlds other than the actual world. This, again, raises the problem of how people come to know about what happens in these other worlds. However, a rigorous application of standard tests for intensionality shows that generics are not, in fact, parametric on possible worlds, but only on time. This unusual property may explain much of the mystery surrounding generics. -/- Another mysterious property of generics is that although there is no language without them, there is no linguistic construction that is devoted to the expression of genericity. Rather, generics can be expressed in a variety of ways, each of which can also express nongenerics. Yet, each manifestation of generics differs subtly (or sometimes not so subtly) in its meaning from the others. -/- Even when these and other puzzles of genericity are solved, one mystery would remain: Why are generics, which are so easy to produce and understand in conversation, so difficult to analyze? (shrink)