Zofia Kostrzycka - Density of truth in modal logics

dmtcs:3500 - Discrete Mathematics & Theoretical Computer Science, January 1, 2006, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities - https://doi.org/10.46298/dmtcs.3500
Density of truth in modal logicsConference paper

Authors: Zofia Kostrzycka 1,2

  • 1 University of Technology
  • 2 Opole University of Technology

The aim of this paper is counting the probability that a random modal formula is a tautology. We examine {,} fragment of two modal logics S5 and S4 over the language with one propositional variable. Any modal formula written in such a language may be interpreted as a unary binary tree. As it is known, there are finitely many different formulas written in one variable in the logic S5 and this is the key to count the proportion of tautologies of S5 among all formulas. Although the logic S4 does not have this property, there exist its normal extensions having finitely many non-equivalent formulas.


Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: density of truth,Grzegorczyk's logic,S5 modal logic,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

3 Documents citing this article

Consultation statistics

This page has been seen 285 times.
This article's PDF has been downloaded 268 times.