This paper argues that several leading theories of subjunctive conditionals are incompatible with ordinary intuitions about what credences we ought to have in subjunctive conditionals. In short, our theory of subjunctives should intuitively display semantic humility, i.e. our semantic theory should deliver the truth conditions of sentences without pronouncing on whether those conditions actually obtain. In addition to describing intuitions about subjunctive conditionals, I argue that we can derive these ordinary intuitions from justified premises, and I answer a possible worry (...) for my derivation by refuting a subjunctive triviality result modeled on (Lewis 1976). I conclude that the debate over the correct theory of subjunctive conditionals requires settling meta-philosophical questions about the relative value of various virtues of first-order theories of subjunctive conditionals. (shrink)

This is a study in the meaning of natural language probability operators, sentential operators such as probably and likely. We ask what sort of formal structure is required to model the logic and semantics of these operators. Along the way we investigate their deep connections to indicative conditionals and epistemic modals, probe their scalar structure, observe their sensitivity to contex- tually salient contrasts, and explore some of their scopal idiosyncrasies.

What we want to be true about ordinary indicative conditionals seems to be more than we can possibly get: there just seems to be no good way to assign truth-conditions to ordinary indicative conditionals. Some take this argument as reason to make our wantings more modest. Others take it to show that indicative conditionals don't have truth-conditions in the first place. But we have overlooked two possibilities for assigning truth-conditions to indicatives. What's more, those possibilities deliver what we want and (...) turn out to be equivalent. CiteULike Connotea Del.icio.us Digg Reddit Technorati What's this? (shrink)

way on the information available in the contexts in which they are used, it’s not surprising that there is a minor but growing industry of work in semantics and the philosophy of language concerned with the precise nature of the context-dependency of epistemically modalized sentences. Take, for instance, an epistemic might-claim like..

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

Around the turn of the 20th century, Keynes and Johnson extended the well-known square of opposition to an octagon of opposition, in order to account for subject negation (e.g., statements like ‘all non-S are P’). The main goal of this paper is to study the logical properties of the Keynes-Johnson (KJ) octagons of opposition. In particular, we will discuss three concrete examples of KJ octagons: the original one for subject-negation, a contemporary one from knowledge representation, and a third one (hitherto (...) not yet studied) from deontic logic. We show that these three KJ octagons are all Aristotelian isomorphic, but not all Boolean isomorphic to each other (the first two are representable by bitstrings of length 7, whereas the third one is representable by bitstrings of length 6). These results nicely fit within our ongoing research efforts toward setting up a systematic classification of squares, octagons, and other diagrams of opposition. Finally, obtaining a better theoretical understanding of the KJ octagons allows us to answer some open questions that have arisen in recent applications of these diagrams. (shrink)

This paper is about four inferences patterns governing conditionals: Transitivity, Simplification, Contraposition, and Antecedent Strengthening. Transitivity, Simplification, and Contraposition are intuitively compelling. Although Antecedent Strengthening may seem less attractive at first, close attention to the full range of data reveals that it too has considerable appeal. An adequate theory of conditionals should account for these facts. The strict theory does so by validating them. But the variably strict theory invalidates them. So the variably strict theorist faces a question: why do (...) we find these inferences so compelling? In this paper, I suggest an answer on her behalf: that they are reasonable inferences in the sense introduced by Stalnaker (1975). -/- . (shrink)

Indicative and subjunctive conditionals are in non-complimentary distribution: there are conversational contexts at which both are licensed (Stalnaker 1975; Karttunen and Peters 1979; von Fintel 1998). This means we can ask an important, but under-explored, question: in contexts which license both, what relations hold between the two? In this paper, I’ll argue for an initially surprising conclusion: when attention is restricted to the relevant contexts, indicatives and subjunctives are co-entailing. §1 introduces the indicative/subjunctive distinction, along with a discussion of the (...) relevant notion of entailment; §2 presents the main argument of the paper, and §3 considers some of the philosophical implications of the argument in §2. Finally, §4 argues that we can reconcile the equivalence of indicatives and subjunctives with apparently conflicting judgements. (shrink)

