Online research in philosophy

In information security research, perceived security usually has a negative meaning, when it is used in contrast to actual security. From a phenomenological perspective, however, perceived security is all we have. This paper develops a phenomenological account of information security, in which a distinction is made between revealed and reveiled security instead. Linking these notions with the concepts of confidence and trust, the paper provides a phenomenological explanation of the electronic voting controversy in the Netherlands.

Demonstrative noun phrases (e.g. this; that guy over there ) are intimately connected to the context of use in that their reference is determined by demonstrations and/or the speaker's intentions. The semantics of demonstratives therefore has important implications not only for theories of reference, but for questions about how information from the context interacts with formal semantics. First treated by Kaplan as directly referential , demonstratives have recently been analyzed as quantifiers by King, and the choice between these two approaches (...) is a matter of ongoing controversy. Meanwhile, linguists and psychologists working from a variety of perspectives have gathered a wealth of data on the form, meaning, and use of demonstratives in many languages. Demonstratives thus provide a fruitful topic for graduate study for two reasons. On the one hand, they serve as an entry point to foundational issues in reference and the semantics–pragmatics interface. On the other hand, they are an especially promising starting point for interdisciplinary research, which brings the results of linguistics and related fields to bear on the philosophy of language. Author Recommends Kaplan, David. 'Demonstratives.' 1977. Themes from Kaplan . Ed. J. Almong, J. Perry, and H. Wettstein. Oxford: Oxford UP, 1989. 481–563. The seminal work on the semantics of demonstratives and indexicals, such as I, here , and now . Kaplan introduces a distinction between content (which maps from possible circumstances to extensions) and character (which maps from possible contexts to contents). He argues that demonstratives and indexicals are directly referential : given a possible context, their character fixes their extension. Kaplan, David. 'Afterthoughts.' Themes from Kaplan . Ed. J. Almong, J. Perry, and H. Wettstein. Oxford: Oxford UP, 1989. 565–614. An elaboration on the theory developed in 'Demonstratives.' Kaplan considers the connection between direct reference and rigid designation; raises the issue of whether demonstratives depend on demonstrations or speaker intentions; and discusses implications of the analysis for formal semantics and for epistemology. King, Jeffrey C. Complex Demonstratives . Cambridge, MA: MIT Press, 2001. In perhaps the most influential challenge to date to the direct reference theory of demonstratives, King argues that complex demonstratives (i.e. demonstrative determiners with nominal complements) are best analyzed as quantifiers. Braun, David. 'Complex Demonstratives and Their Singular Contents.' Linguistics and Philosophy 31 (2008): 57–99. This recent Kaplanian analysis of complex demonstratives shows the 'state of the art' of direct reference approaches and responds to some of the objections to such approaches raised by King. Elbourne, Paul. 'Demonstratives as Individual Concepts.' Linguistics and Philosophy 31 (2008): 409–466. The most recent analysis of demonstratives as individual concepts, contrasting with both the direct reference and quantificational approaches. Fillmore, Charles. Lectures on Deixis . Stanford, CA: CSLI, 1997. In this collection of lectures, originally delivered in 1971, Fillmore considers demonstratives and indexical expressions in many languages to describe the types of information about the context (e.g. locations in space, time, and discourse) that are encoded in natural language. Gundel, Jeanette K., Nancy Hedberg, and Ron Zacharski. 'Cognitive Status and the Form of Referring Expressions in Discourse.' Language 69 (1993): 274–307. Perhaps the most detailed pragmatic alternative to formal semantic theories of demonstratives and other referring expressions. The authors argue that demonstratives are best described as imposing a condition of use in which the referent of the demonstrative has a certain level of salience for the interlocutors. Online Materials http://plato.stanford.edu/entries/indexicals/ Indexicals (David Braun) http://plato.stanford.edu/entries/reference/ Reference (Marga Reimer) http://plato.stanford.edu/entries/rigid-designators/ Rigid designators (Joseph LaPorte) http://philpapers.org/browse/indexicals-and-demonstratives/ Online bibliography of papers on indexicals and demonstratives Sample Syllabus The following syllabus can be used in entirety for a survey course on demonstratives; in addition, each of the three units is self-contained and can be used alone. Unit 1: Demonstratives and Indexicality Week 1: Indexicals 1. Kaplan, Demonstratives 2. Kaplan, Afterthoughts Week 2: Issues for Indexical Reference 1. Reimer, Marga. 'Do Demonstrations Have Semantic Significance?' Analysis 51 (1991): 177–83. 2. Bach, Kent. 'Intentions and Demonstrations.' Analysis 52 (1992): 140–46. 3. Nunberg, Geoffrey. 'Indexicality and Deixis.' Linguistics and Philosophy 16.1 (1993): 1–43. Week 3: Optional detour: Monsters 1. Schlenker, Philippe. 'A Plea for Monsters.' Linguistics and Philosophy 26 (2003): 29-120. Week 4: Demonstratives as Quantifiers 1. King. Complex Demonstratives , chapters 1–3. Week 5: Indexical and Non-Indexical Demonstratives 1. Braun, David. 'Complex Demonstratives and Their Singular Contents.' Linguistics and Philosophy 31 (2008): 57–99. Optional additional reading 2. Roberts, Craige. 'Demonstratives as Definites.' Information Sharing . Ed. Kees van Deemter and Roger Kibble. Stanford, CA: CSLI Press, 2002. 3. Wolter, Lynsey. 'That's That: The Semantics and Pragmatics of Demonstrative Noun Phrases.' Diss. University of California, Santa Cruz, 2006, chapters 2–3. 4. Elbourne, Paul. 'Demonstratives as Individual Concepts.' Linguistics and Philosophy 31 (2008): 409–66. Unit 2: Demonstratives, Proximity, Salience Week 6: Demonstratives and Proximity 1. Fillmore, Charles. 'Deixis I.' in Lectures on Deixis . Stanford, CA: CSLI, 1997. 59–76. 2. Fillmore, Charles. 'Deixis II.' in Lectures on Deixis . Stanford, CA: CSLI, 1997. 103–26. Optional additional reading 3. Prince, Ellen. 'On the Inferencing of Indefinite- this NPs.' Elements of Discourse Understanding . Ed. Aravind K. Joshi, Bonnie L. Weber, and Ivan A. Sag. Cambridge: Cambridge University Press, 1981. 231–50. Week 7: Demonstratives and Salience 1. Gundel, Jeanette K., Nancy Hedberg, and Ron Zacharski. 'Cognitive Status and the Form of Referring Expressions in Discourse.' Language 69 (1993): 274–307. Optional additional reading 2. Brown-Schmidt, Sarah, Donna K. Byron, and Michael K. Tanenhaus. 'Beyond Salience: Interpretation of Personal and Demonstrative Pronouns.' Journal of Memory and Language 53 (2005): 292–313. Note: readers new to psycholinguistics should concentrate on the Introduction. Unit 3: Demonstratives and Copular Sentences Week 8: Background on the Typology of Copular Sentences 1. Higgins, F. Roger. 'The Pseudo-Cleft Construction in English.' Diss. MIT, 1973, chapter 5. Week 9: Demonstratives in Copular Sentences 1. Mikkelsen, Line. 'Specifying Who: On the Structure, Meaning, and Use of Specificational Copular Clauses.' Diss. University of California, Santa Cruz, 2004, chapter 8.2 (Truncated Clefts). 2. Heller, Daphna and Lynsey Wolter. ' That is Rosa : Identificational Sentences as Intensional Predication.' Proceedings of Sinn und Bedeutung 12 . Ed. Atle Grønn. Oslo: Department of Literature, Area Studies and European Languages, University of Oslo, 2008. Week 10: Demonstratives, Copular Sentences, Modals 1. Birner, Betty J., Jeffrey P. Kaplan, and Gregory Ward. 'Functional Compositionality and the Interaction of Discourse Constraints.' Language 83 (2007): 317–43. Focus Questions 1. Which of the following expressions are indexicals? Which are demonstratives? Why? (a) a pencil (b) the pencil (c) this pencil (d) Mary Smith (e) Mary's pencil (f ) my pencil (g) we (h) you (i) here (j) there (k) now (l) then 2. Do demonstratives ever interact with scope-taking operators to give rise to two or more truth-conditionally distinct readings? If so, under what circumstances? 3. (a) If demonstratives (sometimes or always) interact with scope-taking operators to give rise to two or more truth-conditionally distinct readings, to what extent can a direct reference theory of demonstratives be maintained? (b) If demonstratives never interact with scope-taking operators to give rise to two or more truth-conditionally distinct readings, to what extent can a quantificational theory of demonstratives be maintained? 4. What kind of thing is a demonstration? Is it a pointing gesture? An indication of the speaker's focus of attention? Something more abstract? 5. What information do English demonstratives convey about proximity? What is 'proximity'– physical closeness to the speaker, or something more abstract? What is the status of this information: is it entailed, presupposed, or something else? 6. Do demonstratives that are accompanied by a physical gesture of demonstration have the same semantic value as anaphoric demonstratives, such as that in (a)? Why or why not? (a) John made a peanut butter sandwich and ate it quickly. Next he took an apple from the fridge. He ate that more slowly. (shrink)

Demonstrative noun phrases (e.g., that guy , this ) are of interest to philosophers of language and semanticists because they are sensitive to demonstrations or speaker intentions. The interpretation of a demonstrative therefore sheds light on the role of the context in natural language semantics. This survey reviews two types of approaches to demonstratives: Kaplan's direct reference treatment of demonstratives and other indexicals, and recent challenges to Kaplan's approach that focus on less obviously context-sensitive uses of demonstratives. The survey then (...) covers selected research on demonstratives in linguistics. This research offers new empirical puzzles and contrasting theoretical approaches to demonstratives. (shrink)

The making and taking of psychotropic drugs, whether on medical prescription or as self-medication, whether marketed by pharmaceutical companies or clamoured for by an anxious population, has been an integral part of the twentieth century. In this modern era of speed, uncertainty, pleasure and anguish the boundaries between healing and enhancing the mind by chemical means have been redefined. Long before Prozac would become a household name for an ‘emotional aspirin’ did consumers embrace the idea and practice of taking psychotropics (...) not only to treat mental illness but also to make them feel better about living in a modern world. The Freudian promise that each individual can remake him- or herself in the pursuit of health and happiness was helpful in promoting and legitimizing the idea and practice of seeking wellness on prescription. We will argue that the modern consumer-driven political culture of medicine will continue to transverse the boundaries of therapy and enhancement of the mind into the largely unexplored territories of human cognition and behaviour. However exciting, this endeavour will come at the cost of further widening the problem of iatrogenic addiction in the age of happiness pills as ‘botox’ for the mind. (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)

