In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS . The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic TDS sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal frames, while preserving (...) validity. Last, we discuss problems that arise from employing binary utility functions in a temporal setting. (shrink)

The aim of this paper is to initiate a systematic exploration of the model theory of epistemic plausibility models (EPMs). There are two subtly different definitions in the literature: one by van Benthem and one by Baltag and Smets. Because van Benthem's notion is the most general, most of the paper is dedicated to this notion. We focus on the notion of bisimulation, and show that the most natural generalization of bisimulation to van Benthem-type EPMs fails. We then introduce parametrized (...) bisimulations, and prove various bisimulationimplies- equivalence theorems, a Hennessy-Milner theorem, and several (un)definability results. We discuss the problems arising from the fact that these bisimulations are syntax-dependent (and thus not fully structural), and we present and compare two different ways of coping with this issue: adding a modality to the language, and putting extra constraints on the models. We argue that the most successful solution involves restricting to uniform and locally connected (van Benthem-type) EPMs: for this subclass the intuitively most natural notion of bisimulation and the technically sound notion coincide. Such EPMs turn out to correspond exactly with Baltag/Smets-type EPMs, which can be interpreted as constituting a methodological argument, favoring Baltag and Smets's definition of EPM over that of van Benthem. (shrink)

Like modal logic, temporal logic, and description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoare triples. In this survey, we present similarities between separation logic as an assertion language and modal and temporal logics. Moreover, we (...) propose a selection of landmark results about decidability, complexity and expressive power. (shrink)

In a number of publications A.N. Prior considered the use of what he called ‘metric tense logic’. This is a tense logic in which the past and future operators P and F have an index representing a temporal distance, so that Pnα means that α was true n -much ago, and Fn α means that α will be true n -much hence. The paper investigates the use of metric predicate tense logic in formalising phenomena ormally treated by such devices as (...) multiple indexing or quantification over times. (shrink)

Supervaluationism is a well known theory of vagueness. Subvaluationism is a less well known theory of vagueness. But these theories cannot be taken apart, for they are in a relation of duality that can be made precise. This paper provides an introduction to the subvaluationist theory of vagueness in connection to its dual, supervaluationism. A survey on the supervaluationist theory can be found in the Compass paper of Keefe (2008); our presentation of the theory in this paper will be short (...) to get rapidly into the logical issues. This paper is relatively self-contained. A modest background on propositional modal logic is, though not strictly necessary, advisable. The reader might find useful the Compass papers Kracht (2011) and Negri (2011) (though these papers cover issues of more complexity than what is demanded to follow this paper). (shrink)

Paraconsistent approaches have received little attention in the literature on vagueness (at least compared to other proposals). The reason seems to be that many philosophers have found the idea that a contradiction might be true (or that a sentence and its negation might both be true) hard to swallow. Even advocates of paraconsistency on vagueness do not look very convinced when they consider this fact; since they seem to have spent more time arguing that paraconsistent theories are at least as (...) good as their paracomplete counterparts, than giving positive reasons to believe on a particular paraconsistent proposal. But it sometimes happens that the weakness of a theory turns out to be its mayor ally, and this is what (I claim) happens in a particular paraconsistent proposal known as subvaluationism. In order to make room for truth-value gluts subvaluationism needs to endorse a notion of logical consequence that is, in some sense, weaker than standard notions of consequence. But this weakness allows the subvaluationist theory to accommodate higher-order vagueness in a way that it is not available to other theories of vagueness (such as, for example, its paracomplete counterpart, supervaluationism). (shrink)

Basic hybrid logic extends modal logic with the possibility of naming worlds by means of a distinguished class of atoms (called nominals) and the so-called satisfaction operator, that allows one to state that a given formula holds at the world named a, for some nominal a. Hence, in particular, hybrid formulae include “equality” assertions, stating that two nominals are distinct names for the same world. The treatment of such nominal equalities in proof systems for hybrid logics may induce many redundancies. (...) This paper introduces an internalized tableau system for basic hybrid logic, significantly reducing such redundancies. The calculus enjoys a strong termination property: tableau construction terminates without relying on any specific rule application strategy, and no loop-checking is needed. The treatment of nominal equalities specific of the proposed calculus is briefly compared to other approaches. Its practical advantages are demonstrated by empirical results obtained by use of implemented systems. Finally, it is briefly shown how to extend the calculus to include the global and converse modalities. (shrink)

