Death determination has long been a topic of intensive technoscientific and medical involvement. Due to advances in twentieth-century medical technology, the distinction between life and death has become less evident. Ambiguities appear when we start to use life-support technologies in order to save lives, bringing about “tragic artifacts” such as brain death and persistent vegetative state. In this paper we ask how this technoscientific and medical involvement shapes our understanding of death. We provide an overview of medical literature that has (...) appeared on (brain) death determination, highlighting thereby the role that technologies played in its establishment. Subsequently, we develop three philosophical interpretations of technological death determination: With Agamben and Marcuse as the installation of political power; with Don Ihde as an existential choice for the inevitable; and with Jacques Derrida as an encounter with the ineradicable mystery of death. To conclude, we argue that technological death determination reveals an intrinsic, paradoxical connection between human’s technicity and its ignorance of death. (shrink)

Death determination has long been a topic of intensive technoscientific and medical involvement. Due to advances in twentieth-century medical technology, the distinction between life and death has become less evident. Ambiguities appear when we start to use life-support technologies in order to save lives, bringing about “tragic artifacts” such as brain death and persistent vegetative state. In this paper we ask how this technoscientific and medical involvement shapes our understanding of death. We provide an overview of medical literature that has (...) appeared on (brain) death determination, highlighting thereby the role that technologies played in its establishment. Subsequently, we develop three philosophical interpretations of technological death determination: With Agamben and Marcuse as the installation of political power; with Don Ihde as an existential choice for the inevitable; and with Jacques Derrida as an encounter with the ineradicable mystery of death. To conclude, we argue that technological death determination reveals an intrinsic, paradoxical connection between human’s technicity and its ignorance of death. (shrink)

There has been an increased focus within the AI ethics literature on questions of power, reflected in the ideal of accountability supported by many Responsible AI guidelines. While this recent debate points towards the power asymmetry between those who shape AI systems and those affected by them, the literature lacks normative grounding and misses conceptual clarity on how these power dynamics take shape. In this paper, I develop a workable conceptualization of said power dynamics according to Cristiano Castelfranchi’s conceptual framework (...) of power and argue that end-users depend on a system’s developers and users, because end-users rely on these systems to satisfy their goals, constituting a power asymmetry between developers, users and end-users. I ground my analysis in the neo-republican moral wrong of domination, drawing attention to legitimacy concerns of the power-dependence relation following from the current lack of accountability mechanisms. I illustrate my claims on the basis of a risk-prediction machine learning system, and propose institutional and project-specific solutions to mitigate domination. (shrink)

Conversational exculpature is a pragmatic process whereby information is subtracted from, rather than added to, what the speaker literally says. This pragmatic content subtraction explains why we can say “Rob is six feet tall” without implying that Rob is between 5'0.99" and 6'0.01" tall, and why we can say “Ellen has a hat like the one Sherlock Holmes always wears” without implying Holmes exists or has a hat. This article presents a simple formalism for understanding this pragmatic mechanism, specifying how, (...) in context, the result of such subtractions is determined. And it shows how the resulting theory of conversational exculpature accounts for a varied range of linguistic phenomena. A distinctive feature of the approach is the crucial role played by the question under discussion in determining the result of a given exculpature. (shrink)

Choices confront us with questions. How we act depends on our answers to those questions. So the way our beliefs guide our choices is not just a function of their informational content, but also depends systematically on the questions those beliefs address. This paper gives a precise account of the interplay between choices, questions and beliefs, and harnesses this account to obtain a principled approach to the problem of deduction. The result is a novel theory of belief-guided action that explains (...) and predicts the decisions of agents who, like ourselves, fail to be logically omniscient: that is, of agents whose beliefs may not be deductively closed, or even consistent. (Winner of the 2021 Isaac Levi Prize.). (shrink)

This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive methods standardly used in science presuppose that every proposition about the outcome of a chancy process has a certain chance between 0 and 1. I also argue in favour of the standard view that chances are countably additive. Since it is possible to randomly pick (...) out a point on a continuum, for instance using a roulette wheel or by flipping a countable infinity of fair coins, it follows, given the axioms of ZFC, that there are many different cardinalities between countable infinity and the cardinality of the continuum. (shrink)

Kripke showed how to restrict Tarski’s schema to grounded sentences. I examine the prospects for an analogous approach to the paradoxes of naive class comprehension. I present new methods to obtain theories of grounded classes and test them against antecedently motivated desiderata. My findings cast doubt on whether a theory of grounded classes can accommodate both the extensionality of classes and allow for class definition in terms of identity.

In philosophical logic, a certain family of model constructions has received particular attention. Prominent examples are the cumulative hierarchy of well-founded sets, and Kripke's least fixed point models of grounded truth. I develop a general formal theory of groundedness and explain how the well-founded sets, Cantor's extended number-sequence and Kripke's concepts of semantic groundedness are all instances of the general concept, and how the general framework illuminates these cases. Then, I develop a new approach to a grounded theory of proper (...) classes. -/- However, the general concept of groundedness does not account for the philosophical significance of its paradigm instances. Instead, I argue, the philosophical content of the cumulative hierarchy of sets is best understood in terms of a primitive notion of ontological priority. -/- Then, I develop an analogous account of Kripke's models. I show that they exemplify the in-virtue-of relation much discussed in contemporary metaphysics, and thus are philosophically significant. I defend my proposal against a challenge from Kripke's “ghost of the hierarchy”. (shrink)

This paper proposes a new account of bounded or minimal doxastic rationality (in the sense of Cherniak 1986), based on the notion that beliefs are answers to questions (à la Yalcin 2018). The core idea is that minimally rational beliefs are linked through thematic connections, rather than entailment relations. Consequently, such beliefs are not deductively closed, but they are closed under parthood (where a part is an entailment that answers a smaller question). And instead of avoiding all inconsistency, minimally rational (...) believers only avoid blatant inconsistencies (where some beliefs are blatantly inconsistent when they contradict one another on a particular question). Rather than cohering into a single overall world view, beliefs are more loosely connected in what is best described as a web of questions. This view of minimally rational belief naturally gives rise to an account of deductive inquiry on which deductive reasoning is a matter of posing new questions. (shrink)

Newton’s First Law of Motion is typically understood to govern only the motion of force-free bodies. This paper argues on textual and conceptual grounds that it is in fact a stronger, more general principle. The First Law limits the extent to which any body can change its state of motion –– even if that body is subject to impressed forces. The misunderstanding can be traced back to an error in the first English translation of Newton’s Principia, which was published a (...) few years after Newton’s death. (shrink)

Using Riemann’s Rearrangement Theorem, Øystein Linnebo (2020) argues that, if it were possible to apply an infinite positive weight and an infinite negative weight to a working scale, the resulting net weight could end up being any real number, depending on the procedure by which these weights are applied. Appealing to the First Postulate of Archimedes’ treatise on balance, I argue instead that the scale would always read 0 kg. Along the way, we stop to consider an infinitely jittery flea, (...) an infinitely protracted border conflict, and an infinitely electric glass rod. (shrink)

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as "Alternating-time Temporal Logic". The key insight in (...) ATL is that the path quantifiers of CTL could be replaced by "cooperation modalities", of the form $\langle \langle \Gamma \rangle \rangle $, where Γ is a set of agents. The intended interpretation of an ATL formula $\langle \langle \Gamma \rangle \rangle \varphi $ is that the agents Γ can cooperate to ensure that φ holds. In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as "group Γ can cooperate to bring about φ iff it is common knowledge in Γ that ψ". The resulting logic -- Alternating-time Temporal Epistemic Logic -- shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (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)

Although normative systems, or social laws, have proved to be a highly influential approach to coordination in multi-agent systems, the issue of compliance to such normative systems remains problematic. In all real systems, it is possible that some members of an agent population will not comply with the rules of a normative system, even if it is in their interests to do so. It is therefore important to consider the extent to which a normative system is robust, i.e., the extent (...) to which it remains effective even if some agents do not comply with it. We formalise and investigate three different notions of robustness and related decision problems. We begin by considering sets of agents whose compliance is necessary and/or sufficient to guarantee the effectiveness of a normative system; we then consider quantitative approaches to robustness, where we try to identify the proportion of an agent population that must comply in order to ensure success; and finally, we consider a more general approach, where we characterise the compliance conditions required for success as a logical formula. We furthermore introduce a logic for specifying properties of norm compliance in general and norm robustness in particular. (shrink)

Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importantly, intentions are very closely (...) connected with other mental states—in particular, beliefs about the future and the abilities of the agent. So, we cannot study them in isolation. We must consider the interplay between intention revision and the revision of other mental states, which complicates the picture considerably. In this paper, we present some first steps towards a theory of intention revision. We develop a simple model of an agent’s mental states, and define intention revision operators. Using this model, we develop a logic of intention dynamics, and then investigate some of its properties. (shrink)

Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the Alternating-time Temporal Logic (atl) of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems. (...) Second, we show that the effectiveness, feasibility, and synthesis problems for social laws may naturally be framed as atl model checking problems, and that as a consequence, existing atl model checkers may be applied to these problems. Third, we show that the complexity of the feasibility problem in our framework is no more complex in the general case than that of the corresponding problem in the Shoham–Tennenholtz framework (it is np-complete). Finally, we show how our basic framework can easily be extended to permit social laws in which constraints on the legality or otherwise of some action may be explicitly required. We illustrate the concepts and techniques developed by means of a running example. (shrink)

Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo Park.

