We present the first comprehensive theory of fairness that conceives of fairness as having two dimensions: a comparative and an absolute one. The comparative dimension of fairness has traditionally been the main interest of Broomean fairness theories. It has been analysed as satisfying competing individual claims in proportion to their respective strengths. And yet, many key contributors to Broomean fairness agree that ‘absolute’ fairness is important as well. We make this concern precise by introducing the Fairness formula and the absolute (...) priority rule and analyse their implications for comparative fairness. (shrink)

In the article ‘How to be absolutely fair, Part I: the Fairness formula’, we presented the first theory of comparative and absolute fairness. Here, we relate the implications of our Fairness formula to economic theories of fair division. Our analysis makes contributions to both philosophy and economics: to the philosophical literature, we add an axiomatic discussion of proportionality and fairness. To the economic literature, we add an appealing normative theory of absolute and comparative fairness that can be used to evaluate (...) axioms and division rules. Also, we provide a novel definition and characterization of the absolute priority rule. (shrink)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus for (...) the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...) logics. We first study the members of our class semantically, after which we present a uniform sequent calculus that is sound and complete with respect to all of them. Two further sequent calculi and \ calculus) will be considered, which serve the same purpose and which are obtained by applying general methods to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the \ and the \ calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the \ and the \ calculus, we also hint at its philosophical significance. (shrink)

We investigate the issue of aggregativity in fair division problems from the perspective of cooperative game theory and Broomean theories of fairness. Paseau and Saunders proved that no non-trivial theory of fairness can be aggregative and conclude that theories of fairness are therefore problematic, or at least incomplete. We observe that there are theories of fairness, particularly those that are based on cooperative game theory, that do not face the problem of non-aggregativity. We use this observation to argue that the (...) universal claim that no non-trivial theory of fairness can guarantee aggregativity is false. Paseau and Saunders’s mistaken assertion can be understood as arising from a neglect of the games approach to fair division. Our treatment has two further pay-offs: for one, we give an accessible introduction to the games approach to fair division, whose significance has hitherto not been appreciated by philosophers working on fairness. For another, our discussion explores the issue of aggregativity in fair division problems in a comprehensive fashion. (shrink)

In a recent article, Emanuel Rutten has presented a novel argument for the existence of God, defined as a personal being that is the first cause of reality. An interesting feature of the argument, which caused quite a stir, is that it does not fall within any of the traditional categories of arguments for God’s existence. Rutten calls his argument a modal-epistemic one, which reflects the fact that the first premise of his argument states that all possible truths are knowable. (...) The main purpose of this article is a simple one: to point out that Rutten’s modal-epistemic argument is flawed. (shrink)

In a recent article, Emanuel Rutten defends his Modal-Epistemic Argument (MEA) for the existence of God against various objections that I raised against it. In this article, I observe that Rutten’s defence fails for various reasons. Most notably though, the defence is self-undermining: the very claims that Rutten argues for in his defence yield novel counterexamples to the first premise of the MEA.

In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization of these (...) logics is left for further work. In this paper, based on our previous work on a functionally complete extension of Belnap’s logic, we present a sound and complete tableau calculus for these logics. It crucially exploits the Cartesian nature of the four values, which is reflected in the fact that each proof consists of two tableaux. The bi-facial notion of truth of Z&S is thus augmented with a bi-facial notion of proof. We also provide translations between the logics for semi-classical negation and classical logic and show that an argument is valid in a logic for semi-classical negation just in case its translation is valid in classical logic. (shrink)

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural dual (...) of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment (...) relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six. (shrink)

There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless . The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics , which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show that certain (...) computational problems, called query structures , can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth . The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. (shrink)

In a recent paper, Philip Kremer proposes a formal and theory-relative desideratum for theories of truth that is spelled out in terms of the notion of ‘no vicious reference’. Kremer’s Modified Gupta-Belnap Desideratum (MGBD) reads as follows: if theory of truth T dictates that there is no vicious reference in ground model M, then T should dictate that truth behaves like a classical concept in M. In this paper, we suggest an alternative desideratum (AD): if theory of truth T dictates (...) that there is no vicious reference in ground model M, then T should dictate that all T-biconditionals are (strongly) assertible in M. We illustrate that MGBD and AD are not equivalent by means of a Generalized Strong Kleene theory of truth and we argue that AD is preferable over MGBD as a desideratum for theories of truth. (shrink)

