Sciweavers

Share
LFCS
2009
Springer

Decidability and Undecidability in Probability Logic

9 years 3 months ago
Decidability and Undecidability in Probability Logic
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.
Sebastiaan Terwijn
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where LFCS
Authors Sebastiaan Terwijn
Comments (0)
books