I present a new pragmatic theory of loose talk, focussing on the loose use of numbers and measurement expressions. The account explains loose readings as arising from a pragmatic mechanism aimed at restoring relevance to the question under discussion (QUD), appealing to Krifka's notion of a measurement scale. The core motivating observation is that the loose reading of a claim need not be weaker than its literal content, as almost all pragmatic treatments of loose talk have assumed (e.g. Lasersohn). The (...) loosening mechanism described here can be applied to a range of other linguistic phenomena as well. (shrink)

Qualitative Coalitional Games are a variant of coalitional games in which an agent's desires are represented as goals that are either satisfied or unsatisfied, and each choice available to a coalition is a set of goals, which would be jointly satisfied if the coalition made that choice. A coalition in a QCG will typically form in order to bring about a set of goals that will satisfy all members of the coalition. Our goal in this paper is to develop and (...) study logics for reasoning about QCGs. We begin by introducing a logic for reasoning about “static” QCGs, where participants play a single game, and we then introduce and study Temporal QCGs , i.e., games in which a sequence of QCGs is played. In order to represent and reason about such games, we introduce a linear time temporal logic of QCGs, called ℒ. We give a complete axiomatisation of ℒ, use it to investigate the properties of TQCGs, identify its expressive power, establish its complexity, characterise classes of TQGCs with formulas from our logical language, and use it to formulate several solution concepts for TQCGs. (shrink)

We extend our general approach to characterizing information to multi-agent systems. In particular, we provide a formal description of an agent's knowledge containing exactly the information conveyed by some (honest) formula φ. Only knowing is important for dynamic agent systems in two ways. First of all, one wants to compare different states of knowledge of an agent and, secondly, for agent a's decisions, it may be relevant that (he knows that) agent b does not know more than φ. There are (...) three ways to study the question whether a formula φ can be interpreted as minimal information. The first method is semantic and inspects 'minimal' models for φ (with respect to some information order ≤ on states). The second one is syntactic and searches for stable expansions, minimal with respect to some language $\scr{L}^{\ast}$ . The third method is a deductive test, known as the disjunction property. We present a condition under which the three methods are equivalent. Then, we show how to construct the order ≤ by collecting 'layered orders'. Focusing on the multi-agent case we identify languages $\scr{L}^{\ast}$ for various orders ≤, and show how they yield different notions of honesty for different multi-modal systems. We then provide several tools for studying honesty types and illustrate their usefulness on a number of examples, for three modal systems of particular interest. Finally, we relate the different notions of minimal knowledge, and describe possible patterns of honesty for these systems. (shrink)

We propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the notions of honesty and circumscription in this logic: What is the state of an agent that only knows and which honest enable such circumscription? Redefining stable sets enables us to provide suitable syntactic and semantic criteria for (...) honesty. The rough syntactic definition of honesty is the existence of a minimal stable expansion, so the problem resides in the ordering relation underlying minimality. We discuss three different proposals for this ordering, together with their semantic counterparts, and show their effects on the induced notions of honesty. (shrink)

Models of collective deliberation often assume that the chief aim of a deliberative exchange is the sharing of information. In this paper, we argue that an equally important role of deliberation is to draw participants’ attention to pertinent questions, which can aid the assembly and processing of distributed information by drawing deliberators’ attention to new issues. The assumption of logical omniscience renders classical models of agents’ informational states unsuitable for modelling this role of deliberation. Building on recent insights from psychology, (...) linguistics and philosophy about the role of questions in speech and thought, we propose a different model in which beliefs are treated as answers directed at specific questions. Here, questions are formally represented as partitions of the space of possibilities and individuals’ information states as sets of questions and corresponding partial answers to them. The state of conversation is then characterised by individuals’ information together with the questions under discussion, which can be steered by various deliberative inputs. Using this model, deliberation is then shown to shape collective decisions in ways that classical models cannot capture, allowing for novel explanations of how group consensus is achieved. (shrink)

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...) complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...) complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

