Online research in philosophy

This chapter begins with a discussion of Kant's theory of judgment-forms. It argues that it is not true in Kant's logic that assertoric or apodeictic judgments imply problematic ones, in the manner in which necessity and truth imply possibility in even the weakest systems of modern modal logic. The chapter then discusses theories of judgment-form after Kant, the theory of quantification, Frege's Begriffsschrift, C. I. Lewis and the beginnings of modern modal logic, the proof-theoretic approach (...) to modal logic, possible world semantics, correspondence theory, and modality and quantification. (shrink)

In this paper, I first trace the course of Prior's struggles with the concepts and phenomena of modality and the reasoning that led him to his own rather peculiar modal logic Q. I find myself in almost complete agreement with Prior's intuitions and the arguments that rest upon them. However, I will argue that those intuitions do not of themselves lead to Q, but that one must also accept a certain picture of what it is for a proposition (...) to be possible. That picture, though, is not inevitable. Rather, implicit in Prior's own account is an alternative picture that has already appeared in various guises, most prominently in the work of Adams, Fine, Deutsch, and Almog. I, too, will opt for this alternative, though I will spell it out rather differently than these philosophers. I will then show that, starting with the alternative picture, Prior's intuitions can lead instead to a much happier and more standard quantified modal logic than Q. The last section of the paper is devoted to the formal development of the logic and its metatheory. (shrink)

In this work we propose an encoding of Reiter’s Situation Calculus solution to the frame problem into the framework of a simple multimodal logic of actions. In particular we present the modal counterpart of the regression technique. This gives us a theorem proving method for a relevant fragment of our modal logic.

The purpose of the present note is to advertise an interesting conjecture concerning a well-known translation in modal logic, by confirming a (highly restricted) special case of the conjecture.

Pace Necessitism – roughly, the view that existence is not contingent – essential properties provide necessary conditions for the existence of objects. Sufficiency properties, by contrast, provide sufficient conditions, and individual essences provide necessary and sufficient conditions. This paper explains how these kinds of properties can be used to illuminate the ontological status of merely possible objects and to construct a respectable possibilist ontology. The paper also reviews two points of interaction between essentialism and modal logic. First, we (...) will briefly see the challenge that arises against S4 from flexible essential properties; as well as the moves available to block it. After this, the emphasis is put on the Barcan Formula (BF), and on why it is problematic for essentialists. As we will see, Necessitism can accommodate both (BF) and essential properties. What necessitists cannot do at the same time is to continue to understanding essential properties as providing necessary conditions for the existence of individuals; against what might be for some a truism. (shrink)

According to many actualists, propositions, singular propositions in particular, are structurally complex, that is, roughly, (i) they have, in some sense, an internal structure that corresponds rather directly to the syntactic structure of the sentences that express them, and (ii) the metaphysical components, or constituents, of that structure are the semantic values — the meanings — of the corresponding syntactic components of those sentences. Given that reference is "direct", i.e., that the meaning of a name is its denotation, an apparent (...) consequence of this view is that any proposition expressed by a sentence containing a name that denotes a contingent being S is itself contingent — notably, the proposition [S does not exist]. Assuming that an entity must exist to have a property, necessarily, [S does not exist] must exist in order to be true. It seems to follow that, necessarily, [S does not exist] is not true and, hence, that S is not contingent after all. Past approaches to the problem — notably, those of Prior and Adams — lead to highly undesirable consequences for quantified modal logic. In this paper, several solutions to this puzzle are developed that preserve actualism, the structured view of propositions, the direct theory of reference, and the intuition that [S does not exist] is indeed possible without the adverse consequences for QML of previous solutions. (shrink)

Modal sentences of the form "every F might be G" and "some F must be G" have a threefold ambiguity. in addition to the familiar readings "de dicto" and "de re", there is a third reading on which they are examples of the "plural de re": they attribute a modal property to the F's plurally in a way that cannot in general be reduced to an attribution of modal properties to the individual F's. The plural "de re" (...) readings of modal sentences cannot be captured within standard quantified modal logic. I consider various strategies for extending standard quantified modal logic so as to provide analyses of the readings in question. I argue that the ambiguity in question is associated with the scope of the general term 'F'; and that plural quantifiers can be introduced for purposes of representing the scope of a general term. Moreover, plural quantifiers provide the only fully adequate solution that keeps within the framework of quantified modal logic. (shrink)

In this note, I show how Christian List's modal logic of republican freedom (as published in this journal in 2006) can be extended (1) to grasp the differences between liberal freedom (noninterference) and republican freedom (non-domination) in terms of two purely logical axioms and (2) to cover a more recent definition of republican freedom in terms of `arbitrary interference' that gains popularity in the literature.

Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises (...) the question whether there are three-valued logics for which there is a shorter translation into S5. The answer is affirmative: we present an elegant linear translation of the Logic of Paradox and of Strong Three-valued Logic into S5. (shrink)

