2017/07/25 by Pierfrancesco Guarino · 1 citation
Computer Science · Mathematics · #Advanced Topology and Set Theory #Completeness (order theory) #Computability, Logic, AI Algorithms #Computer science #Conditional probability #Constructive #Discrete mathematics #Logic, Reasoning, and Knowledge #Mathematics #Soundness #Statistics #Type (biology) #cs.LO
paper · pdf · doi:10.4204/eptcs.251.20
published in Electronic Proceedings in Theoretical Computer Science 251, 285-305 (Open Publishing Association) · In Proceedings TARK 2017, arXiv:1707.08250
openalex publication_date 2017/07/25 · arxiv created 2017/07/27 · arxiv updated 2017/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
We construct the universal type structure for conditional probability systems without any topological assumption, namely a type structure that is terminal, belief-complete, and non-redundant. In particular, in order to obtain the belief-completeness in a constructive way, we extend the work of Meier [An Infinitary Probability Logic for Type Spaces. Israel Journal of Mathematics, 192, 1-58] by proving strong soundness and strong completeness of an infinitary conditional probability logic with truthful and non-epistemic conditioning events.