Asymptotic density for equivalence

Electronic Notes in Theoretical Computer Science

Volumn 140, Issue 1, 2005, Pages 81-91

  Matecki, Grzegorz ^a  

^a JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Asymptotic evaluation; Probabilistic density; Propositional calculus

Indexed keywords

ASYMPTOTIC STABILITY; PROBABILITY DENSITY FUNCTION;

ASYMPTOTIC DENSITY; PROPOSITIONAL CALCULUS; TAUTOLOGY FRACTION;

COMPUTER SCIENCE;

EID: 27744576623     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.06.022     Document Type: Conference Paper

References (9)

1. B. Chauvin, P. Flajolet, D. Gardy, and B. Gittenberger And/Or Trees Revisited, Combinatorics Probability and Computing 13 2004 457 497
2. L. Comtet Advanced Combinatorics: The Art of Finite and Infinite Expansions rev. enl. ed. 1974 Reidel Dordrecht, Netherlands
3. Matecki G., Gȩstość asymptotyczna formuł zbudowanych ze spójników dwuargumentowych, Master Thesis, Computer Science Institute, Jagiellonian University, 2002
4. M. Moczurad, J. Tyszkiewicz, and M. Zaionc Statistical properties of simple types Mathematical Structures in Computer Science 10 2000 575 594
5. H. Robinson A remark on Stirling formula Ammer. Math. Monthly 62 1955 26 29
6. G. Szegö Orthogonal polynomials Colloquim Publications Fourth edition 1975 AMS Providence 23
7. H.S. Wilf generatingfunctionology Second edition 1994 Academic Press Boston
8. M. Zaionc Statistics of implicational logic WoLLIC'2003 10th Workshop on Logic, Language, Information and Computation Electronic Notes in Theoretical Computer Science 84 2003
9. M. Zaionc On the asymptotic density of tautologies in logic of implication and negation Reports on Mathematical Logic 38 2004