Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...

Conditional structures lie at the heart of the sciences, humanities, and everyday reasoning. It is hence not surprising that conditional logics – logics specifically designed to account for natural language conditionals – are an active and interdisciplinary area. The present book gives a formal and a philosophical account of indicative and counterfactual conditionals in terms of Chellas-Segerberg semantics. For that purpose a range of topics are discussed such as Bennett’s arguments against truth value based semantics for indicative conditionals.

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

The aim of this paper is to make a critical assessment of Krister Segerberg''s theory of action. The first part gives a critical presentation of the key concepts in Segerberg''s informal theory of action. These are the ideas that motivate the formal models he develops. In the second part it is argued that if one takes all of Segerberg''s motivating ideas seriously, problems are forthcoming. The main problem is that on this theory the agents seem to be (...) bound to realize all of their intentions, a problem that stems from Segerberg''s attempt to individuate actions in terms of the agent''s intentions. On the ground that this unfortunate result is forthcoming in both of Segerberg''s approaches to the logic of action it is concluded that the conceptual basis of the theory is problematic. (shrink)

Deontic logic is devoted to the study of logical properties of normative predicates such as permission, obligation and prohibition. Since it is usual to apply these predicates to actions, many deontic logicians have proposed formalisms where actions and action combinators are present. Some standard action combinators are action conjunction, choice between actions and not doing a given action. These combinators resemble boolean operators, and therefore the theory of boolean algebra offers a well-known athematical framework to study the properties of the (...) classic deontic operators when applied to actions. In his seminal work, Segerberg uses constructions coming from boolean algebras to formalize the usual deontic notions. Segerberg’s work provided the initial step to understand logical properties of deontic operators when they are applied to actions. In the last years, other authors have proposed related logics. In this chapter we introduce Segerberg’s work, study related formalisms and investigate further challenges in this area. (shrink)

In this paper we distinguish between various kinds of doxastic theories. One distinction is between informal and formal doxastic theories. AGM-type theories of belief change are of the former kind, while Hintikka’s logic of knowledge and belief is of the latter. Then we distinguish between static theories that study the unchanging beliefs of a certain agent and dynamic theories that investigate not only the constraints that can reasonably be imposed on the doxastic states of a rational agent but also rationality (...) constraints on the changes of doxastic state that may occur in such agents. An additional distinction is that between non-introspective theories and introspective ones. Non-introspective theories investigate agents that have opinions about the external world but no higher-order opinions about their own doxasticnstates. Standard AGM-type theories as well as the currently existing versions of Segerberg’s dynamic doxastic logic (DDL) are non-introspective. Hintikka-style doxastic logic is of course introspective but it is a static theory. Thus, the challenge remains to devise doxastic theories that are both dynamic and introspective. We outline the semantics for truly introspective dynamic doxastic logic, i.e., a dynamic doxastic logic that allows us to describe agents who have both the ability to form higher-order beliefs and to reflect upon and change their minds about their own (higher-order) beliefs. This extension of DDL demands that we give up the Preservation condition on revision. We make some suggestions as to how such a non-preservative revision operation can be constructed. We also consider extending DDL with conditionals satisfying the Ramsey test and show that Gärdenfors’ well-known impossibility result applies to such a framework. Also in this case, Preservation has to be given up. (shrink)

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional (...) dynamic logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject. (shrink)

The paper tackles two problems. The first one is to grasp the real meaning of Jerzy Kalinowski’s theory of normative sentences. His formal system K 1 is a simple logic formulated in a very limited language . While presenting it Kalinowski formulated a few interesting philosophical remarks on norms and actions. He did not, however, possess the tools to formalise them fully. We propose a formulation of Kalinowski’s ideas with the use of a set-theoretical frame similar to the one presented (...) by Krister Segerberg in his A Deontic Logic of Action. At the same time we enrich the language used by Kalinowski with more operators on actions and present an adequate axiomatisation of the resulting system. That allows us to disclose some unrevealed aspects of Kalinowski’s theory. The most important one is a relation between acts which we call moral indiscernibility. Our second problem is a proper understanding of moral indiscernibility. We show how a repertoire of agent’s actions, defined with the use of simple observable elements of actions, can be filtrated by the relation of moral indiscernibility. That allows us to understand the consequences of Kalinowski’s claim that not doing something good is always bad. (shrink)

Krister Segerberg proposed irrevocable belief revision, to be contrasted with standard belief revision, in a setting wherein belief of propositional formulas is modelled explicitly. This suggests that in standard belief revision is revocable: one should be able to unmake (‘revoke’) the fresh belief in the revision formula, given yet further information that contradicts it. In a dynamic epistemic logical setting for belief revision, for multiple agents, we investigate what the requirements are for revocable belief revision. By this we not (...) merely mean recovering belief in non-modal propositions, as in the recovery principle for belief contraction, but recovering belief in modal propositions: beliefs about beliefs. These requirements are almost never met, a surprising result. (shrink)

Francesco Berto proposed a logic for imaginative episodes. The logic establishes certain (in)validities concerning episodic imagination. They are not all equally plausible as principles of episodic imagination. The logic also does not model that the initial input of an imaginative episode is deliberately chosen.Stit-imagination logic models the imagining agent’s deliberate choice of the content of their imagining. However, the logic does not model the episodic nature of imagination. The present paper combines the two logics, thereby modelling imaginative episodes with deliberately (...) chosen initial input. We use a combination ofstit-imagination logic and a content-sensitive variably strict conditional à la Berto, for which we give a Chellas–Segerberg semantics. The proposed semantics has the following advantages over Berto’s: (i) we model thedeliberate choiceof initial input of imaginative episodes (in a multi-agent setting), (ii) we showframe correspondencesfor axiomatic analogues of Berto’s validities, which (iii) allows thepossibility to disregard axiomsthat might be considered not plausible as principles concerning imaginative episodes. We do not take a definite stance on whether theseshouldbe disregarded but give reasons for why one might want to disregard them. Finally, we compare our semantics briefly with recent work, which aims to model voluntary imagination, and argue that our semantics models different aspects. (shrink)

In the logical context, ignorance is traditionally defined recurring to epistemic logic. In particular, ignorance is essentially interpreted as “lack of knowledge”. This received view has - as we point out - some problems, in particular we will highlight how it does not allow to express a type of content-theoretic ignorance, i.e. an ignorance of φ that stems from an unfamiliarity with its meaning. Contrarily to this trend, in this paper, we introduce and investigate a modal logic having a primitive (...) epistemic operator I, modeling ignorance. Our modal logic is essentially constructed on the modal logics based on weak Kleene three-valued logic introduced by Segerberg (Theoria, 33(1):53–71, 1997). Such non-classical propositional basis allows to define a Kripke-style semantics with the following, very intuitive, interpretation: a formula φ is ignored by an agent if φ is neither true nor false in every world accessible to the agent. As a consequence of this choice, we obtain a type of content-theoretic notion of ignorance, which is essentially different from the traditional approach. We dub it severe ignorance. We axiomatize, prove completeness and decidability for the logic of reflexive (three-valued) Kripke frames, which we find the most suitable candidate for our novel proposal and, finally, compare our approach with the most traditional one. (shrink)

Kaplan says that monsters violate Principle 2 of his theory. Principle 2 is that indexicals, pure and demonstrative alike, are directly referential. In providing this explanation of there being no monsters, Kaplan feels his theory has an advantage over double-indexing theories like Kamp’s or Segerberg’s (or Stalnaker’s), which either embrace monsters or avoid them only by ad hoc stipulation, in the sharp conceptual distinction it draws between circumstances of evaluation and contexts of utterance. We shall argue that Kaplan’s prohibition (...) is also essentially stipulative, and that it is too general. The main difference between ourselves and Kaplan is that the basic carriers of a truth-value is a sentence-in-a-context; our account is utterance-based. (shrink)

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.