A number of significant contributions in the last four decades show that non-normal modal logics can be fruitfully employed in several applied fields. Well-known domains are epistemic logic, deontic logic, and systems capturing different aspects of action and agency such as the modal logic of agency, concurrent propositional dynamic logic, game logic, and coalition logic. Semantics for such logics are traditionally based on neighbourhood models. However, other model-theoretic semantics can be used for this purpose. Here, we systematically study multi-relational structures, (...) whose investigation is still relatively underdeveloped. After a brief introduction to two different versions of multi-relational semantics – which we call strong and weak multi-relational semantics – we proceed to study several modal schemata. Special attention is paid to the schemata CON and D. Finally we offer completeness proofs for several systems using both strong and weak semantic tools: The proofs thus cover both classical system.. (shrink)

This paper supersedes an ealier version, entitled "A Non-Standard Semantics for Inexact Knowledge with Introspection", which appeared in the Proceedings of "Rationality and Knowledge". The definition of token semantics, in particular, has been modified, both for the single- and the multi-agent case.

We introduce the concept of a connected logic (over S4) and show that each connected logic with the finite model property is the logic of a subalgebra of the closure algebra of all subsets of the real line R, thus generalizing the McKinsey-Tarski theorem. As a consequence, we obtain that each intermediate logic with the finite model property is the logic of a subalgebra of the Heyting algebra of all open subsets of R.

We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...) formal definition, and acknowledge limitations and borderline cases. Throughout we show how awareness of the two stances suggests new logical systems and new issues about translations between implicit and explicit systems, linking up with foundational concerns about identity of logical systems. But we also show how a practical facility with these complementary working styles has philosophical consequences, as it throws doubt on strong philosophical claims made by just taking one design stance and ignoring alternative ones. We will illustrate the latter benefit for the case of logical pluralism and hyper-intensional semantics. (shrink)

This paper presents a new modal logic for ceteris paribus preferences understood in the sense of "all other things being equal". This reading goes back to the seminal work of Von Wright in the early 1960's and has returned in computer science in the 1990' s and in more abstract "dependency logics" today. We show how it differs from ceteris paribus as "all other things being normal", which is used in contexts with preference defeaters. We provide a semantic analysis and (...) several completeness theorems. We show how our system links up with Von Wright's work, and how it applies to game-theoretic solution concepts, to agenda setting in investigation, and to preference change. We finally consider its relation with infinitary modal logics. (shrink)

We introduce a propositional many-valued modal logic which is an extension of the Continuous Propositional Logic to a modal system. Otherwise said, we extend the minimal modal logic to a Continuous Logic system. After introducing semantics, axioms and deduction rules, we establish some preliminary results. Then we prove the equivalence between consistency and satisfiability. As straightforward consequences, we get compactness, an approximated completeness theorem, in the vein of Continuous Logic, and a Pavelka-style completeness theorem.

The main aim of this paper is to present a way to improve the e.ciency of an intelligent alarm correlation module by means of an abductive reasoner. The alarm correlation module is integrated in a more complex system that performs monitoring and control tasks over a tract of a highway. On the basis of a specific theory on the domain, explanations of anomalous traffic patterns can be provided taking into account those situations not directly detected by data acquisition technology. The (...) integration of the comprehensive view obtained by means of a correlation phase with additional domain knowledge allows to abduce from the observed anomalous traffic patterns other significant situations. The experience of traffic operators allows to build a theory of abducible explanations that exploits the knowledge of the use context of the system. The correlation module of SAMOT has been modelled within a propositional modal language, named ST-Logic, which will be adopted for the abductive reasoner as well. Finally, some remarks about stratified interpretative cycles made possible within such a formal framework will be addressed. (shrink)

We investigate the process of truth-seeking by iterated belief revision with higher-level doxastic information . We elaborate further on the main results in Baltag and Smets (Proceedings of TARK, 2009a , Proceedings of WOLLIC’09 LNAI 5514, 2009b ), applying them to the issue of convergence to truth . We study the conditions under which the belief revision induced by a series of truthful iterated upgrades eventually stabilizes on true beliefs. We give two different conditions ensuring that beliefs converge to “full” (...) (complete) truth , as well as a condition ensuring only that they converge to true (but not necessarily complete) beliefs. (shrink)

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...) dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games. (shrink)

