{"title":"Modal Logics of Almost Sure Validities and Zero-One Laws in Horn Classes","authors":"V. V. Sliusarev","doi":"10.1134/S1064562424601446","DOIUrl":null,"url":null,"abstract":"<p>In this paper we develop a method to study Horn classes of Kripke frames from a probabilistic perspective. We consider the uniform distribution on the set of all <i>n</i>-point Kripke frames. A formula is almost surely valid in a Horn class <span>\\(\\mathcal{F}\\)</span> if the probability that it is valid in the <span>\\(\\mathcal{F}\\)</span>-closure of a random <i>n</i>-point frame tends to 1 as <span>\\(n \\to \\infty .\\)</span> Such formulas constitute a normal modal logic. We show that for pseudotransitive and pseudo-Euclidean closures this logic equals <b>S5</b>, and the zero-one law holds.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 2","pages":"442 - 449"},"PeriodicalIF":0.5000,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562424601446","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we develop a method to study Horn classes of Kripke frames from a probabilistic perspective. We consider the uniform distribution on the set of all n-point Kripke frames. A formula is almost surely valid in a Horn class \(\mathcal{F}\) if the probability that it is valid in the \(\mathcal{F}\)-closure of a random n-point frame tends to 1 as \(n \to \infty .\) Such formulas constitute a normal modal logic. We show that for pseudotransitive and pseudo-Euclidean closures this logic equals S5, and the zero-one law holds.
期刊介绍:
Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.