Quantitative Study of Fuzzy Logics | 0 | 0.34 | 2020 |
Special issue on Parallel and distributed computing based on the functional programming paradigm. | 0 | 0.34 | 2018 |
On the likelihood of normalisation in combinatory logic. | 0 | 0.34 | 2017 |
Combinatorics of $$\lambda$$-terms: a natural approach. | 0 | 0.34 | 2017 |
Combinatorics of λ-terms: a natural approach. | 0 | 0.34 | 2016 |
A Natural Counting of Lambda Terms. | 6 | 0.53 | 2016 |
Asymptotic Properties of Combinatory Logic. | 2 | 0.40 | 2015 |
How big is BCI fragment of BCK logic | 4 | 0.54 | 2011 |
Tautologies over implication with negative literals | 3 | 0.40 | 2010 |
Counting proofs in propositional logic | 1 | 0.40 | 2009 |
Some properties of random lambda terms | 8 | 0.60 | 2009 |
Asymptotic Densities in Logic and Type Theory | 4 | 0.45 | 2008 |
Classical and intuitionistic logic are asymptotically identical | 16 | 1.20 | 2007 |
Intuitionistic vs. classical tautologies, quantitative comparison | 11 | 0.90 | 2007 |
Probability distribution for simple tautologies | 10 | 0.96 | 2006 |
On the Asymptotic Density of Tautologies in Logic of Implication and Negation | 13 | 1.36 | 2005 |
Probabilistic Approach to the Lambda Definability for Fourth Order Types | 3 | 0.52 | 2005 |
Statistics of Intuitionistic versus Classical Logics | 17 | 1.35 | 2004 |
Statistics of implicational logic | 3 | 0.56 | 2003 |
Schwichtenberg-Style Lambda Definability Is Undecidable | 0 | 0.34 | 1997 |
Lambda Representation of Operations Between Fifferent Term Algebras | 0 | 0.34 | 1994 |
lambda-Definability on Free Algebras | 0 | 0.34 | 1991 |
A characterization of lambda definable tree operations | 2 | 0.52 | 1990 |
How to Define Functionals of Free Structures in Typed Lambda Calculus | 0 | 0.34 | 1989 |
Mechanical procedure for proof construction via closed terms in typed &lgr; calculus | 4 | 0.45 | 1988 |
On the "lambda"-definable tree operations | 0 | 0.34 | 1988 |
The set of unifiers in typed &lgr;-calculus as regular expression | 4 | 2.75 | 1985 |