An -ever free relative is felicitous only when the speaker doesn’t know, or doesn’t care about, the identity of the entity denoted. In this paper we investigate what it means to identify an entity by examining the non-identification condition on -ever free relatives. Following Dayal (In A. Lawson (Ed.), Proceedings of SALT VII, 1997 ), we analyze -ever free relatives as definites with a modal dimension. We show that the variation in the identity of the entity across the possible worlds (...) in the modal dimension cannot be captured in a model where transworld identity is expressed using a single trivial principle of identity, and present an analysis within a model where transworld identity is relativized to noun meanings, which has been proposed in the philosophical literature for other reasons (Geach 1968 ; Gupta, The logic of common nouns: an investigation in quantified modal logic, 1980 ). The analysis thus shows that natural language semantics is sensitive to relative identity in the sense of Geach and Gupta; furthermore, it sets the stage for a new typology of referring expressions based on which expression types contribute principles of transworld identity. (shrink)

Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented.

This paper investigates (modal) extensions of Heyting–Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gödel-embedding of intuitionistic logic into S4 , it is shown that all (modal) extensions of Heyting–Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok–Esakia-Theorem is proved for this (...) embedding. (shrink)

This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal (...) monomodal logics, of nominals and the difference operator by normal operators, of monotonic monomodal logics by normal bimodal logics, of polyadic normal modal logics by polymodal normal modal logics, and of intuitionistic modal logics by normal bimodal logics. (shrink)

This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a (...) smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34]. (shrink)

Thomas Williams has developed a radical interpretation of Duns Scotus’s voluntarism using an earlier interpretation of my own as a foil. He argues that the goodness of creatures and the rightness of actions are wholly dependent on the divine will, apart from any reference to the divine intellect, human nature, or any principle other than God’s own arbitrary will. I explain how his interpretation fails to account for the roles that essential goodness and divine justice play in divine volition. The (...) unmitigated voluntarism that Williams develops does not conform to the full range of authentic Scotistic texts. Despite the interest Williams’s voluntarism may have if taken as a theoretical position, it does not do justice to the nuance and speculative depth of Scotus’s actual understanding of the divine will, whose creative artistry is repugnant to arbitrary volition. I am grateful to Williams for the provocation to develop further the richness of Scotus’s volutarism. (shrink)

We investigate computational properties of propositional logics for dynamical systems. First, we consider logics for dynamic topological systems (W.f), fi, where W is a topological space and f a homeomorphism on W. The logics come with ‘modal’ operators interpreted by the topological closure and interior, and temporal operators interpreted along the orbits {w, f(w), f2 (w), ˙˙˙} of points w ε W. We show that for various classes of topological spaces the resulting logics are not recursively enumerable (and so not (...) recursively axiomatisable). This gives a ‘negative’ solution to a conjecture of Kremer and Mints. Second, we consider logics for dynamical systems (W, f), where W is a metric space and f and isometric function. The operators for topological interior/closure are replaced by distance operators of the form ‘everywhere/somewhere in the ball of radius a, ‘for a ε Q +. In contrast to the topological case, the resulting logic turns out to be decidable, but not in time bounded by any elementary function. (shrink)

We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of closure and interior to simple constraints (...) on relations. These features of the relational semantics suggest a finite axiomatisation of the logic and provide means to prove its EXPTIME-completeness (even if the rational numerical parameters are coded in binary). An extension with metric variables satisfying linear rational (in)equalities is proved to be decidable as well. Our logic can be regarded as a 'well-behaved' common denominator of logical systems constructed in temporal, spatial, and similarity-based quantitative and qualitative representation and reasoning. Interpreted on the real line (with its Euclidean metric), it is a natural fragment of decidable temporal logics for specification and verification of real-time systems. On the real plane, it is closely related to quantitative and qualitative formalisms for spatial representation and reasoning, but this time the logic becomes undecidable. (shrink)

This paper shows that non-normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal (normal) logics. Many properties of logics are shown to be reflected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic.

We solve a major open problem concerning algorithmic properties of products of 'transitive' modal logics by showing that products and commutators of such standard logics as K4. S4. S4.1 K4.3. GL. or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4. K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if C₁ and C₂ (...) are classes of transitive frames such that their depth cannot be bounded by any fixed n < ω, then the logic of the class {F₁ × F₂| F₁ ∈ C₁. F₂ ∈ C₂} is undecidable. (On the contrary, the product of. say. K4 and the logic of all transitive Kripke frames of depth ≤ n, for some fixed n < ω, is decidable.) The complexity of these undecidable logics ranges from r.e. to co-r.e. and $\Pi _{1}^{1}$ -complete. As a consequence, we give the first known examples of Kripke incomplete commutators of Kripke complete logics. (shrink)

It is proved that all bimodal tense logics which contain the logic of the weak orderings and have unbounded depth do not have the interpolation property.

Tense logics formulated in the bimodal propositional language are investigated with respect to Kripke-completeness (completeness) and decidability. It is proved that all minimal tense extensions of modal logics of finite width (in the sense of K. Kine) as well as all minimal tense extensions of cofinal subframe logics (in the sense of M. Zakharyaschev) are complete. The decidability of all finitely axiomatizable minimal tense extensions of cofinal subframe logics is shown. A number of variations and extensions of these results are (...) also presented. (shrink)

The paper considers the set ML 1 of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML 1 , which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.

In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol only. Then formal properties of "quantifying into" (...) epistemic contexts are investigated. The results are illustrated by means of epistemic representations of Nash Equilibria for finite games with mixed strategies. (shrink)

