Skip to main content
SpringerLink
Log in

Iterated Contraction Based on Indistinguishability

  • Conference paper
Logical Foundations of Computer Science (LFCS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7734))

Included in the following conference series:

Abstract

We introduce a class of set-theoretic operators on a tolerance space that models the process of minimal belief contraction, and therefore a natural process of iterated contraction can be defined. We characterize the class of contraction operators and study the properties of the associated iterated belief contraction.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zeeman, E.C.: The topology of the brain and visual perception. In: Fort, M.K. (ed.) The Topology of 3-Manifolds, pp. 240–256. Prentice Hall, Englewood Cliffs (1962)

    Google Scholar 

  2. Bell, J.L.: A new approach to quantum logic. The British Journal for the Philosophy of Science 37, 83–99 (1986)

    MathSciNet  MATH  Google Scholar 

  3. Georgatos, K.: On indistinguishability and prototypes. Logic Journal of the IGPL 11(5), 531–545 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Georgatos, K.: Geodesic revision. Journal of Logic and Computation 19(3), 447–459 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Georgatos, K.: Conditioning by Minimizing Accessibility. In: Bonanno, G., Löwe, B., van der Hoek, W. (eds.) LOFT 2008. LNCS (LNAI), vol. 6006, pp. 20–33. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Lewis, D.: Counterfactuals. Harvard University Press, Cambridge (1973)

    Google Scholar 

  7. Williamson, T.: First-order logics for comparative similarity. Notre Dame Journal of Formal Logic 29, 457–481 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hansson, S.O.: Similarity semantics and minimal changes of belief. Erkenntnis 37, 401–429 (1992)

    Article  MathSciNet  Google Scholar 

  9. Lehmann, D.J., Magidor, M., Schlechta, K.: Distance semantics for belief revision. J. Symb. Log. 66(1), 295–317 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rabinowicz, W.: Global belief revision based on similarities between worlds. In: Hansson, S.O., Rabinowicz, W. (eds.) Logic for a Change: Essays Dedicated to Sten Lindström on the Occasion of His Fiftieth Birthday. Uppsala prints and preprints in philosophy, vol. 9, pp. 80–105. Department of Philosophy, Uppsala University (1995)

    Google Scholar 

  11. Schlechta, K.: Non-prioritized belief revision based on distances between models. Theoria 63(1-2), 34–53 (1997)

    Article  MathSciNet  Google Scholar 

  12. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  13. Makinson, D.: On the status of the postulate of recovery in the logic of theory change. Journal of Philosophical Logic 16, 383–394 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hansson, S.O.: Belief contraction without recovery. Studia Logica 50(2), 251–260 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  15. Fermé, E.L.: On the logic of theory change: Contraction without recovery. Journal of Logic, Language and Information 7(2), 127–137 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nayak, A.C., Goebel, R., Orgun, M.A.: Iterated belief contraction from first principles. In: Veloso, M.M. (ed.) IJCAI, pp. 2568–2573 (2007)

    Google Scholar 

  17. Hansson, S.O.: Multiple and iterated contraction reduced to single-step single-sentence contraction. Synthese 173(2), 153–177 (2010)

    Article  MATH  Google Scholar 

  18. Nayak, A.C., Goebel, R., Orgun, M.A., Pham, T.: Taking Levi Identity Seriously: A Plea for Iterated Belief Contraction. In: Lang, J., Lin, F., Wang, J. (eds.) KSEM 2006. LNCS (LNAI), vol. 4092, pp. 305–317. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Tamminga, A.M.: Expansion and contraction of finite states. Studia Logica 76(3), 427–442 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hansson, S.O.: Global and iterated contraction and revision: An exploration of uniform and semi-uniform approaches. J. Philosophical Logic 41(1), 143–172 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, John Jay College, City University of New York, 524 West 59th Street, New York, New York, 10019, USA

    Konstantinos Georgatos

  2. Doctoral Program in Computer Science, Graduate Center, City University of New York, 365 Fifth Avenue, New York, New York, 10016, USA

    Konstantinos Georgatos

Authors
  1. Konstantinos Georgatos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, CUNY Graduate Center, 365 Fifth Avenue, 10016, New York, NY, USA

    Sergei Artemov

  2. Department of Mathematics, Cornell University, 545 Malott Hall, 14853, Ithaca, NY, USA

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georgatos, K. (2013). Iterated Contraction Based on Indistinguishability. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2013. Lecture Notes in Computer Science, vol 7734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35722-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35722-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35721-3

  • Online ISBN: 978-3-642-35722-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation