Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • 14 - Extending Lewisian Modal Metaphysics from a Specific Quantum Gravity Perspective

  • from Part III - Issues of Interpretation
  • Edited by Nick Huggett, University of Illinois, Chicago, Keizo Matsubara, Uppsala Universitet, Sweden, Christian Wüthrich, Université de Genève
  • Book:
    Beyond Spacetime
    Published online:
    24 April 2020
    Print publication:
    14 May 2020, pp 304-337

  • Summary

    It is commonly held in many philosophy of quantum gravity circles that endorsing Lewis ontology of modal realism is incompatible with endorsing the fundamental physical ontology of any quantum gravity theory. The unsolvable tension would be between the Lewis metaphysical commitment to the fundamentality of space and time and the physical lesson of quantum gravity about the disappearance of space and time from the fundamental structure of the world. In this essay I argue against the idea that the tension is unsolvable. This analysis does not apply to quantum gravity in genera, but only to quantum string theory.

  • Similarity relations and cover automata

  • Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
  • Journal:
    RAIRO - Theoretical Informatics and Applications / Volume 39 / Issue 1 / January 2005
    Published online by Cambridge University Press:
    15 March 2005, pp. 115-123
    Print publication:
    January 2005

  • Cover automata for finite languages have been much studied a few years ago. It turns out that a simple mathematical structure, namely similarity relations over a finite set of words, is underlying these studies. In the present work, we investigate in detail for themselves the properties of these relations beyond the scope of finite languages. New results with straightforward proofs are obtained in this generalized framework, and previous results concerning cover automata are obtained as immediate consequences.