Search

We compared two digital humanities methods in the analysis of a contested scientific term. “Epigenetics” is as enigmatic as it is popular. Some authors argue that its meaning has diluted over time as this term has come to describe a widening range of entities and mechanisms (Haig, International Journal of Epidemiology 41:13–16, 2012). Others propose both a Waddingtonian “broad sense” and a mechanistic “narrow sense” definition to capture its various scientific uses (Stotz and Griffiths, History and Philosophy of the Life Sciences 38:22, 2016). We evaluated these proposals by first replicating a recent analysis by (Linquist and Fullerton, Theoretical Medicine and Bioethics 42:137–154, 2021). We analyzed the 1100 most frequently cited abstracts on epigenetics across four disciplines: proximal biology, biomedicine, general biology, and evolution. Each abstract was coded for its heritability commitments (if any) and functional interpretation. A second study applied LDA topic modelling to the same corpus, thus providing a useful methodological comparison. The two methods converged on a discipline-relative ambiguity. Within such disciplines as biomedicine or molecular biology that focus on proximate mechanisms, “epigenetic(s)” refers to a range of molecular structures while specifying nothing in particular about their heritability. This proximal conception was primarily associated with the functions of gene regulation and disease. In contrast, a second relatively uncommon sense of “epigenetic(s)” is restricted to a small proportion of evolutionary abstracts. It refers to many of the same molecular structures, but regards them as trans-generationally inherited and associated with adaptive phenotypic plasticity. This finding underscores the benefit of digital tools in complementing traditional conceptual analysis. Philosophers should be cautious not to conflate the relatively uncommon evolutionary sense of epigenetics with the more widely used proximal conception. [ABSTRACT FROM AUTHOR]

The received view says that possibility is the dual of necessity: a proposition is (metaphysically, logically, epistemically etc.) possible iff it is not the case that its negation is (metaphysically, logically, epistemically etc., respectively) necessary. This reading is usually taken for granted by modal logicians and indeed seems plausible when dealing with logical or metaphysical possibility. But what about epistemic possibility? We argue that the dual definition of epistemic possibility in terms of epistemic necessity generates tension when reasoning about non-idealized agents and is a problem of concern for most hyperintensional epistemic logics that alleviate the problem of logical omniscience. The tension is particularly evident when knowledge is taken as a primitive to define other epistemic concepts, such as justification and belief, as done in the knowledge-first tradition. We propose a non-dual interpretation of epistemic possibility, employing a hyperintensionality filter similar to the one that makes the corresponding epistemic necessity operator hyperintensional. We employ the proposed semantics to model Stalnaker’s belief as epistemic possibility of knowledge and provide a sound and complete axiomatization for a hyperintensional version of his bimodal logic of knowledge and belief. [ABSTRACT FROM AUTHOR]

We propose a new topological semantics for evidence, evidence-based justifications, belief, and knowledge. Resting on the assumption that an agent’s rational belief is based on the available evidence, we try to unveil the concrete relationship between an agent’s evidence, belief, and knowledge via a rich formal framework afforded by topologically interpreted modal logics. We prove soundness, completeness, decidability, and the finite model property for the associated logics, and apply this setting to analyze key epistemological issues such as “no false lemma” Gettier examples, misleading defeaters, undefeated justification versus undefeated belief, as well as the defeasibility theories of knowledge. [ABSTRACT FROM AUTHOR]

Recent work in applied ethics has advanced a raft of arguments regarding individual responsibilities to address collective challenges like climate change or the welfare and environmental impacts of meat production. Frequently, such arguments suggest that individual actors have a responsibility to be more conscientious with their consumption decisions, that they can and should harness the power of the market to bring about a desired outcome. A common response to these arguments, and a challenge in particular to act-consequentialist reasoning, is that it “makes no difference” if one takes conscious consumption action or not – that one is “causally impotent” to change an outcome. In this paper, I break causal impotence objections into three distinct lines of argument and present causal indeterminacy as a third, unexplored variation of much more common causal impotence lines. I suggest that the causal indeterminacy argument presents additional challenges to consequentialist moral theory because it acknowledges that individual actions can have an impact on outcome, but suggests instead that the outcome can neither be known nor secured by the action itself. [ABSTRACT FROM AUTHOR]

