On asymptotic divergency in equivalential logics

Authors:
Zofia Kostrzycka
Affiliations:
University of technology, luboszycka 3, 45-036 opole, poland email: z.kostrzycka@po.opole.pl
Venue:
Mathematical Structures in Computer Science
Year:
2008

Citing 3
Cited 2

Generating functionology

Generating functionology
Statistical properties of simple types

Mathematical Structures in Computer Science
Asymptotic Density for Equivalence

Electronic Notes in Theoretical Computer Science (ENTCS)

Complexity and Limiting Ratio of Boolean Functions over Implication

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The fraction of large random trees representing a given Boolean function in implicational logic

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we characterise the equivalential reducts of classical and intuitionistic logics over a language with two propositional variables. We then investigate the size of the fraction of the tautologies of these logics against all formulas. Some methods from complex analysis are used to achieve this goal.