# Density of Tautologies in Logics with One Variable

@article{Aszals2012DensityOT, title={Density of Tautologies in Logics with One Variable}, author={L{\'a}szl{\'o} Aszal{\'o}s and Tam{\'a}s Herendi}, journal={Acta Cybern.}, year={2012}, volume={20}, pages={385-398} }

In the present paper we estimate the ratio of the number of tautologies and the number of formulae of length n by determining the asymptotic density of tautologies in different kinds of logics with one variable. The logics under consideration are the ones with a single connective (nand or nor); negation with a connective (disjunction or conjunction); and several connectives.

## One Citation

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

- Computer Science
- 2020

A fundamental relation between generating functions' values on the singularity point and ratios of coefficients is discovered, which can be understood as another intepretation of the Szegő lemma for certain quadratic systems.

## References

SHOWING 1-10 OF 14 REFERENCES

### On the density of truth in modal logics

- Philosophy
- 2005

The aim of this paper is counting the probability that a random modal formula is a tautology. We examine {→, 2} fragment of two modal logics S5 and S4 over the language with one propositional…

### On the Asymptotic Density of Tautologies in Logic of Implication and Negation

- PhilosophyReports Math. Log.
- 2005

The paper solves the problem of finding the asymptotic probability of the set of tautologies of classical logic with one propositional variable, implication and negation and proves the existence of this limit for classical (and at the same time intuitionistic) logic of implication built with exactly one variable.

### ON THE DENSITY OF TRUTH IN GRZEGORCZYK'S MODAL LOGIC

- Mathematics
- 2004

The paper is an attempt to count the proportion of tautologies of Grzegorczyk’s modal calculus among all formulas. We take recourse of some theorems proved in [2].

### Counting Satisfiable k-CNF Formulas

- Computer ScienceCP
- 2001

First, a correspondence between the syntax of propositions to the semantics of functions using a system of equations is described and how to solve such a system is shown.

### Statistical properties of simple types

- MathematicsMathematical Structures in Computer Science
- 2000

From the lower and upper bounds presented, it is deduced that at least 1/3 of classical tautologies are intuitionistic, or the density or asymptotic probability of provable intuitionistic propositional formulas in the set of all formulas.

### A Useful Four-Valued Logic

- Philosophy
- 1977

It is argued that a sophisticated question-answering machine that has the capability of making inferences from its data base should employ a certain four-valued logic, the motivating consideration…

### Asymptotic Density as a Method of Expressing Quantitative Relations in Intuitionistic Logic

- PhilosophyReports Math. Log.
- 2002

### Statistics of Intuitionistic versus Classical Logics

- PhilosophyStud Logica
- 2004

This paper shows the exact density of intuitionistic logic and demonstrates that it covers a substantial part of classical prepositional calculus and may have a philosophical impact on understanding how much the phenomenon of truth is sporadic or frequent in random mathematics sentences.

### Orthogonal polynomials, volume XXIII of AMS Colloquium Publications

- Orthogonal polynomials, volume XXIII of AMS Colloquium Publications
- 1939