Skip to main content
SpringerLink
Log in

Decidability and Undecidability in Probability Logic

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

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

Included in the following conference series:

Abstract

We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas is undecidable.

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. Barwise, J., Feferman, S. (eds.): Model-theoretic logics. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  2. Börger, E., Grädel, E., Gurevich, Y.: The classical decision problem. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  3. Doob, J.L.: Measure theory. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

  4. Jaeger, M.: A logic for inductive probabilistic reasoning. Synthese 144(2), 181–248 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Keisler, H.J.: Probability quantifiers. In: [1], pp. 509–556

    Google Scholar 

  6. Probability logic papers, database, http://problog.mi.sanu.ac.yu/index.html

  7. Terwijn, S.A.: Probabilistic logic and induction. Journal of Logic and Computation 15(4), 507–515 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Terwijn, S.A.: Model-theoretic aspects of probability logic (in preparation)

    Google Scholar 

  9. Trakhtenbrot, B.: The impossibility of an algorithm for the decision problem for finite models. Dokl. Akad. Nauk SSSR 70, 572–596 (1950); English translation in AMS Transl. Ser. 2, 1–6 (1963)

    Google Scholar 

  10. Valiant, L.G.: Robust logics. Artificial Intelligence 117, 231–253 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Logic, Language and Computation, University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, The Netherlands

    Sebastiaan A. Terwijn

Authors
  1. Sebastiaan A. Terwijn
    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, NY 10016, New York, USA

    Sergei Artemov

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

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terwijn, S.A. (2008). Decidability and Undecidability in Probability Logic. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92687-0_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92686-3

  • Online ISBN: 978-3-540-92687-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation