pith. sign in

arxiv: cs/0306106 · v2 · submitted 2003-06-17 · 💻 cs.GT · cs.AI

Lexicographic probability, conditional probability, and nonstandard probability

classification 💻 cs.GT cs.AI
keywords probabilityspacesadditivityconditionalcountableequivalentlexicographicnonstandard
0
0 comments X
read the original abstract

The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (LPS's), and nonstandard probability spaces (NPS's) is considered. If countable additivity is assumed, Popper spaces and a subclass of LPS's are equivalent; without the assumption of countable additivity, the equivalence no longer holds. If the state space is finite, LPS's are equivalent to NPS's. However, if the state space is infinite, NPS's are shown to be more general than LPS's.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.