We discuss four distinct semantic consequence relations which are based on Strong Kleene theories of truth and which generalize the notion of classical consequence to 3-valued logics. Then we set up a uniform signed tableau calculus, which we show to be sound and complete with respect to each of the four semantic consequence relations. The signs employed by our calculus are,, and, which indicate a strict assertion, strict denial, tolerant assertion and tolerant denial respectively. Recently, Ripley applied the strict–tolerant account (...) of assertion and denial to develop a new approach to truth and alethic paradox, which we call the Strict–Tolerant Conceptionof Truth. The paper aims to contribute to our understanding of STCT in at least three ways. First, by developing the strict–tolerant calculus.Second, by developing a semantic version of the strict–tolerant calculus, which informs us about the assertoric possibilities relative to a fixed ground model. Third, by showing that the strict–tolerant calculus and assertoric semantics jointly suggest that STCT's claim that the strict and tolerant can be understood in terms of one another has to be reconsidered. (shrink)

The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In (...) terms of the \ calculus, we first introduce two different interpolation methods, each of which uniformly shows that the Dunn logics have the interpolation property. One of the methods is closely related to Maehara’s method but the other method, which we call the pruned tableau method, is novel to this paper. We provide various reasons to prefer the pruned tableau method to the Maehara-style method. We then turn our attention to extensions of Dunn logics with so-called appropriate implication connectives. Although these logics have been considered at various places in the literature, a study of the interpolation properties of these logics is lacking. We use the pruned tableau method to uniformly show that these extended Dunn logics have the interpolation property and explain that the same result cannot be obtained via the Maehara-style method. Finally, we show how the pruned tableau method constructs interpolants for functionally complete extensions of the Dunn logics. (shrink)

Uzquiano (Analysis 70:39–44, 2010 ) showed that the Hardest Logic Puzzle Ever ( HLPE ) [in its amended form due to Rabern and Rabern (Analysis 68:105–112, 2008 )] has a solution in only two questions. Uzquiano concludes his paper by noting that his solution strategy naturally suggests a harder variation of the puzzle which, as he remarks, he does not know how to solve in two questions. Wheeler and Barahona (J Philos Logic, to appear, 2011 ) formulated a three question (...) solution to Uzquiano’s puzzle and gave an information theoretic argument to establish that a two question solution for Uzquiano’s puzzle does not exist. However, their argument crucially relies on a certain conception of what it means to answer self-referential yes–no questions truly and falsely . We propose an alternative such conception which, as we show, allows one to solve Uzquiano’s puzzle in two questions. The solution strategy adopted suggests an even harder variation of Uzquiano’s puzzle which, as we will show, can also be solved in two questions. Just as all previous solutions to versions of HLPE , our solution is presented informally. The second part of the paper investigates the prospects of formally representing solutions to HLPE by exploiting theories of truth. (shrink)

Amsterdam University Press is a leading publisher of academic books, journals and textbooks in the Humanities and Social Sciences. Our aim is to make current research available to scholars, students, innovators, and the general public. AUP stands for scholarly excellence, global presence, and engagement with the international academic community.

Amsterdam University Press is a leading publisher of academic books, journals and textbooks in the Humanities and Social Sciences. Our aim is to make current research available to scholars, students, innovators, and the general public. AUP stands for scholarly excellence, global presence, and engagement with the international academic community.

In this paper, we present a framework in which we analyze three riddles about truth that are all (originally) due to Smullyan. We start with the riddle of the yes-no brothers and then the somewhat more complicated riddle of the da-ja brothers is studied. Finally, we study the Hardest Logic Puzzle Ever (HLPE). We present the respective riddles as sets of sentences of quotational languages , which are interpreted by sentence-structures. Using a revision-process the consistency of these sets is established. (...) In our formal framework we observe some interesting dissimilarities between HLPE’ s available solutions that were hidden due to their previous formulation in natural language. Finally, we discuss more recent solutions to HLPE which, by means of self-referential questions , reduce the number of questions that have to be asked in order to solve HLPE . Although the essence of the paper is to introduce a framework that allows us to formalize riddles about truth that do not involve self-reference, we will also shed some formal light on the self-referential solutions to HLPE. (shrink)

