×
Author ID: zaionc.marek Recent zbMATH articles by "Zaionc, Marek"
Published as: Zaionc, Marek; Zaionc, Marec; Zaionc, M.
External Links: MGP · Wikidata
Documents Indexed: 32 Publications since 1985
4 Contributions as Editor
Reviewing Activity: 2 Reviews
Co-Authors: 18 Co-Authors with 21 Joint Publications
298 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

28 Publications have been cited 156 times in 63 Documents Cited by Year
Statistical properties of simple types. Zbl 0966.03016
Moczurad, M.; Tyszkiewicz, J.; Zaionc, M.
19
2000
Asymptotically almost all \(\lambda \)-terms are strongly normalizing. Zbl 1278.03034
David, René; Grygiel, Katarzyna; Kozik, Jakub; Raffalli, Christophe; Theyssier, Guillaume; Zaionc, Marek
15
2013
Classical and intuitionistic logic are asymptotically identical. Zbl 1179.03015
Fournier, Hervé; Gardy, Danièle; Genitrini, Antoine; Zaionc, Marek
13
2007
Statistics of intuitionistic versus classical logics. Zbl 1049.03007
Kostrzycka, Zofia; Zaionc, Marek
13
2004
On the asymptotic density of tautologies in logic of implication and negation. Zbl 1098.03019
Zaionc, Marek
11
2005
Intuitionistic vs. classical tautologies, quantitative comparison. Zbl 1138.03309
Genitrini, Antoine; Kozik, Jakub; Zaionc, Marek
9
2008
A natural counting of lambda terms. Zbl 1428.68095
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
9
2016
Combinatorics of \(\lambda\)-terms: a natural approach. Zbl 1444.03017
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
6
2017
Word operation definable in the typed \(\lambda\)-calculus. Zbl 0638.03014
Zaionc, Marek
6
1987
On the likelihood of normalization in combinatory logic. Zbl 1454.03022
Bendkowski, Maciej; Grygiel, Katarzyna; Zaionc, Marek
6
2017
The set of unifiers in typed \(\lambda\)-calculus as regular expression. Zbl 0584.03010
Zaionc, Marek
6
1985
\(\lambda\)-definability of free algebras. Zbl 0727.03010
Zaionc, Marek
5
1991
Probabilistic approach to the lambda definability for fourth order types. Zbl 1272.03083
Zaionc, Marek
4
2005
Counting proofs in propositional logic. Zbl 1168.03005
David, René; Zaionc, Marek
4
2009
Probability distribution for simple tautologies. Zbl 1090.03002
Zaionc, Marek
4
2006
How big is BCI fragment of BCK logic. Zbl 1282.03012
Grygiel, Katarzyna; Idziak, Paweł M.; Zaionc, Marek
3
2013
Tautologies over implication with negative literals. Zbl 1196.03012
Fournier, Hervé; Gardy, Danièle; Genitrini, Antoine; Zaionc, Marek
3
2010
Mechanical procedure for proof construction via closed terms in typed \(\lambda\) calculus. Zbl 0715.03008
Zaionc, Marek
3
1988
Statistics of implicational logic. Zbl 1264.03036
Zaionc, Marek
2
2003
On the \(\lambda\) definable higher order Boolean operations. Zbl 0672.03005
Zaionc, Marek
2
1989
A characterization of lambda definable tree operations. Zbl 0705.68029
Zaionc, Marek
2
1990
Asymptotic densities in logic and type theory. Zbl 1142.03008
Kostrzycka, Zofia; Zaionc, Marek
2
2008
On the \(\lambda\)-definable tree operations. Zbl 0783.03005
Zaionc, Marek
2
1990
On the density of truth in Dummett’s logic. Zbl 1032.03015
Kostrzycka, Zofia; Zaionc, Marek
2
2003
Asymptotic properties of combinatory logic. Zbl 1461.03015
Bendkowski, Maciej; Grygiel, Katarzyna; Zaionc, Marek
2
2015
Lambda representation of operations between different term algebras. Zbl 1044.03512
Zaionc, Marek
1
1995
The regular expression descriptions of unifier set in the typed \(\lambda\)-calculus. Zbl 0655.03007
Zaionc, Marec
1
1987
Nondeterministic programs definable in typed \(\lambda\)-calculus. Zbl 0579.68022
Zaionc, Marek
1
1985
Combinatorics of \(\lambda\)-terms: a natural approach. Zbl 1444.03017
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
6
2017
On the likelihood of normalization in combinatory logic. Zbl 1454.03022
Bendkowski, Maciej; Grygiel, Katarzyna; Zaionc, Marek
6
2017
A natural counting of lambda terms. Zbl 1428.68095
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
9
2016
Asymptotic properties of combinatory logic. Zbl 1461.03015
Bendkowski, Maciej; Grygiel, Katarzyna; Zaionc, Marek
2
2015
Asymptotically almost all \(\lambda \)-terms are strongly normalizing. Zbl 1278.03034
David, René; Grygiel, Katarzyna; Kozik, Jakub; Raffalli, Christophe; Theyssier, Guillaume; Zaionc, Marek
15
2013
How big is BCI fragment of BCK logic. Zbl 1282.03012
Grygiel, Katarzyna; Idziak, Paweł M.; Zaionc, Marek
3
2013
Tautologies over implication with negative literals. Zbl 1196.03012
Fournier, Hervé; Gardy, Danièle; Genitrini, Antoine; Zaionc, Marek
3
2010
Counting proofs in propositional logic. Zbl 1168.03005
David, René; Zaionc, Marek
4
2009
Intuitionistic vs. classical tautologies, quantitative comparison. Zbl 1138.03309
Genitrini, Antoine; Kozik, Jakub; Zaionc, Marek
9
2008
Asymptotic densities in logic and type theory. Zbl 1142.03008
Kostrzycka, Zofia; Zaionc, Marek
2
2008
Classical and intuitionistic logic are asymptotically identical. Zbl 1179.03015
Fournier, Hervé; Gardy, Danièle; Genitrini, Antoine; Zaionc, Marek
13
2007
Probability distribution for simple tautologies. Zbl 1090.03002
Zaionc, Marek
4
2006
On the asymptotic density of tautologies in logic of implication and negation. Zbl 1098.03019
Zaionc, Marek
11
2005
Probabilistic approach to the lambda definability for fourth order types. Zbl 1272.03083
Zaionc, Marek
4
2005
Statistics of intuitionistic versus classical logics. Zbl 1049.03007
Kostrzycka, Zofia; Zaionc, Marek
13
2004
Statistics of implicational logic. Zbl 1264.03036
Zaionc, Marek
2
2003
On the density of truth in Dummett’s logic. Zbl 1032.03015
Kostrzycka, Zofia; Zaionc, Marek
2
2003
Statistical properties of simple types. Zbl 0966.03016
Moczurad, M.; Tyszkiewicz, J.; Zaionc, M.
19
2000
Lambda representation of operations between different term algebras. Zbl 1044.03512
Zaionc, Marek
1
1995
\(\lambda\)-definability of free algebras. Zbl 0727.03010
Zaionc, Marek
5
1991
A characterization of lambda definable tree operations. Zbl 0705.68029
Zaionc, Marek
2
1990
On the \(\lambda\)-definable tree operations. Zbl 0783.03005
Zaionc, Marek
2
1990
On the \(\lambda\) definable higher order Boolean operations. Zbl 0672.03005
Zaionc, Marek
2
1989
Mechanical procedure for proof construction via closed terms in typed \(\lambda\) calculus. Zbl 0715.03008
Zaionc, Marek
3
1988
Word operation definable in the typed \(\lambda\)-calculus. Zbl 0638.03014
Zaionc, Marek
6
1987
The regular expression descriptions of unifier set in the typed \(\lambda\)-calculus. Zbl 0655.03007
Zaionc, Marec
1
1987
The set of unifiers in typed \(\lambda\)-calculus as regular expression. Zbl 0584.03010
Zaionc, Marek
6
1985
Nondeterministic programs definable in typed \(\lambda\)-calculus. Zbl 0579.68022
Zaionc, Marek
1
1985

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.