The present paper provides novel results on the model theory of Independence friendly modal logic. We concentrate on its particularly well-behaved fragment that was introduced in Tulenheimo and Sevenster (Advances in Modal Logic, 2006). Here we refer to this fragment as ‘Simple IF modal logic’ (IFML s ). A model-theoretic criterion is presented which serves to tell when a formula of IFML s is not equivalent to any formula of basic modal logic (...) (ML). We generalize the notion of bisimulation familiar from ML; the resulting asymmetric simulation concept is used to prove that IFML s is not closed under complementation. In fact we obtain a much stronger result: the only IFML s formulas admitting their classical negation to be expressed in IFML s itself are those whose truth-condition is in fact expressible in ML. (shrink)

Modal logics have in the past been used as a unifying framework for the minimality semantics used in defeasible inference, conditional logic, and belief revision. The main aim of the present paper is to add adaptive logics, a general framework for a wide range of defeasible reasoning forms developed by Diderik Batens and his co-workers, to the growing list of formalisms that can be studied with the tools and methods of contemporary modal logic. By characterising the (...) class of abnormality models, this aim is achieved at the level of the model-theory. By proposing formulae that express the consequence relation of adaptive logic in the object-language, the same aim is also partially achieved at the syntactical level. (shrink)

ABSTRACT: Part 1 discusses the Stoic notion of propositions (assertibles, axiomata): their definition; their truth-criteria; the relation between sentence and proposition; propositions that perish; propositions that change their truth-value; the temporal dependency of propositions; the temporal dependency of the Stoic notion of truth; pseudo-dates in propositions. Part 2 discusses Stoic modal logic: the Stoic definitions of their modal notions (possibility, impossibility, necessity, non-necessity); the logical relations between the modalities; modalities as properties of propositions; contingent propositions; the relation (...) between the Stoic modal notions and those of Diodorus Cronus and Philo of Megara; the role of ‘external hindrances’ for the modalities; the temporal dependency of the modalities; propositions that change their modalities; the principle that something possible can follow from something impossible; the interpretations of the Stoic modal system by B. Mates, M. Kneale, M. Frede, J. Vuillemin and M. Mignucci are evaluated. -/- For a much shorter English version of Part 1 of the book see my ‘Stoic Logic’, in K. Algra et al. (eds), The Cambridge History of Hellenistic Philosophy, Cambridge 1999, 92-157. For a shorter, updated, English version of Part 2 of the book see my 'Chrysippus' Modal Logic and its Relation to Philo and Diodorus', in K. Doering / Th. Ebert (eds) Dialektiker und Stoiker (Stuttgart 1993) 63-84. (shrink)

This paper deals with the infinitary modal propositional logic Kω1, featuring countable disjunctions and conjunc- tions. It is known that the natural infinitary extension LK.

ABSTRACT: The modal systems of the Stoic logician Chrysippus and the two Hellenistic logicians Philo and Diodorus Cronus have survived in a fragmentary state in several sources. From these it is clear that Chrysippus was acquainted with Philo’s and Diodorus’ modal notions, and also that he developed his own in contrast of Diodorus’ and in some way incorporated Philo’s. The goal of this paper is to reconstruct the three modal systems, including their modal definitions and (...) class='Hi'>modal theorems, and to make clear the exact relations between them; moreover, to elucidate the philosophical reasons that may have led Chrysippus to modify his predessors’ modal concept in the way he did. It becomes apparent that Chrysippus skillfully combined Philo’s and Diodorus’ modal notions, with making only a minimal change to Diodorus’ concept of possibility; and that he thus obtained a modal system of modalities (logical and physical) which fit perfectly fit into Stoic philosophy. (shrink)