The thesis that every truth is knowable is usually glossed by decomposing knowability into possibility and knowledge. Under elementary assumptions about possibility and knowledge, considered as modal operators, the thesis collapses the distinction between truth and knowledge (as shown by the so-called Fitch-argument). We show that there is a more plausible interpretation of knowability—one that does not decompose the notion in the usual way—to which the Fitch-argument does not apply. We call this the potential knowledge-interpretation of knowability. We compare our (...) interpretation with the rephrasal of knowability proposed by Edgington and Rabinowicz and Segerberg, inserting an actuality-operator. This proposal shares some key features with ours but suffers from requiring specific transworld-knowledge. We observe that potential knowledge involves no transworld-knowledge. We describe the logic of potential knowledge by providing models for interpreting the new operator. Finally we show that the knowability thesis can be added to elementary conditions on potential knowledge without collapsing modal distinctions. (shrink)

We present two finitely axiomatized modal propositional logics, one betweenTandS4 and the other an extension ofS4, which are incomplete with respect to the neighbourhood or Scott-Montague semantics.Throughout this paper we are referring to logics which contain all the classical connectives and only one modal connective □ (unary), no propositional constants, all classical tautologies, and which are closed under the rules of modus ponens (MP), substitution, and the rule RE (fromA↔Binfer αA↔ □B). Such logics are calledclassicalby Segerberg [6]. Classical logics (...) which contain the formula □p∧ □q→ □(p∧q) (denoted byK) and its “converse,” □{p∧q)→ □p∧ □q(denoted byR) are called regular;regularlogics which are closed under the rule of necessitation, RN (fromAinfer □A), are callednormal. The logics that we are particularly concerned with are all normal, although some of our results will be true for all regular or all classical logics. It is well known thatKandRand closure under RN imply closure under RE and also that normal logics are also those logics closed under RN and containing □{p→q) → {□p→ □q). (shrink)

In this paper, I propose a solution to Fitch’s paradox that draws on ideas from Edgington (Mind 94:557–568, 1985), Rabinowicz and Segerberg (1994) and Kvanvig (Noûs 29:481–500, 1995). After examining the solution strategies of these authors, I will defend the view, initially proposed by Kvanvig, according to which the derivation of the paradox violates a crucial constraint on quantifier instantiation. The constraint states that non-rigid expressions cannot be substituted into modal positions. We will introduce a slightly modified syntax and (...) semantics that will help underline this point. Furthermore, we will prove results about the consistency of verificationism and the principle of non-omniscience by model-theoretical means. Namely, we prove there exists a model of these principles, and delineate certain constraints they pose on a structure in which they are true. (shrink)

The ongoing expansion of new communication technologies is inseparably linked to the transformation of political communication. The new thinking behind communication is embedded directly in the code of popular social networks. Can a formal political party successfully implement a decentralized mode of communication based on personal connections and weak social ties, or is it against the very logic of both the hierarchical organizations and the technology itself? Our case study describes the vast spectrum of various types of behavior of political (...) actors on Twitter through computer-assisted analysis of Twitter communication in Czech Republic before the elections to the European Parliament in May 2014. The research is based on the concept of connective action, as defined by Bennett and Segerberg. Preliminary results show an emerging typology of campaign strategies, from formal and centralized campaigns on one hand to various hybrid overlaps of traditional and new forms of communication on the other. (shrink)

“Philosophy of action” is a recognized specialty in contemporary philosophy, and the literature on action is fairly extensive: see, for instance, (Care & Landesman 1968; Goldman 1970; Hornsby 1980). The relation of actions to their effects is formulated most clearly in the more specialized literature on the logic of action; see (Belnap & Perloff 1988; Chellas 1992; Czelakowski 1996; Segerberg 1982).