A conversation can be conceived as aiming to circumscribe a set of possibilities that are relevant to the goals of the conversation. This set of possibilities may be conceived as determined by the goals and objective circumstances of the interlocutors and not by their propositional attitudes. An indicative conditional can be conceived as circumscribing a set of possibilities that have a certain property: If the set of relevant possibilities is subsequently restricted to one in which the antecedent holds, then it (...) will be restricted as well to one in which the consequent holds. We will identify a number of desiderata concerning the validity of arguments; we will develop a formally precise semantics for conditionals conceived in this way that satisfies the desiderata, and we will present a deductive calculus that is sound and complete with respect to the semantics. Finally, we will argue that the semantics compares well, both formally and foundationally, with two other semantic theories of indicative conditionals that satisfy the desiderata, namely, those of Gillies and Bledin. (shrink)

I propose an account of indicative conditionals that combines features of minimal change semantics and information semantics. As in information semantics, conditionals are interpreted relative to an information state in accordance with the Ramsey test idea: “if p then q” is supported at a state s iff q is supported at the hypothetical state s[p] obtained by restricting s to the p-worlds. However, information states are not modeled as simple sets of worlds, but by means of a Lewisian system of (...) spheres. Worlds in the inner sphere are considered possible; worlds outside of it are ruled out, but to different degrees. In this way, even when a state supports “not p”, it is still possible to suppose p consistently. I argue that this account does better than its predecessors with respect to a set of desiderata concerning inferences with conditionals. In particular, it captures three important facts: that a conditional is logically independent from its antecedent; that a sequence of antecedents behaves like a single conjunctive antecedent ; and that conditionals restrict the quantification domain of epistemic modals. I also discuss two ways to construe the role of a premise, and propose a generalized notion of entailment that keeps the two apart. (shrink)

Free Choice is the principle that possibly p or q implies and is implied by possibly p and possibly q. A variety of recent attempts to validate Free Choice rely on a nonclassical semantics for disjunction, where the meaning of p or q is not a set of possible worlds. This paper begins with a battery of impossibility results, showing that some kind of nonclassical semantics for disjunction is required in order to validate Free Choice. The paper then provides a (...) positive account of Free Choice, by identifying a family of dynamic semantics for disjunction that can validate the inference. On all such theories, the meaning of p or q has two parts. First, p or q requires that our information is consistent with each of p and q. Second, p or q narrows down our information by eliminating some worlds. It turns out that this second component of or is well behaved: there is a strongest such meaning that p or q can express, consistent with validating Free Choice. The strongest such meaning is the classical one, on which p or q eliminates any world where both p and q are false. In this way, the classical meaning of disjunction turns out to be intimately related to the validity of Free Choice. (shrink)

In this paper I focus on a recently discussed phenomenon illustrated by sentences containing predicates of taste: the phenomenon of " perspectival plurality " , whereby sentences containing two or more predicates of taste have readings according to which each predicate pertains to a different perspective. This phenomenon has been shown to be problematic for (at least certain versions of) relativism. My main aim is to further the discussion by showing that the phenomenon extends to other perspectival expressions than predicates (...) of taste and by proposing a general solution to the problem raised by it on behalf of the relativist. The core claim of the solution (" multiple indexing ") is that utterances of sentences containing perspectival expressions should be evaluated with respect to (possibly infinite) sequences of perspective parameters. (shrink)

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

We present a generalization of Segerberg's onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, with a bi-modal neighborhood semantics. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic.

Conventional wisdom has it that many intriguing features of indicative conditionals aren’t shared by subjunctive conditionals. Subjunctive morphology is common in discussions of wishes and wants, however, and conditionals are commonly used in such discussions as well. As a result such discussions are a good place to look for subjunctive conditionals that exhibit features usually associated with indicatives alone. Here I offer subjunctive versions of J. L. Austin’s ‘biscuit’ conditionals—e.g., “There are biscuits on the sideboard if you want them”—and subjunctive (...) versions of Allan Gibbard’s ‘stand-off’ or ‘Sly Pete’ conditionals, in which speakers with no relevant false beliefs can in the same context felicitously assert conditionals with the same antecedents and contradictory consequents. My cases undercut views according to which the indicative/subjunctive divide marks a great difference in the meaning of conditionals. They also make trouble for treatments of indicative conditionals that cannot readily be generalized to subjunctives. (shrink)

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 BASIC MODAL LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.

Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.

The mass/count distinction attracts a lot of attention among cognitive scientists, possibly because it involves in fundamental ways the relation between language (i.e. grammar), thought (i.e. extralinguistic conceptual systems) and reality (i.e. the physical world). In the present paper, I explore the view that the mass/count distinction is a matter of vagueness. While every noun/concept may in a sense be vague, mass nouns/concepts are vague in a way that systematically impairs their use in counting. This idea has never been systematically (...) pursued, to the best of my knowledge. I make it precise relying on supervaluations (more specifically, ‘data semantics’) to model it. I identify a number of universals pertaining to how the mass/count contrast is encoded in the languages of the world, along with some of the major dimensions along which languages may vary on this score. I argue that the vagueness based model developed here provides a useful perspective on both. The outcome (besides shedding light on semantic variation) seems to suggest that vagueness is not just an interface phenomenon that arises in the interaction of Universal Grammar (UG) with the Conceptual/Intentional System (to adopt Chomsky’s terminology), but it is actually part of the architecture of UG. (shrink)

Traditional procedures for rational updating fail when it comes to self-locating opinions, such as your credences about where you are and what time it is. This paper develops an updating procedure for rational agents with self-locating beliefs. In short, I argue that rational updating can be factored into two steps. The first step uses information you recall from your previous self to form a hypothetical credence distribution, and the second step changes this hypothetical distribution to reflect information you have genuinely (...) learned as time has passed. While the second step resembles traditional procedures of updating by conditionalization, the first is best understood by analogy to traditional models of how agents transmit self-locating opinions through ordinary interpersonal communication. (shrink)

This paper developes a relational---as opposed to a functional---theory of types. The theory is based on Hilbert and Bernays' eta operator plus the identity symbol, from which Church's lambda and the other usual operators are then defined. The logic is intended for use in the semantics of natural language.

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)

This paper explores the connective ‘because’, based on the idea that ‘CbecauseA’ implies the acceptance/truth of the antecedentAas well as of the consequentC, and additionally that the antecedent makes a difference for the consequent. To capture this idea of difference-making a ‘relevantized’ version of the Ramsey Test for conditionals is employed that takes the antecedent to be relevant to the consequent in the following sense: a conditional is true/accepted in a state$$\sigma $$σjust in case (i) the consequent is true/accepted when$$\sigma (...) $$σis revised by the antecedentand(ii) the consequent fails to be true/accepted when$$\sigma $$σis revised by the antecedent’s negation. To extend this to a semantics for ‘because’, we add that (iii) the antecedent and (iv) the consequent are accepted/true in the state$$\sigma $$σ. We get metaphysical or doxastic interpretations of these clauses, depending on what we mean by a model and a state. We introduce several semantics known from suppositional conditionals, which we reinterpret for difference-making conditionals and ‘because’. We present a minimal logic for ‘because’ sentences and show how it can be extended in ways that parallel the hierarchy of extensions of the logic of suppositional conditionals. We establish correspondence results between axioms for ‘because’ and properties of states, and prove that the specified logics are sound with respect to the semantics. (shrink)

According to Adams, the acceptability of an indicative conditional goes with the conditional probability of the consequent given the antecedent. However, some conditionals seem to be inappropriate, although their corresponding conditional probability is high. These are cases with a missing link between antecedent and consequent. Other conditionals are appropriate even though the conditional probability is low. Finally, we have the so-called biscuit conditionals. In this paper we will generalize analyses of Douven and others to account for the appropriateness of conditionals (...) in terms of evidential support. Our generalization involves making use of Value, or intensity. We will show how this generalization helps to account for biscuit conditionals and conditional threats and promises. Finally, a link is established between this analysis of conditionals and an analysis of generic sentences. (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)

This article is about Avicenna’s account of syllogisms comprising opposite premises. We examine the applications and the truth conditions of these syllogisms. Finally, we discuss the relation between these syllogisms and the principle of non-contradiction.

The transition from form to meaning is not neatly layered: there is no point where form ends and content sets in. Rather, there is an almost continuous process that converts form into meaning. That process cannot always take a straight line. Very often we hit barriers in our mind, due to the inability to understand the exact content of the sentence just heard. The standard division between formula and interpretation (or value) should therefore be given up when talking about the (...) process of understanding. Interestingly, when we do this it turns out that there are 'easy' formulae, those we can understand without further help, and 'difficult' ones, which we cannot. (shrink)

We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) belief revision can be analyzed by standard modal frame correspondences for model-changing operations. (shrink)

This paper is a presentation of astatus quæstionis, to wit of the problemof the interpretability logic of all reasonablearithmetical theories.We present both the arithmetical side and themodal side of the question.Dedicated to Dick de Jongh on the occasion of his 60th birthday.

This paper presents the first compositional semantics for if then conditionals. The semantics of each element are first examined separately. The meaning of if is modeled according to a possible worlds semantics. The particle then is analyzed as an anaphoric word that places its focused element inside the context settled by a previous element. Their meanings are subsequently combined in order to provide a formal semantics of if A then C conditionals, which differs from the simple if A, C form. (...) This semantics has the particularity of validating contraposition for the first type but invalidating it for the second type. Finally, a detailed examination of the sentences presented in the literature opposing this schema of reasoning shows that these counterexamples do not generally concern if then conditionals but, rather, even if conditionals and that contraposition is therefore a valid means of reasoning with regard to if then conditionals in natural language, as this system predicts. (shrink)

This thesis is about indicative conditionals and apparent counterexamples to classically valid argument forms. Specifically, it applies the following four theories: - material (inspired by Grice (1961, 1975 and 1989)); - possible-worlds (inspired by Stalnaker (1981); Lewis (1976); and Kratzer (2012)), - suppositional (inspired by Adams (1975) and Edgington (1995 and 2014)); and - hybrid (inspired by Jackson (1987)) to try and solve the following two counterexamples: - Vann McGee’s to modus ponens (1985); and - Lewis Carroll’s to modus tollens (...) (1894). I argue that none of the theories I consider can explain – without facing any problems – the three individually plausible but jointly inconsistent theses that give rise to the apparent counterexamples. The three theses of the trilemma are the following: (1) the argument is invalid; (2) the argument is an instance of modus ponens or modus tollens; and (3) modus ponens or modus tollens is valid. (shrink)

In this paper, I have proposed a compositional semantic analysis of exception NPs from which three core properties of exception constructions could be derived. I have shown that this analysis overcomes various empirical and conceptual shortcomings of prior proposals of the semantics of exception sentences. The analysis was first formulated for simple exception NPs, where the EP-complement was considered a set-denoting term and the EP-associate was a monadic quantifier. It was then generalized in two steps: first, in order to account (...) for quantified EP-complements, and second, in order to account for polyadic quantifiers as the EP-associates. An additional assumption that was made in several places was that EPs may operate at the level of implications. The consequences of this assumption, though, still have to be investigated. (shrink)

We assume a central thesis about modal auxiliaries due to Angelika Kratzer, the modal base presupposition: natural language expressions that contain a modal component in their meaning, including all English modal auxiliaries and epistemic modal auxiliaries (EMA)s in particular, presuppose a modal base, a function that draws from context a relevant set of propositions which contribute to a premise-semantics for the modal. Accepting this thesis for EMAs leaves open (at least) the following two questions about the meaning of English EMAs (...) like _must_ and _might_: (i) What constraints, if any, are there on the character of the premise set for an EMA? And (ii) what is the nature of the relationship between premises and conclusion that is required for truth of the EMA statement? I argue for at least a partial answer to (i), with a hypothesis about constraints on the modal base for an EMA: EMAs, unlike some other types of modals, are indexical: They are anchored to an agent-in-a-situation whose doxastic state is currently under discussion in the context of utterance. Realized in a Kratzerian semantics, indexicality sheds new light on a number of outstanding puzzles, including the widely observed variability of anchoring of EMAs, the ways in which EMAs differ from so-called root modals, Yalcin’s (Mind 116:983–1026, 2007) puzzle (a version of Moore’s paradox for epistemic modals embedded under attitudes), how to explain the apparent weakness of necessity EMAs, and problems with second order belief and disagreement. (shrink)

Philosophical Perspectives, Volume 35, Issue 1, Page 320-339, December 2021.

Many have accepted that ordinary counterfactuals and might counterfactuals are duals. In this paper, I show that this thesis leads to paradoxical results when combined with a few different unorthodox yet increasingly popular theses, including the thesis that counterfactuals are strict conditionals. Given Duality and several other theses, we can quickly infer the validity of another paradoxical principle, ‘The Counterfactual Direct Argument’, which says that ‘A> ’ entails ‘A> ’. First, I provide a collapse theorem for the ‘counterfactual direct argument’. (...) The counterfactual direct argument entails the logical equivalence of the subjunctive and material conditional, given a variety of assumptions. Second, I provide a semantics that validates the counterfactual direct argument without collapse. This theory further develops extant dynamic accounts of conditionals. I give a new semantics for disjunction, on which A or B is only true in a context when A and B are both unsettled. The resulting framework validates CDA while invalidating other commonly accepted principles concerning the conditional and disjunction. (shrink)

In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order semantics of System P. Combining these two results leads to a new (...) completeness proof for System P with respect to its order semantics. Our approach allows us to construct for every inference either a concrete proof of the inference from the rules in System P or a countermodel in the order semantics. Our results rely on the notion of a witnessing set for an inference, whose existence is a concise, necessary and sufficient condition for validity of an inferences in System P. We also introduce an infinitary variant of System P and use the game semantics to show its completeness for the restricted class of well-founded orders. (shrink)

In this article, we argue for the general importance of normative theories of argument strength. We also provide some evidence based on our recent work on the fallacies as to why Bayesian probability might, in fact, be able to supply such an account. In the remainder of the article we discuss the general characteristics that make a specifically Bayesian approach desirable, and critically evaluate putative flaws of Bayesian probability that have been raised in the argumentation literature.

Many conditionals seem to convey the existence of a link between their antecedent and consequent. We draw on a recently proposed typology of conditionals to argue for an old philosophical idea according to which the link is inferential in nature. We show that the proposal has explanatory force by presenting empirical results on the evidential meaning of certain English and Dutch modal expressions.

This thesis extends Kit Fine's truthmaker semantics for counterfactuals to indicative conditionals. First, I provide Fine's truthmaker semantics and his extension to counterfactuals. Then I introduce a notion of context state into the semantics and provide the verification-conditions for indicative conditionals by employing this notion of context state. Afterwards, I turn to the logic of indicative conditionals under exact semantics and discuss the principles and inference rules which raise disagreements between variably strict and strict conditionals accounts. The account I provide (...) shows its promise by validating a plausible combination of principles and strikes a balance between variably strict and strict conditional theories. I discuss certain principles in logic of indicative conditionals under exact semantics in detail and show how the present account validates the plausible combination of them. In the end, I draw comparisons between the viable theories for indicatives and the present one, and argue that the present account takes the advantage in several respects. (shrink)

We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-structure in spatial patterns which suggests analogies across these mathematical theories in terms of modal, temporal, and conditional logics. Throughout the modal walk through space, expressive power is analyzed in terms of language design, bisimulations, and correspondence phenomena. The result is both unification across the areas visited, and the uncovering of interesting new questions.

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.

In this paper we explore the relationship between norms of belief revision that may be adopted by members of a community and the resulting dynamic properties of the distribution of beliefs across that community. We show that at a qualitative level many aspects of social belief change can be obtained from a very simple model, which we call ‘threshold influence’. In particular, we focus on the question of what makes the beliefs of a community stable under various dynamical situations. We (...) also consider refinements and alternatives to the ‘threshold’ model, the most significant of which is to consider changes to plausibility judgements rather than mere beliefs. We show first that some such change is mandated by difficult problems with belief-based dynamics related to the need to decide on an order in which different beliefs are considered. Secondly, we show that the resulting plausibility-based account results in a deterministic dynamical system that is non-deterministic at the level of beliefs. (shrink)

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting the antecedent satisfy the consequent. Equivalently, a conditional is true if the antecedent is contained in the convex hull of the points that satisfy both the antecedent and consequent. Our result is then that every consistent formula without nested conditionals (...) is satisfiable in a model based on a finite set of points in the plane. The proof relies on a result by Richter and Rogers showing that every finite abstract convex geometry can be represented by convex polygons in the plane. (shrink)