Show simple item record

dc.contributor.authorKozen, Dexter
dc.contributor.authorMardare, Radu
dc.contributor.authorPanangaden, Prakash
dc.date.accessioned2013-06-14T12:54:31Z
dc.date.available2013-06-14T12:54:31Z
dc.date.issued2013-06-14
dc.identifier.urihttps://hdl.handle.net/1813/33380
dc.description.abstractIn this paper we present Hilbert-style axiomatizations for three logics for reasoning about continuous-space Markov processes (MPs): (i) a logic for MPs defined for probability distributions on measurable state spaces, (ii) a logic for MPs defined for sub-probability distributions and (iii) a logic defined for arbitrary distributions.These logics are not compact so one needs infinitary rules in order to obtain strong completeness results. We propose a new infinitary rule that replaces the so-called Countable Additivity Rule (CAR) currently used in the literature to address the problem of proving strong completeness for these and similar logics. Unlike the CAR, our rule has a countable set of instances; consequently it allows us to apply the Rasiowa-Sikorski lemma for establishing strong completeness. Our proof method is novel and it can be used for other logics as well.en_US
dc.language.isoen_USen_US
dc.subjectAumann algebraen_US
dc.subjectMarkovian logicen_US
dc.titleStrong Completeness for Markovian Logicsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics