Asymptotically almost all\lambda-terms are strongly normalizing
R David, K Grygiel, J Kozik, C Raffalli… - Logical Methods in …, 2013 - lmcs.episciences.org
We present quantitative analysis of various (syntactic and behavioral) properties of random λ-
terms. Our main results are that asymptotically all the terms are strongly normalizing and that …
terms. Our main results are that asymptotically all the terms are strongly normalizing and that …
[PDF][PDF] Random boolean expressions
D Gardy - Discrete Mathematics & Theoretical Computer …, 2005 - dmtcs.episciences.org
We examine how we can define several probability distributions on the set of Boolean
functions on a fixed number of variables, starting from a representation of Boolean …
functions on a fixed number of variables, starting from a representation of Boolean …
Classical and intuitionistic logic are asymptotically identical
H Fournier, D Gardy, A Genitrini, M Zaionc - Computer Science Logic: 21st …, 2007 - Springer
This paper considers logical formulas built on the single binary connector of implication and
a finite number of variables. When the number of variables becomes large, we prove the …
a finite number of variables. When the number of variables becomes large, we prove the …
Intuitionistic vs. classical tautologies, quantitative comparison
A Genitrini, J Kozik, M Zaionc - … , TYPES 2007, Cividale des Friuli, Italy …, 2008 - Springer
We consider propositional formulas built on implication. The size of a formula is the number
of occurrences of variables in it. We assume that two formulas which differ only in the …
of occurrences of variables in it. We assume that two formulas which differ only in the …
On counting untyped lambda terms
P Lescanne - Theoretical Computer Science, 2013 - Elsevier
Despite λ-calculus is now three quarters of a century old, no formula counting λ-terms has
been proposed yet, and the combinatorics of λ-calculus is considered a hard problem. The …
been proposed yet, and the combinatorics of λ-calculus is considered a hard problem. The …
How big is BCI fragment of BCK logic
We investigate quantitative properties of BCI and BCK logics. The first part of the article
compares the number of formulas provable in BCI versus BCK logics. We consider formulas …
compares the number of formulas provable in BCI versus BCK logics. We consider formulas …
[PDF][PDF] Some properties of random lambda terms
R David, C Raffalli, G Theyssier, K Grygiel… - Logical Methods in …, 2009 - Citeseer
We show various (syntactic and behavioral) properties of random λ-terms. Our main results
are that at least 3/4 of the terms are strongly normalizing and that any fixed closed term …
are that at least 3/4 of the terms are strongly normalizing and that any fixed closed term …
Asymptotic densities in logic and type theory
Z Kostrzycka, M Zaionc - Studia Logica, 2008 - Springer
This paper presents a systematic approach for obtaining results from the area of quantitative
investigations in logic and type theory. We investigate the proportion between tautologies …
investigations in logic and type theory. We investigate the proportion between tautologies …
Asymptotic properties of combinatory logic
M Bendkowski, K Grygiel, M Zaionc - Theory and Applications of Models of …, 2015 - Springer
We present a quantitative analysis of random combinatory logic terms. Our main goal is to
investigate likelihood of semantic properties of random combinators. We show that …
investigate likelihood of semantic properties of random combinators. We show that …
[PDF][PDF] 偏好逆转下消费者生鲜鸡认知与购买意愿: 基于广东省问卷数据的分析
姜百臣, 吴桐桐 - 中国农村观察, 2017 - zgncgc.ajcass.com
为有效避免禽流感疫情风险, 广东省政府对食用鸡强制实施标准化管理,“集中屠宰, 冷链配送,
生鲜上市”. 然而, 由于广东消费者对活鸡有强烈偏好的传统, 生鲜鸡质量安全风险对其信任和 …
生鲜上市”. 然而, 由于广东消费者对活鸡有强烈偏好的传统, 生鲜鸡质量安全风险对其信任和 …