The well known AGM framework for belief revision has recently been extended to include a model of the research agenda of the agent, i.e. a set of questions to which the agent wishes to find answers (Olsson & Westlund in Erkenntnis , 65 , 165–183, 2006 ). The resulting model has later come to be called interrogative belief revision . While belief revision has been studied extensively from the point of view of modal logic, so far interrogative belief revision has (...) only been dealt with in the metalanguage approach in which AGM was originally presented. In this paper, I show how to model interrogative belief revision in a modal object language using a class of operators for questions. In particular, the solution I propose will be shown to capture the notion of K-truncation , a method for agenda update in the case of expansion constructed by Olsson & Westlund. Two case studies are conducted: first, an interrogative extension of Krister Segerberg’s system DDL, and then a similar extension of Giacomo Bonanno’s modal logic for belief revision. Sound and complete axioms will be provided for both of the resulting logics. (shrink)

The theories of belief change developed within the AGM-tradition are not logics in the proper sense, but rather informal axiomatic theories of belief change. Instead of characterizing the models of belief and belief change in a formalized object language, the AGM-approach uses a natural language — ordinary mathematical English — to characterize the mathematical structures that are under study. Recently, however, various authors such as Johan van Benthem and Maarten de Rijke have suggested representing doxastic change within a formal logical (...) language: a dynamic modal logic. Inspired by these suggestions Krister Segerberg has developed a very general logical framework for reasoning about doxastic change: dynamic doxastic logic (DDL). This framework may be seen as an extension of standard Hintikka-style doxastic logic with dynamic operators representing various kinds of transformations of the agent's doxastic state. Basic DDL describes an agent that has opinions about the external world and an ability to change these opinions in the light of new information. Such an agent is non-introspective in the sense that he lacks opinions about his own belief states. Here we are going to discuss various possibilities for developing a dynamic doxastic logic for introspective agents: full DDL or DDL unlimited. The project of constructing such a logic is faced with difficulties due to the fact that the agent’s own doxastic state now becomes a part of the reality that he is trying to explore: when an introspective agent learns more about the world, then the reality he holds beliefs about undergoes a change. But then his introspective (higher-order) beliefs have to be adjusted accordingly. In the paper we shall consider various ways of solving this problem. (shrink)

In the paper, we apply Kooi and Tamminga’s correspondence analysis to some conventional and functionally incomplete fragments of classical propositional logic. In particular, the paper deals with the implication, disjunction, and negation fragments. Additionally, we consider an application of correspondence analysis to some connectiveless fragment with certain basic properties of the logical consequence relation only. As a result of the application, one obtains a sound and complete natural deduction system for any binary extension of each fragment in question. With the (...) focus on exclusive disjunction we comparatively study the proposed systems. Finally, we discuss Segerberg’s systems for connectiveless and negation fragments and compare them with our systems. (shrink)

We present a generalization of Segerberg's onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, with a bi-modal neighborhood semantics. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic.

Stig Kanger made important contributions to logic and formal philosophy. Kanger's most original achievements were in the areas of general proof theory, the semantics of modal and deontic logic, and the logical analysis of the concept of rights. But he contributed significantly to action theory, preference logic and the theory of measurement as well. This is the second of two volumes dedicated to the work of Stig Kanger. The first volume is a complete collection of Kanger's philosophical papers. The present (...) volume contains critical essays on the various aspects of Kanger's work as well as some biographical sketches. Lennart Åqvist, Jan Berg, Brian Chellas, Anatoli Degtyarev, Lars Gustafsson, Sören Halldén, Kaj Børge Hansen, Sven Ove Hansson, Risto Hilpinen, Jaakko Hintikka, Ghita Holmström-Hintikka, Lars Lindahl, Sten Lindström, Ingmar Pörn, Dag Prawitz, Wlodek Rabinowicz, Krister Segerberg, Amartya Sen, Sören Stenlund, Göran Sundholm, and Andrei Voronkov have contributed to this volume. (shrink)

forthcoming in S. Lindström, E. Palmgren, K. Segerberg, and V. Stoltenberg-Hansen (eds) Logicism, Intuitionism, and Formalism — What has Become of Them?, Synthese Library, Springer. Pdf file.