In this paper, we study the method of closure games, a game-theoretic valuation method for languages of self-referential truth developed by the author. We prove two theorems which jointly establish that the method of closure games characterizes all 3- and 4-valued strong Kleene fixed points in a novel, informative manner. Among others, we also present closure games which induce the minimal and maximal intrinsic fixed point of the strong Kleene schema.

In Smullyan’s well known logic puzzles, the notion of a knight, which is a creature that always speaks the truth, plays an important role. Rabern and Rabern (2008) made the following observation with respect to knights. They noted that when a knight is asked (1), he gets into serious trouble.

We confront the philosophical literature on fair division problems with axiomatic and game-theoretic work in economics. Firstly, we show that the proportionality method advocated in Curtis is not implied by a general principle of fairness, and that the proportional rule cannot be explicated axiomatically from that very principle. Secondly, we suggest that Broome’s notion of claims is too restrictive and that game-theoretic approaches can rectify this shortcoming. More generally, we argue that axiomatic and game-theoretic work in economics is an indispensable (...) ingredient of any theorizing about fair division problems and allocative justice. (shrink)

Philosophical theories of fairness propose to divide a good that several individuals have a claim to in proportion to the strength of their respective claims. We suggest that currently, these theories face a dilemma when dealing with a good that is indivisible. On the one hand, theories of fairness that use weighted lotteries are either of limited applicability or fall prey to an objection by Brad Hooker. On the other hand, accounts that do without weighted lotteries fall prey to three (...) fairness paradoxes. We demonstrate that division methods from apportionment theory, which has hitherto been ignored by philosophical theories of fairness, can be used to provide fair division for indivisible goods without weighted lotteries and without fairness paradoxes. (shrink)

In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...) intersections of auxiliary relations that can be captured with the help of a single calculus---lends itself well to proving interpolation. All entailment relations just mentioned have the interpolation property, not only when they are defined with respect to a functionally complete language, but also in a range of cases where less expressive languages are considered. For example, we will show that |=, when restricted to L_{tf}, the language originally considered by Shramko and Wansing, enjoys interpolation. This answers a question that was recently posed by M. Takano. (shrink)

The important ‘no-envy’ fairness criterion has typically been attributed to Foley and sometimes to Tinbergen. We reveal that Jan Tinbergen introduced ‘no-envy’ as a fairness criterion in his article “Mathematiese Psychologie” published in 1930 in the Dutch journal Mens en Maatschappij and translated as “Mathematical Psychology” in 2021 in the Erasmus Journal for Philosophy and Economics. Our article accompanies the translation: we introduce Tinbergen’s 1930 formulation of the ‘no-envy’ criterion, compare it to other formulations, and comment on its significance for (...) the fairness literature in philosophy and economics. (shrink)

Recently, Stefan Wintein published an article in which he presents four objections to my modal-epistemic argument for the existence of God. His first objection is an alleged counterexample to the argument’s first premise, and the second objection is an alleged counterexample to the argument’s second premise. Wintein’s third objection attempts to show that the modal-epistemic argument is circular. Finally, the fourth objection is a parody objection. In this paper, I show that Wintein’s four objections all fail.

Stefan Collini challenges the common claim that universities need to show that they help to make money in order to justify getting more money.

According to an increasingly popular view among philosophers of science, both causal and non-causal explanations can be accounted for by a single theory: the counterfactual theory of explanation. A kind of non-causal explanation that has gained much attention recently but that this theory seems unable to account for are grounding explanations. Reutlinger :239-256, 2017) has argued that, despite these appearances to the contrary, such explanations are covered by his version of the counterfactual theory. His idea is supported by recent work (...) on grounding by Schaffer and Wilson who claim there to be a tight connection between grounding and counterfactual dependence. The present paper evaluates the prospects of the idea. We show that there is only a weak sense in which grounding explanations convey information about counterfactual dependencies, and that this fact cannot plausibly be taken to reveal a distinctive feature that grounding explanations share with other kinds of explanations. (shrink)

Einleitung -- Charismatische Herrschaft -- Traditionale Herrschaft -- Traditionale und charismatische Herrschaft im vorrationalen Okzident: Antike -- Traditionale und charismatische Herrschaft im vorrationalen Okzident: Mittelalter -- Legale Herrschaft.

