On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height
Open Access
- 13 February 2018
- journal article
- research article
- Published by Springer Nature in Annals of Combinatorics
- Vol. 22 (1) , 45-91
Abstract
No abstract availableKeywords
All Related Versions
This publication has 44 references indexed in Scilit:
- Asymptotics and random sampling for BCI and BCK lambda termsTheoretical Computer Science, 2013
- On counting untyped lambda termsTheoretical Computer Science, 2013
- The fraction of large random trees representing a given Boolean function in implicational logicRandom Structures & Algorithms, 2011
- A calculus for the random generation of labelled combinatorial structuresTheoretical Computer Science, 1994
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- A correspondence between ALGOL 60 and Church's Lambda-notationsCommunications of the ACM, 1965
- Correspondence between ALGOL 60 and Church's Lambda-notationCommunications of the ACM, 1965
- On axiom systems of propositional calculi, IProceedings of the Japan Academy, Series A, Mathematical Sciences, 1965
- Corrections to Yasuyuki Imai and Kiyoshi Iséki: “On Axiom systems of propositional calculi, I”Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1965
- A Theory of Positive Integers in Formal Logic. Part IIAmerican Journal of Mathematics, 1935