10 citations · 16 across the 4 of their papers we have counts for
5 papers
Combinatorics of -terms: a natural approach
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne +1
We consider combinatorial aspects of -terms in the model based on de Bruijn indices where each building constructor is of size one. Surprisingly, the counting sequence for -t…
On the likelihood of normalisation in combinatory logic
Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of…
A natural counting of lambda terms
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne +1
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the…
How big is BCI fragment of BCK logic
Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc
We investigate quantitative properties of BCI and BCK logics. The first part of the paper compares the number of formulas provable in BCI versus BCK logics. We consider formulas bu…
Counting proofs in propositional logic
René David, Marek Zaionc
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula…