The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames. The results have interesting applications in epistemic logic. In particular we suggest that the proposed models can be used in order to study monadic operators of probability (Kyburg, 1990) and likelihood (Halpern-Rabin, 1987).

1 Choice conjecture In axiomatizing nonclassical extensions of classical sentential logic one tries to make do, if one can, with adding to classical sentential logic a finite number of axiom schemes of the simplest kind and a finite number of inference rules of the simplest kind. The simplest kind of axiom scheme in effect states of a particular formula P that for any substitution of formulas for atoms the result of its application to P is to count as an axiom. (...) The simplest kind of onepremise inference rule in effect states of a particular pair of formulas P and Q that for any substitution of formulas for atoms, if the result of its application to P is a theorem, then the result of its application to Q is to count as a theorem; similarly for many-premise rules. Such are the schemes and rules of all the best-known modal and tense logics, for instance. Sometimes it is difficult to find such simple schemes and rules. In that case one may resort to less simple schemes or less simple rules. There is no generally recognized rigorous definition of "next simplest kind" of scheme. Neither is there any generally recognized definition of "next simplest kind" of rule, and hence there is no fully rigorous enunciation of the choice conjecture, the conjecture that schemes of the next simplest kind can always be avoided in favor of rules of the next simplest kind and vice versa. Nonetheless, there are cases where intuitively one does recognize that the schemes or rules in a given axiomatization are only slightly more complex than the simplest kind, including cases where one does have a choice between adopting slightly-more-complex-than-simplest schemes and adopting slightly-more-complex-than-simplest rules. In tense logic early examples of slightly more complex rules are found in [2] and [3] : there is one example of the embarrassed use of such rules in the former, and many examples of the enthusiastic use of such rules in the latter and its sequels. Accordingly the rules in question have come to be called "Gabbay-style" rules. (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)

ABSTRACT We investigate a logic PFD, as introduced in [FA]. In our notation, this logic is enriched with operators P> r(r € [0,1]) where the intended meaning of P> r φ is “the probability of φ (at a given world) is strictly greater than r”. We also adopt the semantics of [FA]: a class of “F-restricted probabilistic kripkean models”. We give a completeness proof that essentially differs from that in [FA]: our “peremptory lemma” (a lemma in PFD rather than about (...) it) facilitates the construction of a canonical model for PFD considerably. We show that this construction can be carried out using only finitary means, and also give a filtration-technique for the intended models. We then define an alternative (in some sense more natural) semantics for the logic, and show some of its properties. Finally, we prove decidability of the logic. (shrink)

We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness both of modal systems (...) and of systems in the quantifier tradition, complexity as well as syntactic characterizations of special semantic constraints. Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. (shrink)

The paper builds on the basically Humean idea that A is a cause of B iff A and B both occur, A precedes B, and A raises the metaphysical or epistemic status of B given the obtaining circumstances. It argues that in pursuit of a theory of deterministic causation this ‘status raising’ is best explicated not in regularity or counterfactual terms, but in terms of ranking functions. On this basis, it constructs a rigorous theory of deterministic causation that successfully deals (...) with cases of overdetermination and pre-emption. It finally indicates how the account's profound epistemic relativization induced by ranking theory can be undone. Introduction Variables, propositions, time Induction first Causation Redundant causation Objectivization. (shrink)

By “Propensities” I mean the kind of probabilities that figure in laws of nature. Propensities might be (i) relative frequencies, finite or long run, de facto or modalized, or (ii) reflections of our epistemic probabilities or (iii) sui generus theoretical notions. I believe that the whole family of relative frequency proposals (i) are inadequate. As an alternative I wish to suggest (ii) an epistemic account of propensities and of nomic force in general, in the spirit of Hume, Mill, DeFinetti, Ayer, (...) Suppes and Jeffrey. Whether accounts of the third kind differ in substance or in name only from the sort of account that I am proposing is a nice question, to which. I will devote some brief closing remarks. (shrink)

Group beliefs in social networks are often construed as arising from individual beliefs through processes of update and aggregation. In this paper, we explore an alternative ‘arational’ perspective. More specifically, we focus on group attitudes as neutral tendencies toward alignment of opinions driven by influence patterns among agents modeled in a Markov dynamics. In addition, we investigate logical patterns in the resulting potential group beliefs or, in more neutral arational terminology: collective opinion structures.

We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness both of modal systems (...) and of systems in the quantifier tradition, complexity as well as syntactic characterizations of special semantic constraints. Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. (shrink)

This paper presents an w-completeness theorem for a new propositional probabilistic logic, namely, the dynamic propositional logic of qualitative probabilities (DQP), which has been introduced by the author as a dynamic extension of the logic of qualitative probabilities (Q P) introduced by Segerberg.

Vague subjective probability may be modeled by means of a set of probability functions, so that the represented opinion has only a lower and upper bound. The standard rule of conditionalization can be straightforwardly adapted to this. But this combination has difficulties which, though well known in the technical literature, have not been given sufficient attention in probabilist or Bayesian epistemology. Specifically, updating on apparently irrelevant bits of news can be destructive of one’s explicitly prior expectations. Stability of vague subjective (...) opinion appears to need a more complex model. (shrink)

Bradley has argued that a truth-conditional semantics for conditionals is incompatible with an allegedly very weak and intuitively compelling constraint on the interpretation of conditionals. I argue that the example Bradley offers to motivate this constraint can be explained along pragmatic lines that are compatible with the correctness of at least one popular truth-conditional semantics for conditionals.

Bradley has argued that a truth-conditional semantics for conditionals is incompatible with an allegedly very weak and intuitively compelling constraint on the interpretation of conditionals. I argue that the example Bradley offers to motivate this constraint can be explained along pragmatic lines that are compatible with the correctness of at least one popular truth-conditional semantics for conditionals.

This paper investigates the principles that one must add to Boolean algebra to capture reasoning not only about intersection, union, and complementation of sets, but also about the relative size of sets. We completely axiomatize such reasoning under the Cantorian definition of relative size in terms of injections.

To clarify and illuminate the place of probability in science Ellery Eells and James H. Fetzer have brought together some of the most distinguished philosophers ...

In this paper, we explore semantics for comparative epistemic modals that avoid the entailment problems shown to result from Kratzer’s (1991) semantics by Yalcin (2006, 2009, 2010). In contrast to the alternative semantics presented by Yalcin and Lassiter (2010, 2011), based on finitely additive probability measures, we introduce semantics based on qualitatively additive measures, as well as semantics based on purely qualitative orderings, including orderings on propositions derived from orderings on worlds in the tradition of Kratzer (1991). All of these (...) semantics avoid the entailment problems that result from Kratzer’s semantics. Our discussion focuses on methodological issues concerning the choice between different semantics. (shrink)

While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. In this paper, we highlight some of the benefits (...) of providing axiomatizations for the purpose of semantic theorizing. We illustrate some of these benefits using three examples from the study of modality. (shrink)