If we speak of degrees of similarity, what kinds of judgment are we assuming to make sense? It will be argued that the necessary and sufficient condition for there to be degrees of similarity is that there should be a four-termed relation of comparative similarity — w resembles x at least as much as y resembles z—obeying certain constraints. Of course, nothing turns on how we use the words 'degree of similarity'. Rather, the point is to distinguish the different levels (...) of ideologicalcommitment which different kinds of judgment of similarity involve. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

Different similarity relations on sets are introduced, and their logical properties are investigated. Close relationships are shown to hold between similarity relations that are based on symmetrical difference and operators of belief contraction that are based on relational selection functions. Two new rationality criteria for minimal belief contraction, the maximizing property and the reducing property, are proposed.

The idea of a 'logic of quantum mechanics' or quantum logic was originally suggested by Birkhoff and von Neumann in their pioneering paper [1936]. Since that time there has been much argument about whether, or in what sense, quantum 'logic' can be actually considered a true logic (see, e.g. Bell and Hallett [1982], Dummett [1976], Gardner [1971]) and, if so, how it is to be distinguished from classical logic. In this paper I put forward a simple and natural semantical framework (...) for quantum logic which reveals its difference from classical logic in a strikingly intuitive way, viz. through the fact that quantum logic admits (suitably formulated versions of) the characteristic quantum-mechanical notions of superposition and incompatibility of attributes. That is, precisely the features that distinguish quantum from classical physics also serve, within this framework, to distinguish quantum from classical logic. Some light is shed on the question of whether quantum logic is a genuine logical system by introducing a natural entailment relation for quantum-logical formulas with the implication symbol. The novelty is that, although implication behaves as it should (i.e. the 'deduction theorem' holds), the order of introduction of premises is significant. The fact that a reasonable entailment relation can be formulated for quantum logic supports the view that it is a genuine logical system and not merely an algebraic formalism. (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)

A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula α as the theory defined by the set of all those models of α that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates (...) describe properties of iterated revisions. (shrink)

Tolerance spaces are sets equipped with a reflexive, symmetric, but not necessarily transitive, relation of indistinguishability, and are useful for describing vagueness based on error-prone measurements. We show that any tolerance space can be embedded in one generated by comparisons using prototypical objects. As a result propositions, definable on a tolerance space can be translated into propositions behaving classically.