We propose a new model for forming and revising beliefs about unknown probabilities. To go beyond what is known with certainty and represent the agent's beliefs about probability, we consider a plausibility map, associating to each possible distribution a plausibility ranking. Beliefs are defined as in Belief Revision Theory, in terms of truth in the most plausible worlds (or more generally, truth in all the worlds that are plausible enough). We consider two forms of conditioning or belief update, corresponding to the acquisition of two types of information: (1) learning observable evidence obtained by repeated sampling from the unknown distribution; and (2) learning higher-order information about the distribution. The first changes only the plausibility map (via a 'plausibilistic' version of Bayes' Rule), but leaves the given set of possible distributions essentially unchanged; the second rules out some distributions, thus shrinking the set of possibilities, without changing their plausibility ordering.. We look at stability of beliefs under either of these types of learning, defining two related notions (safe belief and statistical knowledge), as well as a measure of the verisimilitude of a given plausibility model. We prove a number of convergence results, showing how our agent's beliefs track the true probability after repeated sampling, and how she eventually gains in a sense (statistical) knowledge of that true probability. Finally, we sketch the contours of a dynamic doxastic logic for statistical learning. [ABSTRACT FROM AUTHOR]

This paper introduces a multi-agent dynamic epistemic logic for abstract argumentation. Its main motivation is to build a general framework for modelling the dynamics of a debate, which entails reasoning about goals, beliefs, as well as policies of communication and information update by the participants. After locating our proposal and introducing the relevant tools from abstract argumentation, we proceed to build a three-tiered logical approach. At the first level, we use the language of propositional logic to encode states of a multi-agent debate. This language allows to specify which arguments any agent is aware of, as well as their subjective justification status. We then extend our language and semantics to that of epistemic logic, in order to model individuals' beliefs about the state of the debate, which includes uncertainty about the information available to others. As a third step, we introduce a framework of dynamic epistemic logic and its semantics, which is essentially based on so-called event models with factual change. We provide completeness results for a number of systems and show how existing formalisms for argumentation dynamics and unquantified uncertainty can be reduced to their semantics. The resulting framework allows reasoning about subtle epistemic and argumentative updates—such as the effects of different levels of trust in a source—and more in general about the epistemic dimensions of strategic communication. [ABSTRACT FROM AUTHOR]

