Computing the density of tautologies in propositional logic by solving system of quadratic equations of generating functions

Taehyun Eom

Home/Archive/arXiv

arXiv · 2003.00511

Computing the density of tautologies in propositional logic by solving system of quadratic equations of generating functions

Taehyun Eom

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we will provide a method to compute the density of tautologies among the set of well-formed formulae consisting of $m$ variables, the negation symbol and the implication symbol; which has a possibility to be applied for other logical systems. This paper contains computational numerical values of the density of tautologies for two, three, and four variable cases. Also, for certain quadratic systems, we will build a theory of the $s$-cut concept to make a memory-time trade-off when we compute the ratio by brute-force counting, and discover a fundamental relation between generating functions' values on the singularity point and ratios of coefficients, which can be understood as another interpretation of the Szeg\H{o} lemma for such quadratic systems. With this relation, we will provide an asymptotic lower bound $m^{-1}-(7/4)m^{-3/2}+O(m^{-2})$ of the density of tautologies in the logic system with $m$ variables, the negation, and the implication, as $m$ goes to the infinity

Explore related subjects

math.LO math.CO

Keep this discovery

BibTeX RIS

Taehyun Eom. 2020-03-01. Computing the density of tautologies in propositional logic by solving system of quadratic equations of generating functions. https://arxiv.org/abs/2003.00511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