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 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)

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.

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)

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)

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)

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

"Provides translations of Bolzano's most important work on grounding, including previously untranslated material"--.

In this chapter we deal with the challenge to the existence of free will and moral responsibility that is raised by the threat of determinism from a Wittgensteinian perspective. Our argument starts by briefly recapitulating Wittgenstein’s analysis of the practice of doubt in On Certainty. We subsequently turn to the problem of free will. We argue that the existence of free will is a basic certainty and that the thesis of determinism fails to cast doubt on it. We thereby make (...) use of – but also try to go beyond – Wittgenstein’s own remarks in his “Lectures on Freedom of the Will”. In the final section we focus more explicitly on moral responsibility. Inspired by P.F. Strawson’s work on free will and moral responsibility, which we take to be deeply Wittgensteinian, we argue that our practices of holding each other responsible manifest basic human certainties which cannot be meaningfully challenged by invoking the thesis of determinism. (shrink)

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

Users of sociotechnical systems often have no way to independently verify whether the system output which they use to make decisions is correct; they are epistemically dependent on the system. We argue that this leads to problems when the system is wrong, namely to bad decisions and violations of the norm of practical reasoning. To prevent this from occurring we suggest the implementation of defeaters: information that a system is unreliable in a specific case (undercutting defeat) or independent information that (...) the output is wrong (rebutting defeat). Practically, we suggest to design defeaters based on the different ways in which a system might produce erroneous outputs, and analyse this suggestion with a case study of the risk classification algorithm used by the Dutch tax agency. (shrink)

In order to explain that sentences containing empty definite descriptions are nevertheless true or false, Russell famously analyzes sentences of the form ‘The F is G’ as ‘There is exactly one F and it is G’. Against this it has been objected that Russell’s analysis provides the wrong truth-conditions when it comes to non-doxastic attitude ascriptions. For example, according to Heim, Kripke, and Elbourne (HKE), there are circumstances in which (1) is true and (2) is false. Hans wants the ghost (...) in his attic to be quiet tonight.Hans wants there to be exactly one ghost in his attic and for it to be quiet tonight. After all, the argument goes, unlike (2), (1) can be true without Hans wanting there to be exactly one ghost in his attic. Kaplan and Neale famously reply that the HKE objection presupposes that non-doxastic attitudes are closed under entailment, which they are not. For Rostworowski, on the other hand, the problematic principle used by the HKE objection is a substitutivity principle for non-doxastic attitude ascriptions. This is further supported by the fact that, as Elbourne points out, Russell’s analysis already leads to a problem similar to the HKE objection together with substitutivity alone. By questioning substitutivity for non-doxastic attitude ascriptions, Rostworowski tries to block both the HKE objection and Elbourne’s variant of the HKE objection. In this paper, I will argue that Russell’s analysis of definite descriptions leads to a variant of the HKE objection even in the context of doxastic attitude ascriptions. Since, as we will see, doxastic attitude ascriptions do not seem to suffer from the substitutivity problems discussed by Rostworowski in the context of non-doxastic attitude ascriptions, this will further exacerbate the problem for Russell’s analysis. I will then discuss the possibility to reject substitutivity for doxastic attitude ascriptions using a contextualist analysis of attitude ascriptions. However, we will see that, independent of whether we accept substitutivity for doxastic attitude ascriptions, a complete solution of the doxastic problem has to reject Russell’s analysis of the truth-conditions of sentences of the form ‘The F is G’. Concluding, I will show that, unlike Russell’s analysis, the Frege–Strawson analysis of definite descriptions, according to which a sentence of the form ‘The F is G’ presupposes that there is exactly one F, rather than asserting it, provides an explanation of the HKE objection, Elbourne’s variant of the HKE objection, and the doxastic problem presented in this paper. This will speak not only in favor of a Fregean analysis of definite descriptions, but also of a Fregean conception of propositions. (shrink)

Transhumanism : in a nutshell -- On a silicon-based transhumanism -- On a carbon-based transhumanism -- A fictive ethics -- The end of the beginning.