This paper specifies classes of framesmaximally omnitemporally characteristic for Thomas' normal modal logicT 2 + and for each logic in the ascending chain of Segerberg logics investigated by Segerberg and Hughes and Cresswell. It is shown that distinct a,scending chains of generalized Segerberg logics can be constructed from eachT n + logic (n 2). The set containing allT n + and Segerberg logics can be totally- (linearly-) ordered but not well-ordered by the inclusion relation. The order (...) type of this ordered set is *( + 1). Throughout the paper my approach is fundamentally semantical. (shrink)

Dynamic algebras combine the classes of Boolean (B 0) and regular (R ; *) algebras into a single finitely axiomatized variety (B R ) resembling an R-module with scalar multiplication . The basic result is that * is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result (...) is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of prepositional dynamic logic, and yet another notion of regular algebra. (shrink)

Pietruszczak (Bull Sect Log 38(3/4):163–171, 2009) proved that the normal logics K45 , KB4 (=KB5), KD45 are determined by suitable classes of simplified Kripke frames of the form ⟨W,A⟩ , where A⊆W. In this paper, we extend this result. Firstly, we show that a modal logic is determined by a class composed of simplified frames if and only if it is a normal extension of K45. Furthermore, a modal logic is a normal extension of K45 (resp. KD45; KB4; S5) if (...) and only if it is determined by a set consisting of finite simplified frames (resp. such frames with A≠∅; such frames with A=W or A=∅; such frames with A=W). Secondly, for all normal extensions of K45, KB4, KD45 and S5, in particular for extensions obtained by adding the so-called “verum” axiom, Segerberg’s formulas and/or their T-versions, we prove certain versions of Nagle’s Fact (J Symbol Log 46(2):319–328, 1981) (which concerned normal extensions of K5). Thirdly, we show that these extensions are determined by certain classes of finite simplified frames generated by finite subsets of the set N of natural numbers. In the case of extensions with Segerberg’s formulas and/or their T-versions these classes are generated by certain finite subsets of N. (shrink)

Universal logic is to logic what universal algebra is to algebra. It is not a specific system of logic that would apply to everything but a general theory of all existing and possible logics. This new field has been slowly emerging through the new directions of research in logic of the past decades and the name was coined 15 years ago. In the Spring of 2005 was organized in Montreux, Switzerland, the First World Congress on Universal Logic. This exciting event (...) gathered more than 200 people from about 40 different countries. Many famous logicians were present there, such as Dov Gabbay, Krister Segerberg, Saul Kripke, Michael Dunn, Jouko Väännänen. Most of the papers in this book arose from talks - and discussions that follow - presented during this event. They are concerned with philosophical and historical approaches discussing the basic concepts of logic and reflecting the meaning of a universal approach to logic, the development and elaboration of general tools in order to construct frameworks useful for studying classes of logics, applications of logics to concrete problems through the universal perspective. (shrink)

Basin-Matthews-Viganò approach to construction of labelled deduction systems for normal modal logics is adapted to „Fitch proof-format“, and it is applied to the language of deontic-praxeological logic. Segerberg's suggestion on how to asses the adequacy of a logic for Kanger's theory of rights is being formally explicated and it is proved that herewith proposed system of labelled deduction satisfies Segerberg's criteria of adequacy. For the purpose of building the proof a semantics is given, which connects „the simplest semantics (...) of action“ with standard semantics of deontic logic. Soundness and completeness of the proposed labelled deduction with respect to aforementioned semantics is proved. (shrink)

Basin-Matthews-Viganò approach to construction of labelled deduction systems for normal modal logics is adapted to „Fitch proof-format“, and it is applied to the language of deontic-praxeological logic. Segerberg's suggestion on how to asses the adequacy of a logic for Kanger's theory of rights is being formally explicated and it is proved that herewith proposed system of labelled deduction satisfies Segerberg's criteria of adequacy. For the purpose of building the proof a semantics is given, which connects „the simplest semantics (...) of action“ with standard semantics of deontic logic. Soundness and completeness of the proposed labelled deduction with respect to aforementioned semantics is proved. (shrink)