This paper defines a Sahlqvist fragment for relevant logic and establishes that each class of frames in the Routley-Meyer semantics which is definable by a Sahlqvist formula is also elementary, that is, it coincides with the class of structures satisfying a given first order property calculable by a Sahlqvist-van Benthem algorithm. Furthermore, we show that some classes of Routley-Meyer frames definable by a relevant formula are not elementary.

(2012). DEL-sequents for regression and epistemic planning. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 337-367. doi: 10.1080/11663081.2012.736703.

We introduce a bimodal epistemic logic intended to capture knowledge as truth in all epistemically alternative states and belief as a generalised ‘majority’ quantifier, interpreted as truth in most of the epistemically alternative states. This doxastic interpretation is of interest in knowledge-representation applications and it also holds an independent philosophical and technical appeal. The logic comprises an epistemic modal operator, a doxastic modal operator of consistent and complete belief and ‘bridge’ axioms which relate knowledge to belief. To capture the notion (...) of a ‘majority’ we use the ‘large sets’ introduced independently by K. Schlechta and V. Jauregui, augmented with a requirement of completeness, which furnishes a ‘weak ultrafilter’ concept. We provide semantics in the form of possible-worlds frames, properly blending relational semantics with a version of general Scott–Montague frames and we obtain soundness and completeness results. We examine the validity of certain epistemic principles discussed in the literature, in particular some of the ‘bridge’ axioms discussed by W. Lenzen and R. Stalnaker, as well as the ‘paradox of the perfect believer’, which is not a theorem of. (shrink)

(2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.

I propose a modal logic that enables to reason about self-regarding and otherregarding motivations in strategic games. This logic integrates the concepts of joint action, belief, individual and group payoff. The first part of the article is focused on self-regarding agents. A self-regarding agent decides to perform a certain action only if he believes that this action maximizes his own personal benefit. The second part of the article explores different kinds of other-regarding motivations such as fairness and reciprocity. Differently from (...) self-regarding agents, other-regarding agents also consider the benefits of their choices for the group. Moreover, their decisions can be affected by their beliefs about other agents' willingness to act for the well-being of the group. The analysis also considers team-directed reasoning, i.e. the mode of reasoning that people use when they take themselves to be acting as members of a group or a team. (shrink)

This volume seeks to further the use of formal methods in clarifying one of the central problems of philosophy: that of our free human agency and its place in our indeterministic world. It celebrates the important contributions made in this area by Nuel Belnap, American logician and philosopher. Philosophically, indeterminism and free action can seem far apart, but in Belnap’s work, they are intimately linked. This book explores their philosophical interconnectedness through a selection of original research papers that build forth (...) on Belnap’s logical and philosophical work. Some contributions take the form of critical discussions of Belnap's published work, some develop points made in his publications in new directions, and others provide additional insights on the topics of indeterminism and free action. In Nuel Belnap’s work on indeterminism and free action, three formal frameworks figure prominently: the simple branching histories framework known as "branching time;" its relativistic spatio-temporal extension, branching space-times; and the “seeing to it that” logic of agency. As those frameworks provide the formal background for the contributed papers, the volume introduction gives an overview of the current state of their development. It also introduces case-intensional first order logic, a general intensional logic offering resources for a first-order extension of the mentioned frameworks and a recent research focus of Belnap’s. The volume also contains an extended biographical interview with Nuel Belnap. (shrink)

It has been claimed that counterpart theory cannot support a theory of actuality without rendering obviously invalid formulas valid or obviously valid formulas invalid. We argue that these claims are not based on logical flaws of counterpart theory itself, but point to the lack of appropriate devices in first-order logic for “remembering” the values of variables. We formulate a mildly dynamic version of first-order logic with appropriate memory devices and show how to base a version of counterpart theory with actuality (...) on this. This theory is, in special cases, equivalent to modal first-order logic with actuality, and apparently does not suffer from the logical flaws that have been mentioned in the literature. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

Epistemic naturalism holds that the results or methodologies from the cognitive sciences are relevant to epistemology, and some have maintained that scientific methods are more compatible with externalist theories of justification than with internalist theories. But practically all discussions about naturalized epistemology are framed exclusively in terms of cognitive psychology, which is only one of the cognitive sciences. The question addressed in this essay is whether a commitment to naturalism really does favor externalism over internalism, and we offer reasons for (...) thinking that naturalism in epistemology is compatible with both internalist and externalist conceptions of justification. We also argue that there are some distinctively internalist aims that are currently being studied scientifically and these notions, and others, should be studied by scientific methods. (shrink)

One goal of normative multi-agent system theory is to formulate principles for normative system change that maintain the rule-like structure of norms and preserve links between norms and individual agent obligations. A central question raised by this problem is whether there is a framework for norm change that is at once specific enough to capture this rule-like behavior of norms, yet general enough to support a full battery of norm and obligation change operators. In this paper we propose an answer (...) to this question by developing a bimodal logic for norms and obligations called NO. A key to our approach is that norms are treated as propositional formulas, and we provide some independent reasons for adopting this stance. Then we define norm change operations for a wide class of modal systems, including the class of NO systems, by constructing a class of modal revision operators that satisfy all the AGM postulates for revision, and constructing a class of modal contraction operators that satisfy all the AGM postulates for contraction. More generally, our approach yields an easily extendable framework within which to work out principles for a theory of normative system change. (shrink)

We prove that modal logic formulated in a language with the cover modality is exponentially more succinct than the usual box-and-diamond version. In contrast with this, we show that adding the so-called public announcement operator to the latter results in a modal system that is exponentially more succinct than the one based on the cover modality.

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)

