Decidability and undecidability in probability logic

Authors
Publication date 2009
Host editors
  • S. Artemov
  • A. Nerode
Book title Logical Foundations of Computer Science
Book subtitle International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009 : proceedings
ISBN
  • 9783540926863
ISBN (electronic)
  • 9783540926870
Series Lecture Notes in Computer Science
Event 2009 Symposium on Logical Foundations of Computer Science (LFCS 2009), Deerfield Beach, FL, USA
Pages (from-to) 441-450
Publisher Berlin: Springer
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
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.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-540-92687-0_30
Permalink to this page
Back