Bundel inleidende colleges op pre-kandidaatsniveau.

We consider some modal languages with a modal operator $D$ whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.

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

For an arbitrary similarity type of Boolean Algebras with Operators we define a class ofSahlqvist identities. Sahlqvist identities have two important properties. First, a Sahlqvist identity is valid in a complex algebra if and only if the underlying relational atom structure satisfies a first-order condition which can be effectively read off from the syntactic form of the identity. Second, and as a consequence of the first property, Sahlqvist identities arecanonical, that is, their validity is preserved under taking canonical embedding algebras. (...) Taken together, these properties imply that results about a Sahlqvist variety V van be obtained by reasoning in the elementary class of canonical structures of algebras in V.We give an example of this strategy in the variety of Cylindric Algebras: we show that an important identity calledHenkin's equation is equivalent to a simpler identity that uses only one variable. We give a conceptually simple proof by showing that the first-order correspondents of these two equations are equivalent over the class of cylindric atom structures. (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)

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)

For an arbitrary similarity type of Boolean Algebras with Operators we define a class of Sahlqvist identities. Sahlqvist identities have two important properties. First, a Sahlqvist identity is valid in a complex algebra if and only if the underlying relational atom structure satisfies a first-order condition which can be effectively read off from the syntactic form of the identity. Second, and as a consequence of the first property, Sahlqvist identities are canonical, that is, their validity is preserved under taking canonical (...) embedding algebras. Taken together, these properties imply that results about a Sahlqvist variety V van be obtained by reasoning in the elementary class of canonical structures of algebras in V. We give an example of this strategy in the variety of Cylindric Algebras: we show that an important identity called Henkin's equation is equivalent to a simpler identity that uses only one variable. We give a conceptually simple proof by showing that the firstorder correspondents of these two equations are equivalent over the class of cylindric atom structures. (shrink)

We introduce a notion of bisimulation for graded modal logic. Using this notion, the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property and proving invariance and definability results.

Peirce algebras combine sets, relations and various operations linking the two in a unifying setting. This paper offers a modal perspective on Peirce algebras. Using modal logic a characterization of the full Peirce algebras is given, as well as a finite axiomatization of their equational theory that uses so-called unorthodox derivation rules. In addition, the expressive power of Peirce algebras is analyzed through their connection with first-order logic, and the fragment of first-order logic corresponding to Peirce algebras is described in (...) terms of bisimulations. (shrink)

We consider some modal languages with a modal operator D whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.

Peirce algebras combine sets, relations and various operations linking the two in a unifying setting. This paper offers a modal perspective on Peirce algebras. Using modal logic as a characterization of the full Peirce algebras is given, as well as a finite axiomatization of their equational theory that uses so-called unorthodox derivation rules. In addition, the expressive power of Peirce algebras is analyzed through their connection with first-order logic and the fragment of first-order logic corresponding to Peirce algebras is described (...) in terms of bisimulations. (shrink)

People with cancer, who live better or longer than expected or who recover completely despite a poor medical prognosis, usually go through a profound change and self-development. This paper is an attempt to describe and understand the nature of this transformation by examining how initially unexamined conceptions of oneself, life, illness, etc., become manifest and get developed. One feature of this process is that people leave the present-day medical conception, which is based on the notion of victim of and battle (...) against illness, and discover that they have other resources for dealing with life and illness. It will be argued that at the centre of this transformation lies the discovery and development of the will, which is closely associated with the willingness to examine one's conceptions of oneself, health, illness and life. (shrink)

A special interest in optics among various seventeenth-century painters living in the Dutch city of Delft has intrigued historians, including art historians, for a long time. Equally, the impressive career of the Delft microscopist Antoni van Leeuwenhoek has been studied by many historians of science. However, it has never been investigated who, at that time, had access to the mathematical and optical knowledge necessary for the impressive achievements of these Delft practitioners. We have tried to gain insight into Delft as (...) a ‘node’ of optical knowledge by following the careers of three minor local figures in early seventeenth-century Delft. We argue that through their work, products, discussions in the vernacular and exchange of skills, rather than via learned publications, these practitioners constituted a foundation on which the later scientific and artistic achievements of other Delft citizens were built. Our Delft case demonstrates that these practitioners were not simple and isolated craftsmen; rather they were crucial components in a network of scholars, savants, painters and rich virtuosi. Decades before Vermeer made his masterworks, or Van Leeuwenhoek started his famous microscopic investigations, the intellectual atmosphere and artisanal knowledge in this city centred on optical topics. (shrink)

v. 1. On the twelfth century theories of fallacy.--v. 2. The origin and early development of the theory of supposition.

In [6] Albert Visser shows that ILP completely axiomatizes all schemata about provability and relative interpretability that are provable in finitely axiomatized theories. In this paper we introduce a system called $\text{ILP}^{\omega}$ that completely axiomatizes the arithmetically valid principles of provability in and interpretability over such theories. To prove the arithmetical completeness of $\text{ILP}^{\omega}$ we use a suitable kind of tail models; as a byproduct we obtain a somewhat modified proof of Visser's completeness result.

In [6] Albert Visser shows that ILP completely axiomatizes all schemata about provability and relative interpretability that are provable in finitely axiomatized theories. In this paper we introduce a system called ILP that completely axiomatizes the arithmetically valid principles of provability in and interpretability over such theories. To prove the arithmetical completeness of ILP we use a suitable kind of tail models; as a byproduct we obtain a somewhat modified proof of Visser's completeness result.

v. 1. General introduction, the works on logic -- v. 2. The metaphysics, semantics in Aristotle's strategy of argument.

We introduce a notion of bisimulation for graded modal logic. Using this notion, the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property and proving invariance and definability results.

Paperback. This volume is a new interpretation of Plato's earlier and later Theory of Ideas, starting from a detailed analysis of the dialogue, The Sophist.The way in which Plato announces his novel Metaphysics has been puzzling scholars for a long time. Did Plato really introduce Change into the Transcendent World and thus abandon his Theory of Unchangeable Forms?Many of Plato's commentators have claimed that the use of modern techniques of logico-semantical analysis can be a valuable aid in unravelling this problem, (...) as well as other difficulties Plato raised and attempted to solve. In this commentary, Plato's own logico-semantical approach to metaphysical problems is followed. (shrink)

Building on the recent scholarship of Bonnie Kent, Christian Trottmann, and especially L.M. de Rijk, this volume gathers together studies by other specialists on Odonis, covering his ideas in economics, logic, metaphysics, ethics, natural ...

The strong connection between the two and its development into the Middle Ages form a major subject of this volume.Other themes featuring in this book are Plato ...

Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailor made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. (...) Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems. (shrink)

The International workshop 'Frontiers of Combining Systems' is the only forum that is exclusively devoted to research efforts in this interdisciplinary area. This volume contains selected, edited papers from the second installment of the workshop. The contributions range from theorem proving, rewriting and logic to systems and constraints. While there is a clear emphasis on automated tools and logics, the contributions to this volume show that there exists a rapidly expanding body of solutions of particular instances of the combination problem, (...) and at the same time, that the issue of developing general frameworks for intergrating formalisms and systems is taking on an increasingly important position on the international research agenda. The idea of combining formal systems and algorithms has been attracting interest in areas as diverse as constraint logic programming, automated deduction, verification, information retrieval, computational linguistics, artificial intelligence, and logic. As any interesting real world system is a complex composite entity, decomposing its descriptive requirements (for design, verification, or maintenance purposes) into simpler, more restricted tasks is appealing as it is often the only plausible way of tackling complex modelling problems. A core body of notions, questions and results is beginning to emerge in the area, and we are beginning to understand the computational and logical impact of combining methods and algorithms. (shrink)

We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.

This article argues in favour of voluntary active euthanasia in human beings on the grounds that we (society in general) perform euthanasia on valued companion animals when their suffering is considered great. I argue that suffering is a morally relevant criterion that should be considered in all cases (human and animal) of euthanasia. I further argue that human beings possess autonomy, a morally relevant difference to companion animals, that allows them to reason about their futures in a way that animals (...) cannot, which gives us more reason to grant euthanasia, if requested autonomously by terminally ill patients who are experiencing extreme suffering. I consider objections around the sanctity of human life and sufficient palliation. I argue that neither of these objections give sufficient reason to deny competent human beings euthanasia if autonomously requested. (shrink)