According to a widely held view of the matter, whenever we assess beliefs as ‘rational’ or ‘justified’, we are making normative judgements about those beliefs. In this discussion, I shall simply assume, for the sake of argument, that this view is correct. My goal here is to explore a particular approach to understanding the basic principles that explain which of these normative judgements are true. Specifically, this approach is based on the assumption that all such normative principles are grounded in (...) facts about values, and the normative principles that apply to beliefs in particular are grounded in facts about alethic value––a kind of value that is exemplified by believing what is true and not believing what is false. In this chapter, I shall explain what I regard as the best way of interpreting this approach. In doing so, I shall also show how this interpretation can solve some problems that have recently been raised for approaches of this kind by Selim Berker, Jennifer Carr, Michael Caie, and Hilary Greaves. (shrink)

The literature on conditionals is rife with alternate formulations of the abstract semantics of conditional logic. Each formulation has its own advantages in terms of applications and generalizations; nevertheless, they are for the most part equivalent, in the sense that they underwrite the same range of logical systems. The purpose of the present note is to bring under this umbrella the partition semantics introduced by Brian Skyrms in (Skyrms, 1984).

Recently, Bengt Hansson presented a paper about dyadic deontic logic,2 criticizing some purely axiomatic systems of dyadic deontic logic and proposing three purely semantical systems of dyadic deontic logic which he confidently called dyadic standard systems of deontic logic (DSDL1–3). Here I shall discuss the third by far most interesting system DSDL3 which is operating with preference relations. First, I shall describe this semantical system (Sections 1.1–1.3). Then I shall give an axiomatic system (Section 1.4) which is proved to be (...) correct (Section 2) and complete (Section 3) with respect to Hansson's semantics. Finally, in face of these results Hansson's semantics will be discussed from a more intuitive standpoint. After emphasizing its intuitive attractiveness (Section 4.1) I will show that two objections often discussed in connection with preference relations do not apply to it (Section 4.2 and 4.3); more precisely, I will show that the connectedness condition for preference relations can be dropped and that, in a sense, it is not necessary to compare two possible worlds differing in infinitely many respects. (What exactly is meant by this, will become clear later on.) Yet there is a third objection to Hansson's semantics which points to a real intuitive inadequacy of DSDL3. A way of removing this inadequacy, which corresponds to Hansson's own intuitions as well as to familiar metaethical views, is suggested, but not technically realized (Section 4.4). In the last section (section 4.5) I shall briefly show that DSDL3 is decidable, as expected. (shrink)

Expressivism promises an illuminating account of the nature of normative judgment. But worries about the details of expressivist semantics have led many to doubt whether expressivism's putative advantages can be secured. Drawing on insights from linguistic semantics and decision theory, I develop a novel framework for implementing an expressivist semantics that I call ordering expressivism. I argue that by systematically interpreting the orderings that figure in analyses of normative terms in terms of the basic practical attitude of conditional weak preference, (...) the expressivist can explain the semantic properties of normative sentences in terms of the logical properties of that attitude. Expressivism's problems with capturing the logical relations among normative sentences can be reduced to the familiar, more tractable problem of explaining certain coherence constraints on preferences. Particular attention is given to the interpretation of wide-scope negation. The proposed solution is also extended to other types of embedded contexts—most notably, disjunctions. (shrink)

Completeness and other forms of Zorn’s Lemma are sometimes invoked for semantic proofs of conservation in relatively elementary mathematical contexts in which the corresponding syntactical conservation would suffice. We now show how a fairly general syntactical conservation theorem that covers plenty of the semantic approaches follows from an utmost versatile criterion for conservation given by Scott in 1974.To this end we work with multi-conclusion entailment relations as extending single-conclusion entailment relations. In a nutshell, the additional axioms with disjunctions in positive (...) position can be eliminated by reducing them to the corresponding disjunction elimination rules, which in turn prove admissible in all known mathematical instances. In deduction terms this means to fold up branchings of proof trees by way of properties of the relevant mathematical structures.Applications include the syntactical counterparts of the theorems or lemmas known under the names of Artin–Schreier, Krull–Lindenbaum, and Szpilrajn. Related work has been done before on individual instances, e.g., in locale theory, dynamical algebra, formal topology and proof analysis. (shrink)

In the paper I investigate aspects of adverbial modification as an operation applying an adverb or adverbial phrase to a predicate and thereby creating a new predicate. The logic of adverbial modification, on this view, belongs to the logic of predicate modifiers. The theory I present is intended to cover not only adverbial modification but also attributive modification, but problems concerning the latter will not be given any special attention.