This paper details efforts by the Purdue School of Engineering and Technology at Indiana University Purdue University Indianapolis (IUPUI) to create a single instrument for honors science, technology, engineering and mathematics (STEM) students wishing to demonstrate competence in the IUPUI Principles of Undergraduate Learning (PUL’s) and Accreditation Board for Engineering and Technology (ABET) Engineering Accreditation Criterion (EAC) and Technology Accreditation Criterion (TAC) 2, a (...) through k. Honors courses in Human Behavior, Ethical Decision-Making, Applied Leadership, International Issues and Leadership Theories and Processes were created along with a specific menu of activities and an assessment rubric based on PUL’s and ABET criteria to evaluate student performance in the aforementioned courses. Students who complete the series of 18 Honors Credit hours are eligible for an Honors Certificate in Leadership Studies from the Department of Organizational Leadership and Supervision. Finally, an accounting of how various university assessment criteria, in this case the IUPUI Principles of Undergraduate Learning, can be linked to ABET outcomes and prove student competence in both, using the aforementioned courses, menu of items, and assessment rubrics; these will be analyzed and discussed. (shrink)

This paper is a comparative study of the propositional intuitionistic (non-modal) and classical modal languages interpreted in the standard way on transitive frames. It shows that, when talking about these frames rather than conventional quasi-orders, the intuitionistic language displays some unusual features: its expressive power becomes weaker than that of the modal language, the induced consequence relation does not have a deduction theorem and is not protoalgebraic. Nevertheless, the paper develops a manageable model theory for this consequence and its extensions (...) which also reveals some unexpected phenomena. The balance between the intuitionistic and modal languages is restored by adding to the former one more implication. (shrink)

An objection has been raised that Karol Wojtyła presents an ethical system heavily centered on actions and deeds. With the exception of his occasional references to the virtue of chastity in Love and Responsibility and his first writing on Saint John, some of the most central themes of ancient and medieval, as well as of contemporary, ethics seem almost entirely absent. In the following article, we will turn to Wojtyła’s most important philosophical work, The Acting Person, to glean from it (...) his understanding of “action.” We will then turn to the writings of Dietrich von Hildebrand, as an example of a classic counterpart for any approach to man primarily through action. After briefly discussing the ethical relevance of aspects such as inner responses, fundamental moral attitudes, and virtues, we will conclude by returning to Wojtyła and re-evaluating the legitimacy of the objection raised against him. (shrink)

As a remedy for the bad computational behaviour of first-order temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining so-called monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of first-order logic like the two-variable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for first-order (...) fragments can be used for constructing a tableau algorithm for the corresponding monodic fragment of FOTL. Some example instantiations of the framework are presented. (shrink)

We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...) examples of Kripke incomplete normal bimodal logics which are nevertheless coNP-complete. (shrink)

The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be practical even for logics of rather high (...) complexity. This gives us grounds to believe that, although the satisfiability problem for K ALC is known to be NEXPTIME-complete, by providing a tableau decision algorithm we demonstrate that highly expressive description logics with modal operators have a chance to be implementable. The paper gives a solution to an open problem of Baader and Laux [5]. (shrink)

We present our personal view on W.J. Blok's contribution to modal logic.

We study a propositional bimodal logic consisting of two S4 modalities £ and [a], together with the interaction axiom scheme a £ϕ → £ aϕ. In the intended semantics, the plain £ is given the McKinsey-Tarski interpretation as the interior operator of a topology, while the labelled [a] is given the standard Kripke semantics using a reflexive and transitive binary relation a. The interaction axiom expresses the property that the Ra relation is lower semi-continuous with respect to the topology. The (...) class of topological Kripke frames characterised by the logic includes all frames over Euclidean space where Ra is the positive flow relation of a differential equation. We establish the completeness of the axiomatisation with respect to the intended class of topological Kripke frames, and investigate tableau calculi for the logic, although tableau completeness and decidability are still open questions. (shrink)

Tense logics in the bimodal propositional language are investigated with respect to the Finite Model Property. In order to prove positive results techniques from investigations of modal logics above K4 are extended to tense logic. General negative results show the limits of the transfer.

