Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Zaionc, Marek
2003.
Statistics of implicational logic
.
Electronic Notes in Theoretical Computer Science,
Vol. 84,
Issue. ,
p.
205.
Zofia Kostrzycka, Zofia x
2003.
On the density of truth of implicational parts of intuitionistic and classical logics.
Journal of Applied Non-Classical Logics,
Vol. 13,
Issue. 3-4,
p.
391.
Matecki, Grzegorz
2005.
Asymptotic Density for Equivalence.
Electronic Notes in Theoretical Computer Science,
Vol. 140,
Issue. ,
p.
81.
Zaionc, Marek
2005.
Probabilistic Approach to the Lambda Definability for Fourth Order Types.
Electronic Notes in Theoretical Computer Science,
Vol. 140,
Issue. ,
p.
41.
Zaionc, Marek
2006.
Probability distribution for simple tautologies.
Theoretical Computer Science,
Vol. 355,
Issue. 2,
p.
243.
Fournier, Hervé
Gardy, Danièle
Genitrini, Antoine
and
Zaionc, Marek
2007.
Computer Science Logic.
Vol. 4646,
Issue. ,
p.
177.
Kostrzycka, Zofia
2007.
The density of truth in monadic fragments of some intermediate logics.
Journal of Logic, Language and Information,
Vol. 16,
Issue. 3,
p.
283.
Genitrini, Antoine
and
Kozik, Jakub
2008.
Logical Foundations of Computer Science.
Vol. 5407,
Issue. ,
p.
280.
Kostrzycka, Zofia
and
Zaionc, Marek
2008.
Asymptotic Densities in Logic and Type Theory.
Studia Logica,
Vol. 88,
Issue. 3,
p.
385.
KOSTRZYCKA, ZOFIA
2008.
On asymptotic divergency in equivalential logics.
Mathematical Structures in Computer Science,
Vol. 18,
Issue. 02,
Moczurad, Małgorzata
and
Moczurad, Włodzimierz
2008.
Language and Automata Theory and Applications.
Vol. 5196,
Issue. ,
p.
385.
Fournier, Hervé
Gardy, Danièle
Genitrini, Antoine
and
Gittenberger, Bernhard
2008.
Mathematical Foundations of Computer Science 2008.
Vol. 5162,
Issue. ,
p.
347.
Genitrini, Antoine
Kozik, Jakub
and
Zaionc, Marek
2008.
Types for Proofs and Programs.
Vol. 4941,
Issue. ,
p.
100.
Kostrzycka, Z.
2009.
On the Density of Truth of Locally Finite Logics.
Journal of Logic and Computation,
Vol. 19,
Issue. 6,
p.
1113.
Fournier, Hervé
Gardy, Danièle
Genitrini, Antoine
and
Zaionc, Marek
2010.
Tautologies over implication with negative literals.
Mathematical Logic Quarterly,
Vol. 56,
Issue. 4,
p.
388.
Pałka, Michał H.
Claessen, Koen
Russo, Alejandro
and
Hughes, John
2011.
Testing an optimising compiler by generating random lambda terms.
p.
91.
Fournier, Hervé
Gardy, Danièle
Genitrini, Antoine
and
Bernhard Gittenberger
2012.
The fraction of large random trees representing a given Boolean function in implicational logic.
Random Structures & Algorithms,
Vol. 40,
Issue. 3,
p.
317.
Genitrini, Antoine
and
Kozik, Jakub
2012.
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 7,
p.
875.
Bodini, O.
Gardy, D.
and
Jacquot, A.
2013.
Asymptotics and random sampling for BCI and BCK lambda terms.
Theoretical Computer Science,
Vol. 502,
Issue. ,
p.
227.
Grygiel, K.
Idziak, P. M.
and
Zaionc, M.
2013.
How big is BCI fragment of BCK logic.
Journal of Logic and Computation,
Vol. 23,
Issue. 3,
p.
673.