The basis of the paper is a logic of analytical consequential implication, CI.0, which is known to be equivalent to the well-known modal system KT thanks to the definition A → B = df A ⥽ B ∧ Ξ (Α, Β), Ξ (Α, Β) being a symbol for what is called here Equimodality Property: (□A ≡ □B) ∧ (◊A ≡ ◊B). Extending CI.0 (=KT) with axioms and rules for the so-called circumstantial operator symbolized by *, one obtains a system CI.0*Eq (...) in whose language one can define an operator ↠ suitable to formalize context-dependent conditionals (so to counterfactual conditionals) via the definition (Def ↠) A ↠ B = df *A ⥽ B ∧ Ξ (Α, Β).. The central problem of the paper is to identify inside CI.0*Eq + Def ↠ a set of axioms yielding the fragment consisting of all and only theorems in which only truth-functional operators and the two operators → and ↠ occur. This system, here called CI.0, is introduced in §3. In view of the intended purpose, it is introduced a complete and tableau-decidable system KTw, which is an extension of KT with axioms for the so-called quasi-variables w(A), w(B)… Three translation functions among the three languages used in the paper are then introduced. The first, Tr, maps every wff of form *A into wffs of form w(A) ∧ A and translates theorems of CI.0*Eq into theorems of KTw. The second, t°, translates theorems of CI.0 into theorems of CI.0*Eq by applying Def↠. A third one, t, translates theorems of CI.0 into theorems of KTw. As a consequence, it follows that t°A = TrtA. In §4 it is proved that CI.0 is complete w.r.t. the class of CI.0-models of form where f is a selection function and R an access relation. It is then proved (i) that CI.0 models may be converted into KTw-models; (ii) that the truth-value of a proposition in a world of a CI.0-model is preserved in the same world of the derived KTw-model; (iii) that A is a CI.0-thesis iff its translation tA is KTw-thesis. It follows that, if A is not a CI.0-thesis, tA is not a KTw-thesis, so also that TrtA is not a CI.0*Eq-thesis. Since t°A = TrtA and t°A is a function built on Def↠, this proves that every t°-translation of a CI.0-wff that is a CI.0*Eq-theorem is a CI.0-theorem. Since the converse proposition is proved in §2, their conjunction establishes the desired result. In the final section, it is proved that CI.0 is tableau-decidable, that ↠ is not a trivial operator and that ↠ enjoys the positive and negative properties required in §1 for context-dependent conditionals. Some final remarks suggest that studying the relations between CI.0 and systems of classical conditional logic may be a promising line of investigation. (shrink)

With characteristic incisiveness Georg Henrik von Wright identifies pro­ haireticIogic (i. e. the logic of preference) as the core of a general theory of value concepts. Essentially, this nucleus involves the logical study of acts from the point of view of their preferability. 1 (italics added) Though the term prohairesis is found in Plato, as well as in Aristotle's treatment of the relations of preference, it is von Wright who introduces this word into contemporary analytical philoso­ phy, and succinctly specifies (...) the philosophical dimensions it encompasses. The above emphasis upon the philosophical study of the formalization of preferences is a matter of utmost importance for understanding the type of in­ quiry this investigation attempts to initiate. Over the past one hundred years the literature on general theories of subjective utility has become massive, where one considers the work done in psychometrics, econometrics, statistical theories, probability theories, etc., etc. Histories in these areas are strong in tracing various evolutions in the development of the concept of preference in decision-making. However, what has not been investigated with sustained at­ tention are the fundamentally philosophical inquiries into the formalization of preference-relations. (shrink)

As a discipline of its own, the philosophy of science can be traced back to the founding of its academic journals, some of which go back to the first half of the twentieth century. While the discipline has been the object of many historical studies, notably focusing on specific schools or major figures of the field, little work has focused on the journals themselves. Here, we investigate contemporary philosophy of science by means of computational text-mining approaches: we apply topic-modeling algorithms (...) to eight major philosophy of science journals, from the 1930s up until 2017. Based on the full-text content of some 15,897 articles, we identified 25 research themes and 8 thematic clusters that show how the research agenda of the philosophy of science has changed in its content over the course of the last eight decades, up to the philosophy of science we now know. We also show how each one of the journals contributed in its own way to this thematic evolution. (shrink)

Theoria, Volume 88, Issue 3, Page 494-528, June 2022.

We interpret solution rules on a class of simple allocation problems as data on the choices of a policy maker. We analyze conditions under which the policy maker’s choices are (i) rational (ii) transitive-rational, and (iii) representable; that is, they coincide with maximization of a (i) binary relation, (ii) transitive binary relation, and (iii) numerical function on the allocation space. Our main results are as follows: (i) a well-known property, contraction independence (a.k.a. IIA) is equivalent to rationality; (ii) every contraction (...) independent and other-c monotonic rule is transitive-rational; and (iii) every contraction independent and other-c monotonic rule, if additionally continuous, can be represented by a numerical function. (shrink)

a–b* c–d is taken to mean that your degree of preference for a over b is less than your degree of preference for c over d. Various properties of the strength-of-preference comparison relation * are examined along with properties of simple preferences defined from *. The investigation recognizes an individual's limited ability to make precise judgments. Several utility theorems relating a–b * c–d to u(a)–u(b) are included.

The rationalization of a choice function, in terms of assumptions that involve expansion or contraction properties of the feasible set, over non-finite sets is analyzed. Schwartz's results, stated in the finite case, are extended to this more general framework. Moreover, a characterization result when continuity conditions are imposed on the choice function, as well as on the binary relation that rationalizes it, is presented.

We examine the maximal-element rationalizability of choice functions with arbitrary domains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier literature, this is not the case for maximal-element rationalizability, except when it coincides with greatest-element rationalizability because of properties imposed on the rationalizing relation. We develop necessary and sufficient conditions for maximal-element rationalizability by itself, and for maximal-element rationalizability in conjunction with additional properties of a (...) rationalizing relation such as reflexivity, completeness, P-acyclicity, quasi-transitivity, consistency and transitivity. (shrink)

Ever since Sen criticized the notion of internal consistency of choice, there exists a widespread perception that the standard rationalizability approach to the theory of choice has difficulties in coping with the existence of external norms. We introduce a concept of norm-conditional rationalizability and show that external norms can be made compatible with the methods underlying the traditional rationalizability approach. To do so, we characterize norm-conditional rationalizability by means of suitable modifications of revealed preference axioms that are well established in (...) the theory of rational choice on general domains as analysed in contributions by Richter and Hansson, for example. We compare our approach to alternative suggestions that have appeared in response to Sen's criticisms, and we discuss its links to Sen's notion of self-imposed choice constraints. (shrink)

A generalized theory of revealed preference is formulated for choice situations where the consequences of choices from given menus are uncertain. In a nonprobabilistic framework, rational choice behavior can be defined by requiring the existence of a preference relation on the set of possible consequences and an extension rule for this relation to the power set of the set of consequences such that the chosen sets of possible outcomes are the best elements in the feasible set according to this extension (...) rule. Rational choice is characterized under various assumptions on these relations. (shrink)

We establish a correspondence between the rationalizability of choice studied in the revealed preference literature and the notion of minimal belief revision captured by the AGM postulates. A choice frame consists of a set of alternatives , a collection E of subsets of (representing possible choice sets) and a function f : E ! 2 (representing choices made). A choice frame is rationalizable if there exists a total pre-order R on..

In an earlier paper [Rational choice and AGM belief revision, _Artificial Intelligence_, 2009] a correspondence was established between the set-theoretic structures of revealed-preference theory (developed in economics) and the syntactic belief revision functions of the AGM theory (developed in philosophy and computer science). In this paper we extend the re-interpretation of those structures in terms of one-shot belief revision by relating them to the trichotomous attitude towards information studied in Garapa (Rev Symb Logic, 1–21, 2020) where information may be either (...) (1) fully accepted or (2) rejected or (3) taken seriously but not fully accepted. We begin by introducing the syntactic notion of _filtered belief revision_ and providing a characterization of it in terms of a mixture of both AGM revision and contraction. We then establish a correspondence between the proposed notion of filtered belief revision and the above-mentioned set-theoretic structures, interpreted as semantic _partial_ belief revision structures. We also provide an interpretation of the trichotomous attitude towards information in terms of the degree of implausibility of the information. (shrink)

We study belief change in the branching-time structures introduced in Bonanno (Artif Intell 171:144–160, 2007 ). First, we identify a property of branching-time frames that is equivalent (when the set of states is finite) to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision function that satisfies the AGM postulates. Second, we (...) provide a set of modal axioms that characterize the class of AGM-consistent frames within the modal logic introduced in Bonanno (Artif Intell 171:144–160, 2007 ). Third, we introduce a generalization of AGM belief revision functions that allows a clear statement of principles of iterated belief revision and discuss iterated revision both semantically and syntactically. (shrink)

Arrow's Independence of Irrelevant Alternatives Condition is examined. It is shown why the standard rationale for (or against) the condition tends to be inconclusive as it fails to consider the basic ‘game’ issue in social choice. Specifically it is explained how some recent results (Gibbard-Satterthwaite) on the general non-existence of strategy-proof voting procedures provide the strongest rationale for the independence condition. Also, it is shown that this rationale was exactly the one used by Condorcet in his work on decision rules (...) for juries and elections. (shrink)

Intrinsic value has traditionally been thought to lie at the heart of ethics. Philosophers use a number of terms to refer to such value. The intrinsic value of something is said to be the value that that thing has “in itself,” or “for its own sake,” or “as such,” or “in its own right.” Extrinsic value is value that is not intrinsic.