We define an embedding from the lattice of extensions ofT into the lattice of extensions of the bimodal logic with two monomodal operators 1 and 2, whose 2-fragment isS5 and 1-fragment is the logic of a two-element chain. This embedding reflects the fmp, decidability, completenes and compactness. It follows that the lattice of extension of a bimodal logic can be rather complicated even if the monomodal fragments of the logic belong to the upper part of the lattice of monomodal logics.

The volume Nietzsche on Time and History brings together fourteen essays that were presented during the Fifteenth International Conference of the Friedrich Nietzsche Society (U.K.), held in Cambridge, in September 2005. The chapters are written by leading Nietzsche scholars, mainly from the Anglo-American world. Together they aim at establishing the correlation between Nietzsche's philosophy of time and his philosophy of history. The contributions are divided into the following five parts: "I. Time, History, Method"; "II. Genealogy, Time, Becoming"; "III. Eternal Recurrence, (...) Meaning, Agency"; "IV. Nietzsche's Contemporaries"; and "V. Tragic and Musical Time."The scholarly quality of the essays in general is rather .. (shrink)

1 There have been several editions of Fridugisus’ letter. I have consulted those in Jaques-Paul Migne, Patrologiae cursus completus … series latina, 221 vols., (Paris: J.-P. Migne, 1844–1864), vol. 105, cols. 751–756; Francesco Corvino, “Il ‘De nihilo et tenebris’ di Fredegiso di Tours,” Rivista critica di storia della filosofia (1956), pp. 273–286; and the most recent and authoritative edition, in Concettina Gennaro, Fridugiso di Tours e il “De substantia nihili et tenebrarum”: Edizione critica e studio introduttivo, (“Pubblicazioni dell’istituto universitario di (...) magistero di Catania,” serie filosofica — saggi e monografie, no. 46; Padua: Casa editrice Dott. Antonio Milani, 1963). Fridugisus’ letter survives in four manuscripts. Nevertheless the text is corrupt in places, and all editors have had to suggest emendations here and there. For my translation I have followed Gennaro’s edition, but not always her interpretation. There is another translation, by Hermigild Dressler, in John F. Wippel and Allan Wolter, eds., Medieval Philosophy from St. Augustine to Nicholas of Cusa, (New York: The Free Press, 1969), pp. 104–108. Note that references to the Psalms in this translation are given according to the numbering in the Revised Standard Edition. (shrink)

This is Part 1 of a paper on fibred semantics and combination of logics. It aims to present a methodology for combining arbitrary logical systems L i , i ∈ I, to form a new system L I . The methodology `fibres' the semantics K i of L i into a semantics for L I , and `weaves' the proof theory (axiomatics) of L i into a proof system of L I . There are various ways of doing this, we (...) distinguish by different names such as `fibring', `dovetailing' etc, yielding different systems, denoted by L F I , L D I etc. Once the logics are `weaved', further `interaction' axioms can be geometrically motivated and added, and then systematically studied. The methodology is general and is applied to modal and intuitionistic logics as well as to general algebraic logics. We obtain general results on bulk, in the sense that we develop standard combining techniques and refinements which can be applied to any family of initial logics to obtain further combined logics. The main results of this paper is a construction for combining arbitrary, (possibly not normal) modal or intermediate logics, each complete for a class of (not necessarily frame) Kripke models. We show transfer of recursive axiomatisability, decidability and finite model property. Some results on combining logics (normal modal extensions of K) have recently been introduced by Kracht and Wolter, Goranko and Passy and by Fine and Schurz as well as a multitude of special combined systems existing in the literature of the past 20-30 years. We hope our methodology will help organise the field systematically. (shrink)

In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as fixed-point ones and infinitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among them are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these extensions turn out to be all Kripke complete and can be comparable in a meaningful manner. F. (...) class='Hi'>Wolter showed that the predicate extension of the Halpern-Moses fixed-point type common knowledge logic is Kripke incomplete. However, if we go further to an infinitary extension, Kripke completeness would be recovered. Thus there is some gap in the predicate case. In drawing the map, we focus on what is happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole. (shrink)