Decidability and Undecidability in Probability Logic

  • Authors:

  • Sebastiaan A. Terwijn

  • Affiliations:

  • Institute of Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands 1018 TV

  • Venue:
  • LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.