BackgroundThis article is part of a study to gain insight into the decision-making process by looking at the views of the relatives of potential brain dead donors. Alongside a literature review, focus interviews were held with healthcare professionals about their role in the request and decision-making process when post-mortal donation is at stake. This article describes the perspectives of the relatives.MethodsA content-analysis of 22 semi-structured in-depth interviews with relatives involved in an organ donation decision.ResultsThree themes were identified: ‘conditions’, ‘ethical considerations’ (...) and ‘look back’. Conditions were: ‘sense of urgency’, ‘incompetence to decide’ and ‘agreement between relatives’. Ethical considerations result in a dilemma for non-donor families: aiding people or protecting the deceased’s body, especially when they do not know his/her preference. Donor families respect the deceased’s last will, generally confirmed in the National Donor Register. Looking back, the majority of non-donor families resolved their dilemma by justifying their decision with external arguments. Some non-donor families would like to be supported during decision-making.DiscussionThe discrepancy between general willingness to donate and the actual refusal of a donation request can be explained by multiple factors, with a cumulative effect. Firstly, half of the participants stated that they felt that they were not competent to decide in such a crisis and they seem to struggle with utilitarian considerations against their wish to protect the body. Secondly, non-donor families refused telling that they did not know the deceased’s wishes or contesting posthumous autonomy of the eligible. Thirdly, the findings emphasise the importance of Donor Registration, because it seems to prevent dilemmas in decision-making, at least for donor families.ConclusionDiscrepancies between willingness to consent to donate and refusal at the bedside can be attributed to an unresolved dilemma: aiding people or protect the body of the deceased. Non-donor families felt incompetent to decide. They refused consent for donation, since their deceased had not given any directive. When ethical considerations do not lead to an unambiguous answer, situational factors were pivotal. Relatives of unregistered eligible donors are more prone to unstable decisions. To overcome ambivalence, coaching during decision-making is worth investigation. (shrink)

In the Netherlands, consent from relatives is obligatory for post mortal donation. This study explored the perspectives of relatives regarding the request for consent for donation in cases without donor registration. A content analysis of narratives of 24 bereaved relatives of unregistered, eligible, brain-dead donors was performed. Relatives of unregistered, brain-dead patients usually refuse consent for donation, even if they harbour pro-donation attitudes themselves, or knew that the deceased favoured organ donation. Half of those who refused consent for donation mentioned (...) afterwards that it could have been an option. The decision not to consent to donation is attributed to contextual factors, such as feeling overwhelmed by the notification of death immediately followed by the request; not being accustomed to speaking about death; inadequate support from other relatives or healthcare professionals, and lengthy procedures. Healthcare professionals could provide better support to relatives prior to donation requests, address their informational needs and adapt their message to individual circumstances. It is anticipated that the number of consenting families could be enlarged by examining the experience of decoupling and offering the possibility of consent for donation after circulatory death if families refuse consent for donation after brain-death. (shrink)

Hans van Ditmarsch, Wiebe van der Hoek and Barteld Kooi (2011). Reasoning about local properties in modal logic. In K. Tumer and P. Yolum and L. Sonenberg and P. Stone (editors). Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 711-718.

We demonstrate ways to incorporate nondeterminism in a system designed to formalize the reasoning of agents concerning their abilities and the results of the actions that they may perform. We distinguish between two kinds of nondeterministic choice operators: one that expresses an internal choice, in which the agent decides what action to take, and one that expresses an external choice, which cannot be influenced by the agent. The presence of abilities in our system is the reason why the usual approaches (...) towards nondeterminism cannot be used here. The semantics that we define for nondeterministic actions is based on the idea that composite actions are unravelled in the strings of atomic actions and tests that constitute them. The main notions used in defining this semantics are finite computation sequences and finite computation runs of actions. The results that we obtain meet our intuitions regarding events and abilities in the presence of nondeterminism. (shrink)

Connectives and cue phrases are the most prototypical linguistic elements that signal coherence relations, but by limiting our attention to connectives, we are likely missing out on important other cues readers and listeners use when establishing coherence relations. However, defining the role of other types of linguistic elements in the signaling of coherence relations is not straightforward, and it is also not obvious why and how non-connective elements function as signals for coherence relations. In this paper, we aim to develop (...) a systematic way of categorizing segment-internal elements as signals of coherence relations on the basis of a literature review and evidence from parallel corpora. We propose a three-way distinction betweendivision of labor, agreement, andgeneral collocationto categorize the different ways in which elements inside discourse segments interact with connectives in the marking of coherence relations. In each type of interaction, segment-internal elements can function as signals for coherence relations, but the mechanism behind it is slightly different for each type. (shrink)

We define balance games, which describe the formation of friendships and enmity in social networks. We show that if the agents give high priority to future profits over short term gains, all Pareto optimal strategies will eventually result in a balanced network. If, on the other hand, agents prioritize short term gains over the long term, every Nash equilibrium eventually results in a network that is stable but that might not be balanced.