We examine the transitions between sets of possible worlds described by the compositional semantics of Modal Dependence Logic, and we use them as the basis for a dynamic version of this logic. We give a game theoretic semantics, a (compositional) transition semantics and a power game semantics for this new variant of modal Dependence Logic, and we prove their equivalence; and furthermore, we examine a few of the properties of this formalism and show that (...) class='Hi'>Modal Dependence Logic can be recovered from it by reasoning in terms of reachability. Then we show how we can generalize this approach to a very general formalism for reasoning about transformations between pointed Kripke models. (shrink)

Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator = (). For propositional variables p 1, . . . , p n , = (p 1, . . . , p n-1, p n ) intuitively states that the value of p n is determined by those of p 1, . . . , p n-1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence (...) logic is complete for nondeterministic exponential time.In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfiability for poor man’s dependence logic, the language consisting of formulas built from literals and dependence atoms using ${\wedge, \square, \lozenge}$ (i. e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness.We also extend Väänänen’s language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satisfiability is complete for the second level of the polynomial hierarchy. Additionally we consider the restriction of modal dependence logic where the length of each single dependence atom is bounded by a number that is fixed for the whole logic. We show that the satisfiability problem for this bounded arity dependence logic is PSPACE-complete and that the complexity drops to the third level of the polynomial hierarchy if we then disallow disjunction.In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by Väänänen and Sevenster. (shrink)

Provability logic is a modal logic for studying properties of provability predicates, and Interpretability logic for studying interpretability between logical theories. Their natural models are GL-models and Veltman models, for which the accessibility relation is well-founded. That’s why the usual counterexample showing the necessity of finite image property in Hennessy-Milner theorem (see [1]) doesn’t exist for them. However, we show that the analogous condition must still hold, by constructing two GL-models with worlds in them that are (...) modally equivalent but not bisimilar, and showing how these GL-models can be converted to Veltman models with the same properties. In the process we develop some useful constructions: games on Veltman models, chains, and general method of transformation from GL-models/frames to Veltman ones. (shrink)

This landmark work provides a systematic introduction to systems of modal logic and stands as the first presentation of what have become central ideas in philosophy of language and metaphysics, from the "new theory of reference" and non-linguistic necessity and essentialism to "Kripke semantics.".

This long-awaited book replaces not one but both of Hughes and Cresswell's two previous classic studies of modal logic: An Introduction to Modal Logic and A Companion to Modal Logic . A New Introduction to Modal Logic has been completely rewritten by the authors to incorporate all the developments that have taken place since 1968 both in modal propositional logical and modal predicate logic, but without sacrificing the clarity of (...) exposition and approachability that were essential features of the earlier works. The book takes readers through the most basic systems of modal prepositional logic right up to systems of modal predicate with identity. It deals with both technical developments such as completeness and incompleteness, and finite and infinite models, and discusses philosophical applications, especially, in the area of modal predicate logic. (shrink)

The Handbook of Modal Logic contains 20 articles, which collectively introduce contemporary modal logic, survey current research, and indicate the way in which the field is developing. The articles survey the field from a wide variety of perspectives: the underling theory is explored in depth, modern computational approaches are treated, and six major applications areas of modal logic (in Mathematics, Computer Science, Artificial Intelligence, Linguistics, Game Theory, and Philosophy) are surveyed. The book contains both (...) well-written expository articles, suitable for beginners approaching the subject for the first time, and advanced articles, which will help those already familiar with the field to deepen their expertise. Please visit: http://people.uleth.ca/~woods/RedSeriesPromo_WP/PubSLPR.html - Compact modal logic reference - Computational approaches fully discussed - Contemporary applications of modal logic covered in depth. (shrink)

A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic introduction to the principal ideas and results in contemporary treatments of modality, including theorems on completeness and decidability. Illustrative chapters focus on deontic logic and conditionality. Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical (...) equipment. Chellas here offers an up-to-date and reliable guide essential for the student. (shrink)

Designed for use by philosophy students, this book provides an accessible, yet technically sound treatment of modal logic and its philosophical applications. Every effort has been made to simplify the presentation by using diagrams in place of more complex mathematical apparatus. These and other innovations provide philosophers with easy access to a rich variety of topics in modal logic, including a full coverage of quantified modal logic, non-rigid designators, definite descriptions, and the de-re de-dictio (...) distinction. Discussion of philosophical issues concerning the development of modal logic is woven into the text. The book uses natural deduction systems and also includes a diagram technique that extends the method of truth trees to modal logic. This feature provides a foundation for a novel method for showing completeness, one that is easy to extend to systems that include quantifiers. (shrink)

Aristotle's Modal Logic presents a very new interpretation of Aristotle's logic by arguing that a proper understanding of the system depends on an appreciation of its connection to the metaphysics. Richard Patterson develops three striking theses in the book. First, there is a fundamental connection between Aristotle's logic of possibility and necessity, and his metaphysics, and that this connection extends far beyond the widely recognised tie to scientific demonstration and relates to the more basic distinction between (...) the essential and accidental properties of a subject. Second, Aristotle's views on modal logic depend in very significant ways on his metaphysics without entailing any sacrifice in rigour. Third, once one has grasped the nature of the relationship, one can understand better certain genuine difficulties in the system of logic and appreciate its strengths in terms of the purposes for which it was created. (shrink)

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

For a novice this book is a mathematically-oriented introduction to modal logic, the discipline within mathematical logic studying mathematical models of reasoning which involve various kinds of modal operators. It starts with very fundamental concepts and gradually proceeds to the front line of current research, introducing in full details the modern semantic and algebraic apparatus and covering practically all classical results in the field. It contains both numerous exercises and open problems, and presupposes only minimal knowledge (...) in mathematics. A specialist can use the book as a source of references. Results and methods of many directions in propositional modal logic, from completeness and duality to algorithmic problems, are collected and systematically presented in one volume. (shrink)

This is a first course in propositional modal logic, suitable for mathematicians, computer scientists and philosophers. Emphasis is placed on semantic aspects, in the form of labelled transition structures, rather than on proof theory. The book covers all the basic material - propositional languages, semantics and correspondence results, proof systems and completeness results - as well as some topics not usually covered in a modal logic course. It is written from a mathematical standpoint. To help the (...) reader, the material is covered in short chapters, each concentrating on one topic. These are arranged into five parts, each with a common theme. An important feature of the book is the many exercises and an extensive set of solutions is provided. (shrink)

The Unprovability of Consistency is concerned with connections between two branches of logic: proof theory and modal logic. Modal logic is the study of the principles that govern the concepts of necessity and possibility; proof theory is, in part, the study of those that govern provability and consistency. In this book, George Boolos looks at the principles of provability from the standpoint of modal logic. In doing so, he provides two perspectives on a (...) debate in modal logic that has persisted for at least thirty years between the followers of C. I. Lewis and W. V. O. Quine. The author employs semantic methods developed by Saul Kripke in his analysis of modal logical systems. The book will be of interest to advanced undergraduate and graduate students in logic, mathematics and philosophy, as well as to specialists in those fields. (shrink)

This book treats modal logic as a theory, with several subtheories, such as completeness theory, correspondence theory, duality theory and transfer theory and is intended as a course in modal logic for students who have had prior contact with modal logic and who wish to study it more deeply. It presupposes training in mathematical or logic. Very little specific knowledge is presupposed, most results which are needed are proved in this book.

In this text, a variety of modal logics at the sentential, first-order, and second-order levels are developed with clarity, precision and philosophical insight.

There are several known Lindström-style characterization results for basic modal logic. This paper proves a generic Lindström theorem that covers any normal modal logic corresponding to a class of Kripke frames definable by a set of formulas called strict universal Horn formulas. The result is a generalization of a recent characterization of modal logic with the global modality. A negative result is also proved in an appendix showing that the result cannot be strengthened to (...) cover every first-order elementary class of frames. This is shown by constructing an explicit counterexample. (shrink)

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 modal logic of Gödel sentences, termed as GS , is introduced to analyze the logical properties of ‘true but unprovable’ sentences in formal arithmetic. The logic GS is, in a sense, dual to Grzegorczyk’s Logic, where modality can be interpreted as ‘true and provable’. As we show, GS and Grzegorczyk’s Logic are, in fact, mutually embeddable. We prove Kripke completeness and arithmetical completeness for GS . GS is also an extended system of the (...) class='Hi'>logic of ‘Essence and Accident’ proposed by Marcos (Bull Sect Log 34(1):43–56, 2005 ). We also clarify the relationships between GS and the provability logic GL and between GS and Intuitionistic Propositional Logic. (shrink)

In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a so-called master modality. Moreover, we explore a connection between the master modality (...) and hybrid logic: We show that if attention is restricted to bidirectional frames, then the expressive power of the master modality is exactly what is needed to translate the bounded fragment of first-order logic into hybrid logic in a truth preserving way. We believe that this throws new light on Arthur Prior's fourth grade tense logic. (shrink)

We show that if we interpret modal diamond as the derived set operator of a topological space, then the modal logic of Stone spaces is K4 and the modal logic of weakly scattered Stone spaces is K4G. As a corollary, we obtain that K4 is also the modal logic of compact Hausdorff spaces and K4G is the modal logic of weakly scattered compact Hausdorff spaces.

We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness (...) both of modal systems and of systems in the quantifier tradition, complexity as well as syntactic characterizations of special semantic constraints. Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. (shrink)

The question, "Which modal logic is the right one for logical necessity?," divides into two questions, one about model-theoretic validity, the other about proof-theoretic demonstrability. The arguments of Halldén and others that the right validity argument is S5, and the right demonstrability logic includes S4, are reviewed, and certain common objections are argued to be fallacious. A new argument, based on work of Supecki and Bryll, is presented for the claim that the right demonstrability logic must (...) be contained in S5, and a more speculative argument for the claim that it does not include S4.2 is also presented. (shrink)

This paper deals with modality in Peirce's existential graphs, as expressed in his gamma and tinctured systems. We aim at showing that there were two philosophically motivated decisions of Peirce's that, in the end, hindered him from producing a modern, conclusive system of modal logic. Finally, we propose emendations and modifications to Peirce's modal graphical tinctured systems and to their underlying ideas that will produce modern modal systems.

A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable.

In this article, the author studies some central concepts in Avicenna's and sī's modal logics as presented in Avicenna's Al-Ish r t wa'l Tan īh t ( Pointers and Reminders ) and in sī's commentary. In this work, Avicenna introduces some remarkable distinctions in order to interpret Aristotle's modal syllogistic in the Prior Analytics . The author outlines a new interpretation of absolute sentences as temporally indefinite sentences and argues on the basis of this that Avicenna seems to (...) subscribe to the Principle of Plenitude. He also shows that he has no valid proof of the modal conversion rules and that he uses some rather ad hoc distinctions to show that Aristotle's modal syllogistic is correct. The author also notes some interesting differences between Avicenna's and sī's approaches to modal logic. (shrink)

This paper responds to criticism of the Kripkean account of logical truth in first-order modal logic. The criticism, largely ignored in the literature, claims that when the box and diamond are interpreted as the logical modality operators, the Kripkean account is extensionally incorrect because it fails to reflect the fact that all sentences stating truths about what is logically possible are themselves logically necessary. I defend the Kripkean account by arguing that some true sentences about logical possibility are (...) not logically necessary. (shrink)

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. (...) In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are. (shrink)

I develop a probabilistic semantics for modal logic that generalizes the quantificational apparatus of Kripke models. Soundness and completeness theorems are proved for propositional M, B, S4, and S5. My semantics formalizes the idea that uncertainty about modal claims like "Possibly-A" arises from the fact that thought experiments which test the intelligibility of A may be inconclusive for a given agent. On this view, an agent who is uncertain about "Possibly-A" assigns at least as much credibility to (...) "Possibly-A" as s/he assigns to A in any of the inconclusive thought experiments, but not more. (shrink)

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in (...) the framework of first-order arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy. (shrink)

We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order logic (...) and SOPML. (shrink)

The hybrid logic and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML is singled out, denoted IFML c . (In the Appendix it is shown that the game-theoretic semantics of IFML c coincides with the compositional semantics of IFML c .) The hybrid logic is proven to (...) be strictly more expressive than IFML c . By contrast, and the full IFML are shown to be incomparable for their expressive powers. Building on earlier research (Tulenheimo and Sevenster 2006), a PSPACE -decidable fragment of the undecidable logic is disclosed. This fragment is not translatable into the hybrid logic and has not been studied previously in connection with hybrid logics. In the Appendix IFML c is shown to lack the property of ‘quasi-positionality’ but proven to enjoy the weaker property of ‘ bounded quasi-positionality’. The latter fact provides from the IFML internal perspective an account of what makes the compositional semantics of IFML c possible. (shrink)

We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order logic (...) and SOPML. (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)

This paper establishes a connection between structure sensitive categorial inference and classical modal logic. The embedding theorems for non-associative Lambek Calculus and the whole class of its weak Sahlqvist extensions demonstrate that various resource sensitive regimes can be modelled within the framework of unimodal temporal logic. On the semantic side, this requires decomposition of the ternary accessibility relation to provide its correlation with standard binary Kripke frames and models.

H. B. Smith, Professor of Philosophy at the influential Pennsylvania School was (roughly) a contemporary of C. I. Lewis who was similarly interested in a proper account of implication. His research also led him into the study of modal logic but in a different direction than Lewis was led. His account of modal logic does not lend itself as readily as Lewis' to the received possible worlds semantics, so that the Smith approach was a (...) casualty rather than a beneficiary of the renewed interest in modality. In this essay we present some of the main points of the Smith approach, in a new guise. (shrink)

In many logics dealing with information one needs to make statements not only about cognitive states, but also about transitions between them. In this paper we analyze a dynamic modal logic that has been designed with this purpose in mind. On top of an abstract information ordering on states it has instructions to move forward or backward along this ordering, to states where a certain assertion holds or fails, while it also allows combinations of such instructions by means (...) of operations from relation algebra. In addition, the logic has devices for expressing whether in a given state a certain instruction can be carried out, and whether that state can be arrived at by carrying out a certain instruction.This paper deals mainly with technical aspects of our dynamic modal logic. It gives an exact description of the expressive power of this language; it also contains results on decidability for the language with arbitrary structures and for the special case with a restricted class of admissible structures. In addition, a complete axiomatization is given. The paper concludes with a remark about the modal algebras appropriate for our dynamic modal logic, and some questions for further work. (shrink)

We do a quantitative analysis of modal logic. For example, for each Kripke structure M, we study the least ordinal μ such that for each state of M, the beliefs of up to level μ characterize the agents' beliefs (that is, there is only one way to extend these beliefs to higher levels). As another example, we show the equivalence of three conditions, that on the face of it look quite different, for what it means to say that (...) the agents' beliefs have a countable description, or putting it another way, have a "countable amount of information". The first condition says that the beliefs of the agents are those at a state of a countable Kripke structure. The second condition says that the beliefs of the agents can be described in an infinitary language, where conjunctions of arbitrary countable sets of formulas are allowed. The third condition says that countably many levels of belief are sufficient to capture all of the uncertainty of the agents (along with a technical condition). The fact that all of these conditions are equivalent shows the robustness of the concept of the agents' beliefs having a "countable description". (shrink)

We investigate properties of propositional modal logic over the classof finite structures. In particular, we show that certain knownpreservation theorems remain true over this class. We prove that aclass of finite models is defined by a first-order sentence and closedunder bisimulations if and only if it is definable by a modal formula.We also prove that a class of finite models defined by a modal formulais closed under extensions if and only if it is defined by a (...) -modal formula. (shrink)

The paper generalises Goldblatt's completeness proof for Lemmon–Scott formulas to various modal propositional logics without classical negation and without ex falso, up to positive modal logic, where conjunction and disjunction, andwhere necessity and possibility are respectively independent.Further the paper proves definability theorems for Lemmon–Scottformulas, which hold even in modal propositional languages without negation and without falsum. Both, the completeness theorem and the definability theoremmake use only of special constructions of relations,like relation products. No second order (...) class='Hi'>logic, no general frames are involved. (shrink)

It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg [10] proved this fact in a syntactic way. Mints [7] extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints' result to the (...) basic modal logic S4; we investigate the correspondence between the quantified versions of S4 (with and without the Barcan formula) and the classical predicate logic (with one-sorted variable). We present a purely proof-theoretic proof-transformation method, reducing an LK-proof of an interpreted formula to a modal proof. (shrink)

It is shown that the constructive four-valued logic N4 can be faithfully embedded into the modal logic S4. This embedding is used to obtain complete, cut-free display sequent calculi for N4 and C4, the modal logic of consistency over N4. C4 is a natural monotonic base system for semantics-based non-monotonic reasoning.

A modal logic for translating a sequence of English sentences to a sequence of logical forms is presented, characterized by Kripke models with points formed from input/output sequences, and valuations determined by entailment relations. Previous approaches based (to one degree or another) on Quantified Dynamic Logic are embeddable within it. Applications to presupposition and ambiguity are described, and decision procedures and axiomatizations supplied.

The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley–Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class of frames that (...) characterizes G. (iii) The class of frames for G characterizes the classically based logic T. (shrink)

In many logics dealing with information one needs to make statements not only about cognitive states, but also about transitions between them. In this paper we analyze a dynamic modal logic that has been designed with this purpose in mind. On top of an abstract information ordering on states it has instructions to move forward or backward along this ordering, to states where a certain assertion holds or fails, while it also allows combinations of such instructions by means (...) of operations from relation algebra. In addition, the logic has devices for expressing whether in a given state a certain instruction can be carried out, and whether that state can be arrived at by carrying out a certain instruction. (shrink)

We discuss a `negative' way of defining frame classes in (multi)modal logic, and address the question of whether these classes can be axiomatized by derivation rules, the `non-ξ rules', styled after Gabbay's Irreflexivity Rule. The main result of this paper is a metatheorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas and Λ+ is the extension of Λ with a set of non-ξ rules, then (...) Λ+ is strongly sound and complete with respect to the class of frames determined by the axioms and the rules. (shrink)

In many logics dealing with information one needs to make statements not only about cognitive states, but also about transitions between them. In this paper we analyze a dynamic modal logic that has been designed with this purpose in mind. On top of an abstract information ordering on states it has instructions to move forward or backward along this ordering, to states where a certain assertion holds or fails, while it also allows combinations of such instructions by means (...) of operations from relation algebra. In addition, the logic has devices for expressing whether in a given state a certain instruction can be carried out, and whether that state can be arrived at by carrying out a certain instruction. This paper deals mainly with technical aspects of our dynamic modal logic. It gives an exact description of the expressive power of this language; it also contains results on decidability for the language with 'arbitrary' structures and for the special case with a restricted class of admissible structures. In addition, a complete axiomatization is given. The paper concludes with a remark about the modal algebras appropriate for our dynamic modal logic, and some questions for further work. The paper only contains some sketchy examples showing how the logic can be used to capture situations of dynamic interest, far more detailed applications are given in a companion to this paper (De Rijke [33]). (shrink)

A powerful challenge to some highly influential theories, this book offers a thorough critical exposition of modal realism, the philosophical doctrine that many possible worlds exist of which our own universe is just one. Chihara challenges this claim and offers a new argument for modality without worlds.

CHAPTER 1. INTENSIONAL LOGIC §1. Natural Language and Intensional Logic When we speak of a theory of meaning for a natural language such as English, ...

INTENSIONAL LOGIC §1. Natural Language and Intensional Logic When we speak of a theory of meaning for a natural language such as English, we have in mind an ...

Normal propositional modal systems This first chapter has two main aims. One is to give a general account of the propositional modal systems that we shall ...

Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi ...

Extensively classroom-tested, Possibilities and Paradox provides an accessible and carefully structured introduction to modal and many-valued logic. The authors cover the basic formal frameworks, enlivening the discussion of these different systems of logic by considering their philosophical motivations and implications. Easily accessible to students with no background in the subject, the text features innovative learning aids in each chapter, including exercises that provide hands-on experience, examples that demonstrate the application of concepts, and guides to further reading.

In this paper we introduce non-normal modal extensions of the sub-classical logics CLoN, CluN and CLaN, in the same way that S0.5 0 extends classical logic. The first modal system is both paraconsistent and paracomplete, while the second one is paraconsistent and the third is paracomplete. Despite being non-normal, these systems are sound and complete for a suitable Kripke semantics. We also show that these systems are appropriate for interpreting □ as “is provable in classical logic”. (...) This allows us to recover the theorems of propositional classical logic within three sub-classical modal systems. (shrink)

A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel–Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.

We show that there are denumerably many Post-complete normal modal logics in the language which includes an additional propositional constant. This contrasts with the case when there is no such constant present, for which it is well known that there are only two such logics.

These lecture notes were composed while teaching a class at Stanford and studying the work of Brian Chellas (Modal Logic: An Introduction, Cambridge: Cambridge University Press, 1980), Robert Goldblatt (Logics of Time and Computation, Stanford: CSLI, 1987), George Hughes and Max Cresswell (An Introduction to Modal Logic, London: Methuen, 1968; A Companion to Modal Logic, London: Methuen, 1984), and E. J. Lemmon (An Introduction to Modal Logic, Oxford: Blackwell, 1977). The Chellas text (...) influenced me the most, though the order of presentation is inspired more by Goldblatt.2 My goal was to write a text for dedicated undergraduates with no previous experience in modal logic. The text had to meet the following desiderata: (1) the level of difficulty should depend on how much the student tries to prove on his or her own—it should be an easy text for those who look up all the proofs in the appendix, yet more difficult for those who try to prove everything themselves; (2) philosophers (i.e., colleagues) with a basic training in logic should be able to work through the text on their own; (3) graduate students should find it useful in preparing for a graduate course in modal logic; (4) the text should prepare people for reading advanced texts in modal logic, such as Goldblatt, Chellas, Hughes and Cresswell, and van Benthem, and in particular, it should help the student to see what motivated the choices in these texts; (5) it should link the two conceptions of logic, namely, the conception of a logic as an axiom system (in which the set of theorems is constructed from the bottom up through proof sequences) and the conception of a logic as a set containing initial ‘axioms’ and closed under ‘rules of inference’ (in which the set of theorems is constructed from the top down, by carving out the logic from the set of all formulas as the smallest set closed under the rules); finally, (6) the pace for the presentation of the completeness theorems should be moderate—the text should be intermediate between Goldblatt and Chellas in this regard (in Goldblatt, the completeness proofs come too quickly for the undergraduate, whereas in Chellas, too many unrelated.... (shrink)

The simplest quantified modal logic combines classical quantification theory with the propositional modal logic K. The models of simple QML relativize predication to possible worlds and treat the quantifier as ranging over a single fixed domain of objects. But this simple QML has features that are objectionable to actualists. By contrast, Kripke-models, with their varying domains and restricted quantifiers, seem to eliminate these features. But in fact, Kripke-models also have features to which actualists object. Though these (...) philosophers have introduced variations on Kripke-models to eliminate their objectionable features, the most well-known variations all have difficulties of their own. The present authors reexamine simple QML and discover that, in addition to having a possibilist interpretation, it has an actualist interpretation as well. By introducing a new sort of existing abstract entity, the contingently nonconcrete, they show that the seeming drawbacks of the simplest QML are not drawbacks at all. Thus, simple QML is independent of certain metaphysical questions. (shrink)

These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary goal is to provide students in Philosophy 151 at Stanford University with a study guide that will complement the lectures on modal logic. There are many textbooks that you can consult for more information. The following is a list of some texts (this is not a complete list, but a pointer to books that I (...) have found particularly useful). (shrink)

The paper presents an alternative substitutional semantics for first-order modal logic which, in contrast to traditional substitutional (or truth-value) semantics, allows for a fine-grained explanation of the semantical behavior of the terms from which atomic formulae are composed. In contrast to denotational semantics, which is inherently reference-guided, this semantics supports a non-referential conception of modal truth and does not give rise to the problems which pertain to the philosophical interpretation of objectual domains (concerning, e.g., possibilia or trans-world (...) identity). The paper also proposes the notion of modality de nomine as an alternative to the denotational notion of modality de re. (shrink)

As McKinsey and Tarksi showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for (classical) propositional modal logic, in which the "necessity" operation is modeled by taking the interior of an arbitrary subset of a topological space. in this paper the topological interpretation is extended in a natural way to arbitrary theories of full first-order logic. The resulting system of S4 first-order modal logic is complete with respect (...) to such topological semantics. (shrink)

This text contains some basic facts about modal logic. For motivation, intuition and examples the reader should consult one of the standard textbooks in the field.

One way to obtain a comprehensive semantics for various systems of modal logic is to use a general notion of non-normal world. In the present article, a general notion of modal system is considered together with a semantic framework provided by such a general notion of non-normal world. Methodologically, the main purpose of this paper is to provide a logical framework for the study of various modalities, notably prepositional attitudes. Some specific systems are studied together with semantics (...) using non-normal worlds of different kinds. (shrink)

Two views of game theory are discussed: (1) game theory as a description of the behavior of rational individuals who recognize each other’s rationality and reasoning abilities, and (2) game theory as an internally consistent recommendation to individuals on how to act in interactive situations. It is shown that the same mathematical tool, namely modal logic, can be used to explicitly model both views.

The title reflects my conviction that, viewed semantically,modal logic is fundamentally dialogical; this conviction is based on the key role played by the notion of bisimulation in modal model theory. But this dialogical conception of modal logic does not seem to apply to modal proof theory, which is notoriously messy. Nonetheless, by making use of ideas which trace back to Arthur Prior (notably the use of nominals, special proposition symbols which name worlds) I will (...) show how to lift the dialogical conception to modal proof theory. I argue that this shift to hybrid logic has consequences for both modal and dialogical logic, and I discuss these in detail. (shrink)

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 BASIC MODAL LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . 3..

Modern logicians have sought to unlock the modal secrets of Aristotle's Syllogistic by assuming a version of essentialism and treating it as a primitive within the semantics. These attempts ultimately distort Aristotle's ontology. None of these approaches make full use of tests found throughout Aristotle's corpus and ancient Greek philosophy. I base a system on Aristotle's tests for things that can never combine (polarity) and things that can never separate (inseparability). The resulting system not only reproduces Aristotle's recorded results (...) for the apodictic syllogistic in the Prior Analytics but it also generates rather than assumes Aristotle's distinctions among 'necessary', 'essential' and 'accidental'. By developing a system around tests that are in Aristotle and basic to ancient Greek philosophy, the system is linked to a history of practices, providing a platform for future work on the origins of logic. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan (...) Formula (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

The author revises the formulation of propositional modal logic by interposing a domain of structured propositions between the modal language and the models. Interpretations of the language (i.e., ways of mapping the language into the domain of propositions) are distinguished from models of the domain of propositions (i.e., ways of assigning truth values to propositions at each world), and this contrasts with the traditional formulation. Truth and logical consequence are defined, in the first instance, as properties of, (...) and relations among, propositions. (shrink)

This paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic.

This article is oriented toward the use of modality in artificial intelligence (AI). An agent must reason about what it or other agents know, believe, want, intend or owe. Referentially opaque modalities are needed and must be formalized correctly. Unfortunately, modal logics seem too limited for many important purposes. This article contains examples of uses of modality for which modal logic seems inadequate.I have no proof that modal logic is inadequate, so I hope modal (...) logicians will take the examples as challenges. (shrink)

The intuitive notion behind the usual semantics of most systems of modal logic is that of ?possible worlds?. Loosely speaking, an expression is necessary if and only if it holds in all possible worlds; it is possible if and only if it holds in some possible world. Of course, contradictory expressions turn out to hold in no possible worlds, and logically true expressions turn out to hold in every possible world. A method is presented for transforming standard (...) class='Hi'>modal systems into systems of modal logic for impossible worlds. To each possible world there corresponds an impossible world such that an expression holds in the impossible world if and only if it does not hold in the possible world. One can then talk about such worlds quite consistently, and there seems to be no logical reason for excluding them from consideration. (shrink)

The logic of ‘elsewhere,’ i.e., of a sentence operator interpretable as attaching to a formula to yield a formula true at a point in a Kripke model just in case the first formula is true at all other points in the model, has been applied in settings in which the points in question represent spatial positions (explaining the use of the word ‘elsewhere’), as well as in the case in which they represent moments of time. This logic is (...) applied here to the alethic modal case, in which the points are thought of as possible worlds, with the suggestion that its deployment clarifies aspects of a position explored by John Divers un-der the name ‘modal agnosticism.’ In particular, it makes available a logic whose Halldén incompleteness explicitly registers the agnostic element of the position – its neutrality as between modal realism and modal anti-realism. (shrink)

We propose a modal logic based on three operators, representing intial beliefs, information and revised beliefs. Three simple axioms are used to provide a sound and complete axiomatization of the qualitative part of Bayes’ rule. Some theorems of this logic are derived concerning the interaction between current beliefs and future beliefs. Information flows and iterated revision are also discussed.

Dealing with topics of definability, this paper provides some interesting insights into the expressive power of basic modal logic. After some preliminary work it presents an abstract algebraic characterization of the elementary classes of basic modal logic, that is, of the classes of models that are definable by means of (sets of) basic modal formulas. Taking that for a start, the paper further contains characterization results for modal universal classes and modal positive classes.

Second-order logic and modal logic are both, separately, major topics of philosophical discussion. Although both have been criticized by Quine and others, increasingly many philosophers find their strictures uncompelling, and regard both branches of logic as valuable resources for the articulation and investigation of significant issues in logical metaphysics and elsewhere. One might therefore expect some combination of the two sorts of logic to constitute a natural and more comprehensive background logic for metaphysics. So (...) it is somewhat surprising to find that philosophical discussion of secondorder modal logic is almost totally absent, despite the pioneering contribution of Barcan. (shrink)

In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4). The novelty of this paper is that we place particular importance on the natural deduction formulation of IS4— our formulation has several important metatheoretic properties. In addition, we study models of IS4— not in the framework of Kirpke semantics, but in the more general framework of category theory. This allows not only a more abstract definition of a whole class of models (...) but also a means of modelling proofs as well as provability. (shrink)

ukasiewicz''s four-valued modal logic is surveyed and analyzed, together with ukasiewicz''s motivations to develop it. A faithful interpretation of it in classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed in the light of the presented results, ukasiewicz''s own texts, and related literature.

First-order modal logic, in the usual formulations, is not suf- ficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal logic: its (...) formal semantics, and a proof procedure using tableaus. Naturally the tableau rules are not complete, but they are with respect to a Henkinization of the “true” semantics. We demonstrate the use of the tableau rules by proving one of the theorems involved in G¨ odel’s ontological argument, one of the rare instances in the literature where higher-order modal constructs have appeared. A fuller treatment of the material presented here is in preparation. (shrink)

In Ockhamist branching-time logic [Prior 67], formulas are meant to be evaluated on a specified branch, or history, passing through the moment at hand. The linguistic counterpart of the manifoldness of future is a possibility operator which is read as `at some branch, or history (passing through the moment at hand)'. Both the bundled-trees semantics [Burgess 79] and the $\langle moment, history\rangle$ semantics [Thomason 84] for the possibility operator involve a quantification over sets of moments. The Ockhamist frames are (...) (3-modal) Kripke structures in which this second-order quantification is represented by a first-order quantification. The aim of the present paper is to investigate the notions of modal definability, validity, and axiomatizability concerning 3-modal frames which can be viewed as generalizations of Ockhamist frames. (shrink)

Horacio Arlo-Costa. First Order Extensions of Classical Systems of Modal Logic: The Role of Barcan Schemas.

Two approaches for defining common knowledge coexist in the literature: the infinite iteration definition and the circular or fixed point one. In particular, an original modelization of the fixed point definition was proposed by Barwise (1989) in the context of a non-well-founded set theory and the infinite iteration approach has been technically analyzed within multi-modal epistemic logic using neighbourhood semantics by Lismont (1993). This paper exhibits a relation between these two ways of modelling common knowledge which seem (...) at first quite different. (shrink)