A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...) models which may occur inside modalities of the language. This paper systematically and rigorously relates the DEL framework with the ETL framework. The precise relationship between DEL and ETL is explored via a new representation theorem characterizing the largest class of ETL models corresponding to DEL protocols in terms of notions of Perfect Recall , No Miracles , and Bisimulation Invariance . We then focus on new issues of completeness . One contribution is an axiomatization for the dynamic logic of public announcements constrained by protocols, which has been an open problem for some years, as it does not fit the usual ‘reduction axiom’ format of DEL. Finally, we provide a number of examples that show how DEL suggests an interesting fine-structure inside ETL. (shrink)

In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic, called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate are characterized. This facilitates a formal (...) comparison with the only other formal protocol framework in dynamic epistemic logic, namely the extensional ‘DEL protocols’. The paper concludes with a conceptual comparison, highlighting modeling tasks where DEL dynamical systems are natural. (shrink)

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.

We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...) formal definition, and acknowledge limitations and borderline cases. Throughout we show how awareness of the two stances suggests new logical systems and new issues about translations between implicit and explicit systems, linking up with foundational concerns about identity of logical systems. But we also show how a practical facility with these complementary working styles has philosophical consequences, as it throws doubt on strong philosophical claims made by just taking one design stance and ignoring alternative ones. We will illustrate the latter benefit for the case of logical pluralism and hyper-intensional semantics. (shrink)

• We study a new composition operation on (epistemic) multiagent models and update actions that takes vocabulary extensions into account.

This paper provides several examples of how modal logic can be used in studying the XML document navigation language XPath. More specifically, we derive complete axiomatizations, computational complexity and expressive power results for XPath fragments from known results for corresponding logics. A secondary aim of the paper is to introduce XPath in a way that makes it accessible to an audience of modal logicians.

This paper is concerned with removing the identity schema from the axiomatic basis of deontic conditionals. This is in order to allow a stipulated ideal to be contrary or opposite in nature to the fact it is predicated upon. It is desirable, or so it is argued, to retain the order-theoretic orientation of preferential semantics towards the analysis of deontic conditionals, more specifically of maximality semantics in the tradition from Bengt Hansson. So understood, the problem involves abstracting away the settledness (...) assumption that is built in to maximality semantics. This is the assumption that what is optimal given ϕ is that which all the best ϕ-states have in common, notably ϕ itself. We propose a solution based on a strict and finite preference relation over which deontic conditionals are evaluated by letting ϕ-states evolve freely, as fate or fortune would have it, into different possibly ensuing optima that may but need not be ϕ-states themselves. The result is a deontic conditional that does not have identity. This new conditional is shown to be a proper generalization of the Hansson conditional. Hansson’s conditional can be recovered in the new idiom as a special case. Indeed, the new semantics is general enough to cover several apparently very different conceptions of deontic conditionality. For instance, the input/output logic known as basic output is a sublogic of the new system. This is somewhat surprising and suggests that there may yet be unity to be had in the field of deontic logic. (shrink)

