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)

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)

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)

Deepfakes are hyper-realistic but fabricated videos created with the use of artificial intelligence. In the context of psychotherapy, the first studies on using deepfake technology are emerging, with potential applications including grief counselling and treatment for sexual violence-related trauma. This paper explores these applications from the perspective of medical ethics and health law. First, we question whether deepfake therapy can truly constitute good care. Important risks are dangerous situations or ‘triggers’ to the patient during data collection for the creation of (...) a deepfake, and when deepfake therapy is started, there are risks of overattachment and blurring of reality, which can complicate the grieving process or alter perceptions of perpetrators. Therapists must mitigate these risks, but more research is needed to evaluate deepfake therapy’s efficacy before it can be used at all. Second, we address the implications for the person depicted in the deepfake. We describe how privacy and portrait law apply and argue that the legitimate interests of those receiving therapy should outweigh the interests of the depicted, as long as the therapy is an effective and ‘last resort’ treatment option, overseen by a therapist and the deepfakes are handled carefully. We suggest specific preventative measures that can be taken to protect the depicted person’s privacy. Finally, we call for qualitative research with patients and therapists to explore dependencies and other unintended consequences. In conclusion, while deepfake therapy holds promise, the competing interests and ethicolegal complexities demand careful consideration and further investigation alongside the development and implementation of this technology. (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)

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)

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)

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.

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)

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

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.

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.

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)

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)

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 (ATL). The key insight (...) in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). 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 (ATEL) — 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)

Philipp Koralus' "Reason and Inquiry" presents a questioning or erotetic theory of reasoning. This review connects ideas from the book to the broader philosophical literature on inquiry and questions, as well as providing a simplified overview of the theory.

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)

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)

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)

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)

This volume is a collects papers originally presented at the 7th Conference on Logic and the Foundations of Game and Decision Theory (LOFT), held at the University of Liverpool in July 2006. LOFT is a key venue for presenting research at the intersection of logic, economics, and computer science, and this collection gives a lively and wide-ranging view of an exciting and rapidly growing area.

We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as “every coalition satisfying property P can achieve φ” and “there exists a coalition C satisfying property P such that C can achieve φ”. We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is (...) nevertheless exponentially more succinct. The complexity of QCL model checking for symbolic and explicit state representations is shown to be no worse than that of Coalition Logic, and satisfiability for QCL is shown to be no worse than satisfiability for Coalition Logic. We illustrate the formalism by showing how to succinctly specify such social choice mechanisms as majority voting, which in Coalition Logic require specifications that are exponentially long in the number of agents. (shrink)

This book explores aesthetic forms of the left to negotiate the political frontiers of post-colonial, post-partition South Asia. Spanning India, Sri Lanka, Pakistan and Bangladesh, the contributors study art, film and literature to illuminate interconnections across regions and countries, and discuss the shifting political contours of the region during the latter half of the 20th century. With a clear focus and conceptualization this volume raises two key questions; how left-wing art generated cultural and social formations, and how aesthetic forms held (...) political value across the region. Reframing political aesthetics within a postcolonial and decolonised framework, it traces the trajectories and nuances the left-wing cultural movement took during decolonization, and focuses on connections and continuities across post-1947 India, Pakistan and Bangladesh. Following the evolution of progressive culture in the 1950s and 60s, networks of leftist filmmakers and theatre activists in postcolonial Pakistan, and the changing fate of left cultural politics in Sri Lanka and India during the 1970s, this book looks to reinvigorate the entangled histories of the left cultural movement in post-partition South Asia. (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)