The desideratum of semantic interoperability has been intensively discussed in medical informatics circles in recent years. Originally, experts assumed that this issue could be sufficiently addressed by insisting simply on the application of shared clinical terminologies or clinical information models. However, the use of the term ‘ontology’ has been steadily increasing more recently. We discuss criteria for distinguishing clinical ontologies from clinical terminologies and information models. Then, we briefly present the role clinical ontologies play in two multicentric research projects. Finally, (...) we discuss the interactions between these different kinds of knowledge representation artifacts and the stakeholders involved in developing interoperational real-world clinical applications. We provide ontology engineering examples from two EU-funded projects. (shrink)

The pivotal role of the relation part-of in the description of living organisms is widely acknowledged. Organisms are open systems, which means that in contradistinction to mechanical artifacts they are characterized by a continuous flow and exchange of matter. A closer analysis of the spatial relations in biological organisms reveals that the decision as to whether a given particular is part-of a second particular or whether it is only contained-in the second particular is often controversial. We here propose a rule-based (...) approach which allows us to decide on the basis of well-defined criteria which of the two relations holds between two anatomical objects, given that one spatially includes the other. We discuss the advantages and limitations of this approach, using concrete examples from human anatomy. (shrink)

Artificial Intelligence (AI) is increasingly adopted in society, creating numerous opportunities but at the same time posing ethical challenges. Many of these are familiar, such as issues of fairness, responsibility and privacy, but are presented in a new and challenging guise due to our limited ability to steer and predict the outputs of AI systems. This chapter first introduces these ethical challenges, stressing that overviews of values are a good starting point but frequently fail to suffice due to the context (...) sensitivity of ethical challenges. Frequently, additional (ethical) values emerge for specific applications, as e.g. challenges with fraud detection are very different from those around language technologies. Second, methods to tackle these challenges are discussed. Main ethical theories (virtue ethics, consequentialism, and deontology) are shown to provide a starting point, but often lack the details needed for actionable AI Ethics. Instead, mid-level philosophical theories coupled to design-approaches such as Design for Values, together with interdisciplinary working methods, offer the best way forwards. The chapter aims to show how these approaches can lead to an ethics of AI that is actionable and that can be proactively integrated in the design of AI systems. (shrink)

Explainable artificial intelligence (XAI) aims to help people understand black box algorithms, particularly of their outputs. But what are these explanations and when is one explanation better than another? The manipulationist definition of explanation from the philosophy of science offers good answers to these questions, holding that an explanation consists of a generalization that shows what happens in counterfactual cases. Furthermore, when it comes to explanatory depth this account holds that a generalization that has more abstract variables, is broader in (...) scope and/or more accurate is better. By applying these definitions and contrasting them with alternative definitions in the XAI literature I hope to help clarify what a good explanation is for AI. (shrink)

This imaginative and unusual book explores the moral sensibilities and cultural assumptions that were at the heart of political debate in Victorian and early twentieth-century Britain. It focuses on the role of intellectuals as public moralists and suggests ways in which their more formal political theory rested upon habits of response and evaluation that were deeply embedded in wider social attitudes and aesthetic judgments. Collini examines the characteristic idioms and strategies of argument employed in periodical and polemical writing, and reconstructs (...) the sense of identity and of relation to an audience exhibited by social critics from John Stuart Mill and Matthew Arnold to J.M. Keynes and F.R. Leavis. (shrink)

Examines widespread myths about transhumanism and explores the most pressing ethical issues in the debate over technologically assisted human enhancement.

Between 1918 and 1933, the masses became a decisive preoccupation of European culture, fueling modernist movements in art, literature, architecture, theater, and cinema, as well as the rise of communism and fascism and experiments in radical democracy. Spanning aesthetics, cultural studies, intellectual history, and political theory, this volume unpacks the significance of the shadow agent known as "the mass" during a critical period in European history. It follows its evolution into the preferred conceptual tool for social scientists, the ideal slogan (...) for politicians, and the chosen image for artists and writers trying to capture a society in flux and a people in upheaval. This volume is the second installment in Stefan Jonsson's epic study of the crowd and the mass in modern Europe, building on his work in _A Brief History of the Masses_, which focused on monumental artworks produced in 1789, 1889, and 1989. (shrink)