This paper aims to study the foundations of applied mathematics, using a formalized base theory for applied mathematics: ZFCA σ (Zermelo–Fraenkel set theory (with Choice) with atoms, where the subscript used refers to a signature specific to the application. Examples are given, illustrating the following five features of applied mathematics: comprehension principles, application conditionals, representation hypotheses, transfer principles and abstract equivalents. [ABSTRACT FROM AUTHOR]

The role of the body in cognition is acknowledged across a variety of disciplines, even if the precise nature and scope of that contribution remain contentious. As a result, most philosophers working on embodiment—e.g. those in embodied cognition, enactivism, and '4e' cognition—interact with the life sciences as part of their interdisciplinary agenda. Despite this, a detailed engagement with emerging findings in epigenetics and post-genomic biology has been missing from proponents of this embodied turn. Surveying this research provides an opportunity to rethink the relationship between embodiment and genetics, and we argue that the balance of current epigenetic research favours the extension of an enactivist approach to mind and life, rather than the extended functionalist view of embodied cognition associated with Andy Clark and Mike Wheeler, which is more substrate neutral. [ABSTRACT FROM AUTHOR]

Mereological principles are often controversial; perhaps the most stark contrast is between those who claim that Weak Supplementation is analytic—constitutive of our notion of proper parthood—and those who argue that the principle is simply false, and subject to many counterexamples. The aim of this paper is to diagnose the source of this dispute. I'll suggest that the dispute has arisen by participants failing to be sensitive to two different conceptions of proper parthood: the outstripping conception and the non-identity conception. I'll argue that the outstripping conception (together with a specific set of definitions for other mereological notions), can deliver the analyticity of Weak Supplementation on at least one sense of 'analyticity'. I'll also suggest that the non-identity conception cannot do so independently of considerations to do with mereological extensionality. [ABSTRACT FROM AUTHOR]

We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and completeness results for these systems. [ABSTRACT FROM AUTHOR]

A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula (that is false and) that becomes true when announced. We investigate true lies and other types of interaction between announced formulas, their preconditions and their postconditions, in the setting of Gerbrandy’s logic of believed announcements, wherein agents may have or obtain incorrect beliefs. Our results are on the satisfiability and validity of instantiations of these semantically defined categories, on iterated announcements, including arbitrarily often iterated announcements, and on syntactic characterization. We close with results for iterated announcements in the logic of knowledge (instead of belief), and for lying as private announcements (instead of public announcements) to different agents. Detailed examples illustrate our lying concepts. [ABSTRACT FROM AUTHOR]

Despite numerous and increasing attempts to define what life is, there is no consensus on necessary and sufficient conditions for life. Accordingly, some scholars have questioned the value of definitions of life and encouraged scientists and philosophers alike to discard the project. As an alternative to this pessimistic conclusion, we argue that critically rethinking the nature and uses of definitions can provide new insights into the epistemic roles of definitions of life for different research practices. This paper examines the possible contributions of definitions of life in scientific domains where such definitions are used most (e.g., Synthetic Biology, Origins of Life, Alife, and Astrobiology). Rather than as classificatory tools for demarcation of natural kinds, we highlight the pragmatic utility of what we call operational definitions that serve as theoretical and epistemic tools in scientific practice. In particular, we examine contexts where definitions integrate criteria for life into theoretical models that involve or enable observable operations. We show how these definitions of life play important roles in influencing research agendas and evaluating results, and we argue that to discard the project of defining life is neither sufficiently motivated, nor possible without dismissing important theoretical and practical research. [ABSTRACT FROM AUTHOR]

I examine a major objection to the mechanistic view of concrete computation, stemming from an apparent tension between the abstract nature of computational explanation and the tenets of the mechanistic framework: while computational explanation is medium-independent, the mechanistic framework insists on the importance of providing some degree of structural detail about the systems target of the explanation. I show that a common reply to the objection, i.e. that mechanistic explanation of computational systems involves only weak structural constraints, is not enough to save the standard mechanistic view of computation—it trivialises the appeal to mechanism, and thus makes the account collapse into a purely functional view. I claim, however, that the objection can be put to rest once the account is appropriately amended: computational individuation is indeed functional, while mechanistic explanation plays a role in accounting for computational implementation. Since individuation and implementation are crucial elements in a satisfying account of computation in physical systems, mechanism keeps its central importance in the theory of concrete computation. Finally, I argue that my version of the mechanistic view helps to provide a convincing reply to a powerful objection against non-semantic theories of concrete computation: the argument from the multiplicity of computations. [ABSTRACT FROM AUTHOR]

The Brandenburger-Keisler paradox is a self-referential paradox in epistemic game theory which can be viewed as a two-person version of Russell's Paradox. Yablo's Paradox, according to its author, is a non-self referential paradox, which created a significant impact. This paper gives a Yabloesque, non-self-referential paradox for infinitary players within the context of epistemic game theory. The new paradox advances both the Brandenburger-Keisler and Yablo results. Additionally, the paper constructs a paraconsistent model satisfying the paradoxical statement. [ABSTRACT FROM AUTHOR]

We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known 'action models' from Dynamic Epistemic Logic (DEL). Our 'temporal action models' may be used to define a number of informational actions that can modify the 'objective' temporal structure of a model along with the agents' basic and higher-order knowledge and beliefs about this structure, including their beliefs about the time. In essence, this approach provides one way to extend the domain of action model-style operations from atemporal Kripke models to temporal Kripke models in a manner that allows actions to control the flow of time. We present a number of examples to illustrate the subtleties involved in interpreting the effects of our extended action models on temporal Kripke models. We also study preservation of important epistemic-temporal properties of temporal Kripke models under temporal action model-induced operations, provide complete axiomatizations for two theories of temporal action models, and connect our approach with previous work on time in DEL. [ABSTRACT FROM AUTHOR]

The paper develops an interface between syntax-based logical models of awareness and dynamic epistemic logic. The framework is shown to be able to accommodate a variety of notions of awareness and knowledge, as well as their dynamics. This, it is argued, offers a natural formal environment for the analysis of epistemic phenomena typical of multi-agent information exchange, such as how agents become aware of relevant details, how they perform inferences and how they share their information within a group. Technically, the logics presented are all simple refinements of the logic of public announcements. [ABSTRACT FROM AUTHOR]

Information exchange can be seen as a dynamic process of raising and resolving issues. The goal of this paper is to provide a logical framework to model and reason about this process. We develop an inquisitive dynamic epistemic logic ( IDEL), which enriches the standard framework of dynamic epistemic logic ( DEL), incorporating insights from recent work on inquisitive semantics. At a static level, IDEL does not only allow us to model the information available to a set of agents, like standard epistemic logic, but also the issues that the agents entertain. At a dynamic level, IDEL does not only allow us to model the effects of communicative actions that provide new information, like standard DEL, but also the effects of actions that raise new issues. Thus, IDEL provides the fundamental tools needed to analyze information exchange as a dynamic process of raising and resolving issues. [ABSTRACT FROM AUTHOR]

The article studies knowledge in multiagent systems where data available to the agents may have small errors. To reason about such uncertain knowledge, a formal semantics is introduced in which indistinguishability relations, commonly used in the semantics for epistemic logic S5, are replaced with metrics to capture how much two epistemic worlds are different from an agent's point of view. The main result is a logical system sound and complete with respect to the proposed semantics. [ABSTRACT FROM AUTHOR]

In this paper we explore the relationship between norms of belief revision that may be adopted by members of a community and the resulting dynamic properties of the distribution of beliefs across that community. We show that at a qualitative level many aspects of social belief change can be obtained from a very simple model, which we call 'threshold influence'. In particular, we focus on the question of what makes the beliefs of a community stable under various dynamical situations. We also consider refinements and alternatives to the 'threshold' model, the most significant of which is to consider changes to plausibility judgements rather than mere beliefs. We show first that some such change is mandated by difficult problems with belief-based dynamics related to the need to decide on an order in which different beliefs are considered. Secondly, we show that the resulting plausibility-based account results in a deterministic dynamical system that is non-deterministic at the level of beliefs. [ABSTRACT FROM AUTHOR]

A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdlallows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation networks, propositional satisfiability, and the existence of kernels of directed graphs. Directed graphs provide the basis for the semantics of pdl and the paper concludes by an overview of relevant graph-theoretical results and their applications in diagnosing paradoxical character of natural discourses. [ABSTRACT FROM AUTHOR]

We propose a dynamic logic of lying, wherein a 'lie that $$\varphi $$' (where $$\varphi $$ is a formula in the logic) is an action in the sense of dynamic modal logic, that is interpreted as a state transformer relative to the formula $$\varphi $$. The states that are being transformed are pointed Kripke models encoding the uncertainty of agents about their beliefs. Lies can be about factual propositions but also about modal formulas, such as the beliefs of other agents or the belief consequences of the lies of other agents. We distinguish two speaker perspectives: ( Obs) an outside observer who is lying to an agent that is modelled in the system, and ( Ag) an agent who is lying to another agent, and where both are modelled in the system. We distinguish three addressee perspectives: ( Cred) the credulous agent who believes everything that it is told (even at the price of inconsistency), ( Skep) the skeptical agent who only believes what it is told if that is consistent with its current beliefs, and ( Rev) the belief revising agent who believes everything that it is told by consistently revising its current, possibly conflicting, beliefs. The logics have complete axiomatizations, which can most elegantly be shown by way of their embedding in what is known as action model logic or in the extension of that logic to belief revision. [ABSTRACT FROM AUTHOR]

We analyse the computational complexity of comparing informational structures. Intuitively, we study the complexity of deciding queries such as the following: Is Alice's epistemic information strictly coarser than Bob's? Do Alice and Bob have the same knowledge about each other's knowledge? Is it possible to manipulate Alice in a way that she will have the same beliefs as Bob? The results show that these problems lie on both sides of the border between tractability (P) and intractability (NP-hard). In particular, we investigate the impact of assuming information structures to be partition-based (rather than arbitrary relational structures) on the complexity of various problems. We focus on the tractability of concrete epistemic tasks and not on epistemic logics describing them. [ABSTRACT FROM AUTHOR]

While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( $$\mathcal{PAL }$$) with distributed knowledge, in particular their expressivity, axiomatisations and complexity. $$\mathcal{PAL }$$ extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on $$\mathcal{PACD }$$, the result of adding both common and distributed knowledge to $$\mathcal{PAL }$$, which is more expressive than each of its component logics. We introduce an axiomatisation of $$\mathcal{PACD }$$, which is not surprising: it is the combination of well-known axioms. The completeness proof, however, is not trivial, and requires novel combinations and extensions of techniques for dealing with $$S5$$ knowledge, distributed knowledge, common knowledge and public announcements at the same time. We furthermore show that $$\mathcal{PACD }$$ is decidable, more precisely that it is $$\textsc {exptime}$$-complete. This result also carries over to $$\mathcal{S 5\mathcal CD }$$ with common and distributed knowledge operators for all coalitions (and not only the grand coalition). Finally, we propose a notion of a trans-bisimulation to generalise certain results and give deeper insight into the proofs. [ABSTRACT FROM AUTHOR]

In the literature, different axiomatizations of Public Announcement Logic ( PAL) have been proposed. Most of these axiomatizations share a 'core set' of the so-called 'reduction axioms'. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules. In fact, many of the intuitive axioms and rules we took for granted could not be derived from the core set. Moreover, we also propose and advocate an alternative yet meaningful axiomatization of PAL without the reduction axioms. The completeness is proved directly by a detour method using the canonical model where announcements are treated as merely labels for modalities as in normal modal logics. This new axiomatization and its completeness proof may sharpen our understanding of PAL and can be adapted to other dynamic epistemic logics. [ABSTRACT FROM AUTHOR]

According to Cantor (Mathematische Annalen 21:545-586, ; Cantor's letter to Dedekind, ) a set is any multitude which can be thought of as one ('jedes Viele, welches sich als Eines denken läßt') without contradiction-a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root-lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $${\forall x \, x = x}$$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29-53, ) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued $${\in}$$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory-the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse-Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse-Kelley set theory. [ABSTRACT FROM AUTHOR]

K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning. Instead of modeling the information flow between different agents in a communicative or announcement setting, we model the information flow between different states of a single agent as that agent reasons deductively. The resource management of the database of agent states for the deductive reasoning fragment in question is covered by the residuated structure that encodes the nonassociative Lambek Calculus with permutation, bottom, and identity: NLP. [ABSTRACT FROM AUTHOR]

This paper presents a logic combining Dynamic Epistemic Logic, a framework for reasoning about multi-agent communication, with a new multi-agent version of Justification Logic, a framework for reasoning about evidence and justification. This novel combination incorporates a new kind of multi-agent evidence elimination that cleanly meshes with the multi-agent communications from Dynamic Epistemic Logic, resulting in a system for reasoning about multi-agent communication and evidence elimination for groups of interacting rational agents. [ABSTRACT FROM AUTHOR]

The effects of public announcements, private communications, deceptive messages to groups, and so on, can all be captured by a general mechanism of updating multi-agent models with update action models, now in widespread use. There is a natural extension of the definition of a bisimulation to action models. Surely enough, updating with bisimilar action models gives the same result (modulo bisimulation). But the converse turns out to be false: update models may have the same update effects without being bisimilar. We propose action emulation as a notion of equivalence more appropriate for action models, and generalizing standard bisimulation. It is proved that action emulation provides a full characterization of update effect. We first concentrate on the general case, and next focus on the important case of action models with propositional preconditions. Our notion of action emulation yields a simplification procedure for action models, and it gives designers of multi-agent systems a useful tool for comparing different ways of representing a particular communicative action. [ABSTRACT FROM AUTHOR]

Our aim in the present paper is to approach the nature of life from the perspective of autonomy, showing that this perspective can be helpful for overcoming the traditional Cartesian gap between the physical and cognitive domains. We first argue that, although the phenomenon of life manifests itself as highly complex and multidimensional, requiring various levels of description, individual organisms constitute the core of this multifarious phenomenology. Thereafter, our discussion focuses on the nature of the organization of individual living entities, proposing autonomy as the main concept to grasp it. In the second part of the article we show how autonomy is also fundamental to explaining major evolutionary transitions, in an attempt to rethink evolution from the point of view of the organizational structure of the entities/organisms involved. This gives further support to the idea of autonomy not only as a key to understanding life in general but also the complex expressions of it that we observe on our planet. Finally, we suggest a possible general principle that underlies those evolutionary transitions, which allow for the open-ended redefinition of autonomous systems: namely, the relative dynamic decoupling that must be articulated among distinct parts, modules or modes of operation in these systems. [ABSTRACT FROM AUTHOR]

It is almost universally acknowledged that first-order logic (FOL), with its clean, well-understood syntax and semantics, allows for the clear expression of philosophical arguments and ideas. Indeed, an argument or philosophical theory rendered in FOL is perhaps the cleanest example there is of 'representing philosophy'. A number of prominent syntactic and semantic properties of FOL reflect metaphysical presuppositions that stem from its Fregean origins, particularly the idea of an inviolable divide between concept and object. These presuppositions, taken at face value, reflect a significant metaphysical viewpoint, one that can in fact hinder or prejudice the representation of philosophical ideas and arguments. Philosophers have of course noticed this and have, accordingly, sought to alter or extend traditional FOL in novel ways to reflect a more flexible and egalitarian metaphysical standpoint. The purpose of this paper, however, is to document and discuss how similar 'adaptations' to FOL-culminating in a standardized framework known as Common Logic-have evolved out of the more practical and applied encounter of FOL with the problem of representing, sharing, and reasoning upon information on World Wide Web. [ABSTRACT FROM AUTHOR]

Logic is breaking out of the confines of the single-agent static paradigm that has been implicit in all formal systems until recent times. We sketch some recent developments that take logic as an account of information-driven interaction. These two features, the dynamic and the social, throw fresh light on many issues within logic and its connections with other areas, such as epistemology and game theory. [ABSTRACT FROM AUTHOR]

Dynamic epistemic logic describes the possible information-changing actions available to individual agents, and their knowledge pre- and post conditions. For example, public announcement logic describes actions in the form of public, truthful announcements. However, little research so far has considered describing and analysing rational choice between such actions, i.e., predicting what rational self-interested agents actually will or should do. Since the outcome of information exchange ultimately depends on the actions chosen by all the agents in the system, and assuming that agents have preferences over such outcomes, this is a game theoretic scenario. This is, in our opinion, an interesting general research direction, combining logic and game theory in the study of rational information exchange. In this article we take some first steps in this direction: we consider the case where available actions are public announcements, and where each agent has a (typically epistemic) goal formula that she would like to become true. What will each agent announce? The truth of the goal formula also depends on the announcements made by other agents. We analyse such public announcement games. [ABSTRACT FROM AUTHOR]

Classical epistemic logic describes implicit knowledge of agents about facts and knowledge of other agents based on semantic information. The latter is produced by acts of observation or communication that are described well by dynamic epistemic logics. What these logics do not describe, however, is how significant information is also produced by acts of inference-and key axioms of the system merely postulate 'deductive closure'. In this paper, we take the view that all information is produced by acts, and hence we also need a dynamic logic of inference steps showing what effort on the part of the agent makes a conclusion explicit knowledge. Strong omniscience properties of agents should be seen not as static idealizations, but as the result of dynamic processes that agents engage in. This raises two questions: (a) how to define suitable information states of agents and matching notions of explicit knowledge, (b) how to define natural processes over these states that generate new explicit knowledge. To this end, we use a static base from the existing awareness literature, extending it into a dynamic system that includes traditional acts of observation, but also adding and dropping formulas from the current 'awareness' set. We give a completeness theorem, and we show how this dynamics updates explicit knowledge. Then we extend our approach to multi-agent scenarios where awareness changes may happen privately. Finally, we mention further directions and related approaches. Our contribution can be seen as a 'dynamification' of existing awareness logics. [ABSTRACT FROM AUTHOR]

Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorporate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches. Also, we study to which degree the use of epistemics is essential for the analysis of security protocols. We look for formal conditions under which knowledge modalities can bring extra expressive power to pure temporal languages. On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity. [ABSTRACT FROM AUTHOR]

recurring issue in any formal model representing agents' (changing) informational attitudes is how to account for the fact that the agents are limited in their access to the available inference steps, possible observations and available messages. This may be because the agents are not logically omniscient and so do not have unlimited reasoning ability. But it can also be because the agents are following a predefined protocol that explicitly limits statements available for observation and/or communication. Within the broad literature on epistemic logic, there are a variety of accounts that make precise a notion of an agent's 'limited access' (for example, Awareness Logics, Justification Logics, and Inference Logics). This paper interprets the agents' access set of formulas as a constraint on the agents' information gathering process limiting which formulas can be observed. [ABSTRACT FROM AUTHOR]

Computer software is written in languages like C, Java or Haskell. In many cases social software is expressed in natural language. The paper explores connections between the areas of natural language analysis and analysis of social protocols, and proposes an extended program for natural language semantics, where the goals of natural language communication are derived from the demands of specific social protocols. [ABSTRACT FROM AUTHOR]

The discussion presents a framework of concepts that is intended to account for the rationality of semantic change and variation, suggesting that each scientific concept consists of three components of content: (1) reference, (2) inferential role, and (3) the epistemic goal pursued with the concept's use. I argue that in the course of history a concept can change in any of these components, and that change in the concept's inferential role and reference can be accounted for as being rational relative to the third component, the concept's epistemic goal. This framework is illustrated and defended by application to the history of the gene concept. It is explained how the molecular gene concept grew rationally out of the classical gene concept despite a change in reference, and why the use and reference of the contemporary molecular gene concept may legitimately vary from context to context. [ABSTRACT FROM AUTHOR]

Preference is a key area where analytic philosophy meets philosophical logic. I start with two related issues: reasons for preference, and changes in preference, first mentioned in von Wright’s book The Logic of Preference but not thoroughly explored there. I show how these two issues can be handled together in one dynamic logical framework, working with structured two-level models, and I investigate the resulting dynamics of reason-based preference in some detail. Next, I study the foundational issue of entanglement between preference and beliefs, and relate the resulting richer logics to belief revision theory and decision theory. [ABSTRACT FROM AUTHOR]

There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of belief ascription in a resource-bounded setting. We show that for agents whose computational resources and memory are bounded, correct ascription of beliefs cannot be guaranteed, even in the limit. We propose a solution to the problem of correct belief ascription for feasible agents which involves ascribing reasoning strategies, or preferences on formulas, to other agents, and show that if a resource-bounded agent knows the reasoning strategy of another agent, then its ascription of beliefs to the other agent is correct in the limit. [ABSTRACT FROM AUTHOR]

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form $${\rm A}_{G:x} \varphi$$ reading ‘if the agents in the set of agents G identify themselves with institution x then they together accept that $${\varphi}$$ ’. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form $${x!\psi}$$, meaning that the agents learn that $${\psi}$$ is the case in context x. Formulae of the form $${[x!\psi]\varphi}$$ mean that $${\varphi}$$ is the case after every possible occurrence of the event x! ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all $${\lnot\psi}$$ -worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form $${G:x\uparrow\psi}$$. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called ‘doctrinal paradox’ or ‘discursive dilemma’ (Pettit, Philosophical Issues 11:268–299, 2001; Kornhauser and Sager, Yale Law Journal 96:82–117, 1986). [ABSTRACT FROM AUTHOR]

This paper discusses the possibility of modelling inductive inference (Gold 1967) in dynamic epistemic logic (see e.g. van Ditmarsch et al. 2007). The general purpose is to propose a semantic basis for designing a modal logic for learning in the limit. First, we analyze a variety of epistemological notions involved in identification in the limit and match it with traditional epistemic and doxastic logic approaches. Then, we provide a comparison of learning by erasing (Lange et al. 1996) and iterated epistemic update (Baltag and Moss 2004) as analyzed in dynamic epistemic logic. We show that finite identification can be modelled in dynamic epistemic logic, and that the elimination process of learning by erasing can be seen as iterated belief-revision modelled in dynamic doxastic logic. Finally, we propose viewing hypothesis spaces as temporal frames and discuss possible advantages of that perspective. [ABSTRACT FROM AUTHOR]

We model the forgetting of propositional variables in a modal logical context where agents become ignorant and are aware of each others’ or their own resulting ignorance. The resulting logic is sound and complete. It can be compared to variable-forgetting as abstraction from information, wherein agents become unaware of certain variables: by employing elementary results for bisimulation, it follows that beliefs not involving the forgotten atom(s) remain true. [ABSTRACT FROM AUTHOR]

van Bentham et al. (Merging frameworks for interaction: DEL and ETL, 2007) provides a framework for generating the models of Epistemic Temporal Logic ( ETL: Fagin et al., Reasoning about knowledge, 1995; Parikh and Ramanujam, Journal of Logic, Language, and Information, 2003) from the models of Dynamic Epistemic Logic ( DEL: Baltag et al., in: Gilboa (ed.) Tark 1998, 1998; Gerbrandy, Bisimulations on Planet Kripke, 1999). We consider the logic TDEL on the merged semantic framework, and its extension with the labeled past-operator “ Pϵ” (“The event ϵ has happened before which. . .”). To axiomatize the extension, we introduce a method for transforming a given model into a normal form in a suitable sense. These logics suggest further applications of DEL in the theory of agency, the theory of learning, etc. [ABSTRACT FROM AUTHOR]

We look at two fundamental logical processes, often intertwined in planning and problem solving: inference and update. Inference is an internal process with which we uncover what is implicit in the information we already have. Update, on the other hand, is produced by external communication, usually in the form of announcements and in general in the form of observations, giving us information that might not have been available (even implicitly) before. Both processes have received attention from the logic community, usually separately. In this work, we develop a logical language that allows us to describe them together. We present syntax, semantics and a complete axiom system; we discuss similarities and differences with other approaches and mention how the work can be extended. [ABSTRACT FROM AUTHOR]

We formalise a notion of dynamic rationality in terms of a logic of conditional beliefs on (doxastic) plausibility models. Similarly to other epistemic statements (e.g. negations of Moore sentences and of Muddy Children announcements), dynamic rationality changes its meaning after every act of learning, and it may become true after players learn it is false. Applying this to extensive games, we “simulate” the play of a game as a succession of dynamic updates of the original plausibility model: the epistemic situation when a given node is reached can be thought of as the result of a joint act of learning (via public announcements) that the node is reached. We then use the notion of “stable belief”, i.e. belief that is preserved during the play of the game, in order to give an epistemic condition for backward induction: rationality and common knowledge of stable belief in rationality. This condition is weaker than Aumann’s and compatible with the implicit assumptions (the “epistemic openness of the future”) underlying Stalnaker’s criticism of Aumann’s proof. The “dynamic” nature of our concept of rationality explains why our condition avoids the apparent circularity of the “backward induction paradox”: it is consistent to (continue to) believe in a player’s rationality after updating with his irrationality. [ABSTRACT FROM AUTHOR]

This paper aims to extend in two directions the probabilistic dynamic epistemic logic provided in Kooi’s paper (J Logic Lang Inform 12(4):381–408, 2003) and to relate these extensions to ones made in van Benthem et al. (Proceedings of LOFT’06. Liverpool, 2006). Kooi’s probabilistic dynamic epistemic logic adds to probabilistic epistemic logic sentences that express consequences of public announcements. The paper (van Benthem et al., Proceedings of LOFT’06. Liverpool, 2006) extends (Kooi, J Logic Lang Inform 12(4):381–408, 2003) to using action models, but in both papers, the probabilities are discrete, and are defined on trivial σ-algebras over finite sample spaces. The first extension offered in this paper is to add a previous-time operator to a probabilistic dynamic epistemic logic similar to Kooi’s in (J Logic Lang Inform 12(4):381–408, 2003). The other is to involve non-trivial σ-algebras and continuous probabilities in probabilistic dynamic epistemic logic. [ABSTRACT FROM AUTHOR]

Various conceptual approaches to the notion of information can currently be traced in the literature in logic and formal epistemology. A main issue of disagreement is the attribution of truthfulness to informational data, the so called Veridicality Thesis (Floridi 2005). The notion of Epistemic Constructive Information (Primiero 2007) is one of those rejecting VT. The present paper develops a formal framework for ECI. It extends on the basic approach of Artemov’s logic of proofs (Artemov 1994), representing an epistemic logic based on dependent justifications, where the definition of information relies on a strict distinction from factual truth. The definition obtained by comparison with a Normal Modal Logic translates a constructive logic for “becoming informed”: its distinction from the logic of “being informed”—which internalizes truthfulness—is essential to a general evaluation of information with respect to truth. The formal disentanglement of these two logics, and the description of the modal version of the former as a weaker embedding into the latter, allows for a proper understanding of the Veridicality Thesis with respect to epistemic states defined in terms of information. [ABSTRACT FROM AUTHOR]

What is the minimal algebraic structure to reason about information flow? Do we really need the full power of Boolean algebras with co-closure and de Morgan dual operators? How much can we weaken and still be able to reason about multi-agent scenarios in a tidy compositional way? This paper provides some answers. [ABSTRACT FROM AUTHOR]

Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of ‘factual’ versus ‘procedural’ information, or ‘statics’ versus ‘dynamics’. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its ‘cousin’ epistemic logic? We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as well as more general issues that emerge. [ABSTRACT FROM AUTHOR]

In this paper, illocutionary acts of commanding will be differentiated from perlocutionary acts that affect preferences of addressees in a new dynamic logic which combines the preference upgrade introduced in DEUL (dynamic epistemic upgrade logic) by van Benthem and Liu with the deontic update introduced in ECL II (eliminative command logic II) by Yamada. The resulting logic will incorporate J. L. Austin’s distinction between illocutionary acts as acts having mere conventional effects and perlocutionary acts as acts having real effects upon attitudes and actions of agents, and help us understand why saying so can make it so in explicit performative utterances. We will also discuss how acts of commanding give rise to so-called “deontic dilemmas” and how we can accommodate most deontic dilemmas without triggering so-called “deontic explosion”. [ABSTRACT FROM AUTHOR]