In this investigation we explore a general strategy for constructing modal theories where the modal notion is conceived as a predicate. The idea of this strategy is to develop modal theories over axiomatic theories of truth. In this first paper of our two part investigation we develop the general strategy and then apply it to the axiomatic theory of truth Friedman-Sheard. We thereby obtain the theory Modal Friedman-Sheard. The theory Modal Friedman-Sheard is then discussed from three different perspectives. First, we (...) show that Modal Friedman-Sheard preserves theoremhood modulo translation with respect to modal operator logic. Second, we turn to semantic aspects and develop a modal semantics for the newly developed theory. Third, we investigate whether the modal predicate of Modal Friedman-Sheard can be understood along the lines of a proposal of Kripke, namely as a truth predicate modified by a modal operator. (shrink)

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...) this paper, I explore the limits of what a relevant connective is, showing how some basic criteria motivated by the ideology of relevant logicians provide robust limits on potential connectives. These criteria provide some plausible necessary conditions on being a relevant connective. (shrink)

In this paper we investigate Kripke models, used to model knowledge or belief in a static situation, and action models, used to model communicative actions that change this knowledge or belief. The appropriate notion for structural equivalence between modal structures such as Kripke models is bisimulation: Kripke models that are bisimilar are modally equivalent. We would like to find a structural relation that can play the same role for the action models that play a prominent role in information updating. Two (...) action models are equivalent if they yield the same results when updating Kripke models. More precisely, two action models are equivalent if it holds for all Kripke models that the result of updating with one action model is bisimilar to the result of updating with the other action model. We propose a new notion of action emulation that characterizes the structural equivalence of the important class of canonical action models. Since every action model has an equivalent canonical action model, this gives a method to decide the equivalence of any pair of action models. We also give a partial result that holds for the class of all action models. Our results extend the work in van Eijck et al. (Synthese 185(1):131–151, 2012). (shrink)

In this paper, we explore the relation between an agent’s doxastic attitude and her arguments in support of a given claim. Our main contribution is the design of a logical setting that allows us reason about binary arguments which are either in favour or against a certain claim. This is a setting in which arguments and propositions are the basic building blocks so that the concept of argument-based belief emerges in a straightforward way. We work against the background of Dung’s (...) abstract argumentation framework, extending it to a new setting in which we can study the formal properties of binary arguments as well as the larger structures they establish. This paper introduces a formal ‘two-dimensional’ language to talk about propositions and arguments, for which a sound and complete axiom system is provided. (shrink)

We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.

We study a logic for reasoning about agents that pass messages according to a protocol. Protocols are specified extensionally, as sets of sequences of ?legal? actions assigned to each state in a Kripke model. Message-passing events that are licensed by the protocol are modeled as updates in the style of dynamic epistemic logic. We also consider changes to the protocol by introducing message-encoding modalities, corresponding to communications actions that lead to protocol extensions. While in our general framework, messages are arbitrary (...) objects, we also consider the case that the messages that are passed are sentences of the object language itself. We present complete calculi for our logics and clarify the relationship of our proposal to earlier work on public announcement logic. (shrink)

In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...) systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans. Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics. (shrink)

The paper provides a preliminary study of algebraic semantics for modal and superintuitionistic non-monotonic logics. The main question answered is: how can non-monotonic inference be understood algebraically?

We describe a logic of preference in which modal connectives reflect reasons to desire that a sentence be true. Various conditions on models are introduced and analyzed.

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations. Finally, it is proved that a first-order formula is equivalent to a (...) standard translation of an intuitionistic propositional formula over the class of intuitionistic Kripke models iff it is invariant with respect to asimulations between intuitionistic models. (shrink)

The logic TK was introduced as a propositional logic extending the classical propositional calculus with a new unary operator which interprets some conceptions of Tarski’s consequence operator. TK-algebras were introduced as models to TK . Thus, by using algebraic tools, the adequacy (soundness and completeness) of TK relatively to the TK-algebras was proved. This work presents a neighbourhood semantics for TK , which turns out to be deductively equivalent to the non-normal modal logic EMT4 . DOI:10.5007/1808-1711.2011v15n2p287.

The metaphor of a branching tree of future possibilities has a number of important philosophical and logical uses. In this paper we trace this metaphor through some of its uses and argue that the metaphor works the same way in physics as in philosophy. We then give an overview of formal systems for branching possibilities, viz., branching time and (briefly) branching space-times. In a next step we describe a number of different notions of possibility, thereby sketching a landscape of possibilities. (...) In the final section of the paper we look at the place of branching-based possibilities in that larger landscape of possibilities. Our main message is that far from being an outlandish metaphysical extravagancy, branching-based possibilities are epistemically as well as metaphysically basic. (shrink)