Wenn digitale Technologien wie künstliche Intelligenz, Blockchain und Robotik auf die Medizin treffen, entstehen zwangsläufig ethische Fragestellungen. Diese lassen sich nicht ohne Weiteres mit medizinisch-technologischen, rechtlichen oder ökonomischen Argumenten allein beantworten. Neue Themenfelder wie die sich wandelnde Rolle der Patienten, die neue Verantwortung von Ärzten und Pflegenden, neue digitale Möglichkeiten in der Medizin, Smart Hospitals im Klinikalltag, die gesellschaftliche Legitimität eines möglichen dritten Datengesundheitsmarktes, eine zukunftsfeste Ausbildungslandschaft für den Gesundheits-/Medizinbereich sowie die Grenzen der digitalen Forschung bedürfen einer kritischen und gleichzeitig (...) thematisch breiten Auseinandersetzung mit ethischen Aspekten in der digitalen Gesundheitswirtschaft und Medizin. (shrink)

Das Werk entkräftet das Vorurteil, Kants Philosophie sei für eine Reflexion der kulturellen Welt unzureichend. Klingner entwickelt die Option einer Kulturphilosophie als Theorie technischer Vernunft mit Bezug auf den kantischen Kulturbegriff und auf seinen Philosophiebegriff. Damit erweist sich zugleich, dass eine kantische Kulturphilosophie rekonstruierbar und in ihrem Gehalt auch heute noch diskussionswürdig ist.

This chapter discusses some of the central theoretical perspectives on culture and cultural practices implied in Pragmatism and interactive constructivism. The first part of the chapter highlights three major perspectives on cultural theory to be found in Dewey's thought: culture and experience, culture and habit, and culture and communication. The chapter then compares basic conceptual tools and interpretive approaches and shows that Dewey's work continues to provide fundamental resources in this field. Through this connection, it presents a brief introduction to (...) theories of discourse and power and discusses some implications for current controversies regarding multiculturalism. It argues that Dewey's Pragmatism and the Cologne program of interactive constructivism share a robust interest in culture and cultural diversity. (shrink)

Throughout his philosophical work, Schelling came to increasingly emphasize his conviction that the ultimate principles of philosophy are essentially practical: the ego formally conceived as act in early philosophy, creation as the unfolding of structurally rich action in late philosophy. It remained unclear, however, exactly what constituted the practicality of these principles, namely which concept of action Schelling used and how it is being integrated into the totality of his system. The task this study sets itself is to investigate into (...) these issues in respect to his middle and late philosophy. With the doctrine of potencies serving as point of departure, spirit is first reconstructed as practical consciousness. Creation as an ontotheological original act with the historical world as the space of human action is then systematically developed. Freedom, foresight, purposefulness, intentionality and futurity prove to be the central practical attributes of both human and divine action. Their connection is manifested in the religious consciousness of man and instantiated metaphysically in the relationship of time and eternity. Schelling's positive philosophy shows that these practical aspects are the irreducable prerequisites to render the historical world process intelligible. (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)

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

Die klassische deutsche Philosophie zählt zu den bedeutendsten und wirkmächtigsten Diskursformationen. Die Beiträge bieten eine grundlegende Orientierung sowie systematische Analysen zu Schlüsselbegriffen und Grundproblemen der praktischen Philosophie dieser Epoche. Neben den Klassikern wie Kant, Fichte und Hegel werden auch Beziehungen zu aktuellen Debatten behandelt und analysiert.

Originally presented as author's thesis (doctoral)--Universitèat zu Kèoln, 2011/12).

We are currently witnessing the emergence of a ‘third culture’, driven by unprecedented developments that are changing the playing field. These include advances in AI, big data analysis and robotics. The traditional ‘two cultures’ view (S. P. Snow) distinguishes between the sciences and the humanities. The wisdoms these two cultures offer are separated from each other, with little to no interaction or mutual comprehension. However, over the past two decades, and for the first time in human history, a new, third (...) culture has appeared. This new culture, rooted in new technologies, not only pursues its own form of rationality but also supports advances in the original two cultures, deepening and expanding our individual and collective consciousness so that we can see more and do better. It will eventually give rise to new forms of consciousness based not on biochemical signals, but on copper wires and lithium chips. These new machine intelligences will change the world and force us to realise: we are no longer alone. The human species’ position in the twenty-first century will be fundamentally redefined: not as a conductor leading the orchestra, but a single string player within it. (shrink)