This study defends the legitimacy of the Enlightenment project by way of its different realizations in the philosophies of Immanuel Kant and Friedrich Heinrich Jacobi. Today, Enlightenment as a cosmopolitan project with a global claim is often considered synonymous with Western chauvinism. The assertion of a universally binding reason is all too obviously inconsistent with the much-cited recognition of cultural differences. In contrast, it is the conviction brought forward in this book that an adequately understood Enlightenment is an unconditional right (...) of every person taking an active interest in a self-determined way of life. Only the realization of this conception of Enlightenment can provide the required space for the reciprocal recognition of human differences to freely unfold. (shrink)

Die Begegnung von Buddhismus und Christentum fordert ein verwandeltes Selbstverständnis philosophischen Denkens. Der japanische Philosoph Keiji Nishitani sieht in der existenziellen Radikalisierung der Frage «Was ist Religion?» bis zum buddhistischen Standpunkt der Leere die Möglichkeit der Überwindung des Nihilismus. Seine Geschichtsinterpretation öffnet in dieser Arbeit den Zugang zu Nietzsches Leib-Denken in seinem Zarathustra. In diesem Rahmen versucht der Verfasser, mit einer Methodenvielfalt und in Auseinandersetzung mit wichtigen abendländischen Denkern die Fraglichkeit jener Frage an ihre Grenze zu treiben.

The topic of this thesis is axiological uncertainty – the question of how you should evaluate your options if you are uncertain about which axiology is true. As an answer, I defend Expected Value Maximisation (EVM), the view that one option is better than another if and only if it has the greater expected value across axiologies. More precisely, I explore the axiomatic foundations of this view. I employ results from state-dependent utility theory, extend them in various ways and interpret (...) them accordingly, and thus provide axiomatisations of EVM as a theory of axiological uncertainty. (shrink)

Towards a critical posthumanism -- Genealogy of posthumanism -- Our posthuman humanity and the multiplicity of its forms -- Posthumanism and science fiction -- Interdisciplinarity and the posthumanities -- Posthumanism, digitalization, and new media -- Posthumanity, subject, and system -- Other side of life.

Sur la décomposition des ensembles de points en parties respectivement congruentes.

Stefan Jonsson uses three monumental works of art to build a provocative history of popular revolt: Jacques-Louis David's _The Tennis Court Oath_ (1791), James Ensor's _Christ's Entry into Brussels in 1889_ (1888), and Alfredo Jaar's _They Loved It So Much, the Revolution_ (1989). Addressing, respectively, the French Revolution of 1789, Belgium's proletarian messianism in the 1880s, and the worldwide rebellions and revolutions of 1968, these canonical images not only depict an alternative view of history but offer a new understanding (...) of the relationship between art and politics and the revolutionary nature of true democracy. Drawing on examples from literature, politics, philosophy, and other works of art, Jonsson carefully constructs his portrait, revealing surprising parallels between the political representation of "the people" in government and their aesthetic representation in painting. Both essentially "frame" the people, Jonsson argues, defining them as elites or masses, responsible citizens or angry mobs. Yet in the aesthetic fantasies of David, Ensor, and Jaar, Jonsson finds a different understanding of democracy-one in which human collectives break the frame and enter the picture. Connecting the achievements and failures of past revolutions to current political issues, Jonsson then situates our present moment in a long historical drama of popular unrest, making his book both a cultural history and a contemporary discussion about the fate of democracy in our globalized world. (shrink)

How do we get out knowledge of the natural numbers? Various philosophical accounts exist, but there has been comparatively little attention to psychological data on how the learning process actually takes place. I work through the psychological literature on number acquisition with the aim of characterising the acquisition stages in formal terms. In doing so, I argue that we need a combination of current neologicist accounts and accounts such as that of Parsons. In particular, I argue that we learn the (...) initial segment of the natural numbers on the basis of the Fregean definitions, but do not learn the natural number structure as a whole on the basis of Hume's principle. Therefore, we need to account for some of the consistency of our number concepts with the Dedekind-Peano axioms in other terms. (shrink)

In this annotated critical edition of Aristotle’s Metaphysics Lambda Stefan Alexandru draws upon many hitherto unexplored sources of the direct and indirect tradition, inter alia upon an independent Greek manuscript he has discovered in the Vatican Library.