| 2011 | ||
|---|---|---|
| i2 | Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc: How big is BCI fragment of BCK logic. CoRR abs/1112.0643 (2011) | |
| 2010 | ||
| j15 | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc: Tautologies over implication with negative literals. Math. Log. Q. 56(4): 388-396 (2010) | |
| 2009 | ||
| j14 | René David, Marek Zaionc: Counting proofs in propositional logic. Arch. Math. Log. 48(2): 185-199 (2009) | |
| j13 | René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc: Some properties of random lambda terms. Logical Methods in Computer Science 9(1) (2009) | |
| i1 | ||
| 2008 | ||
| j12 | Zofia Kostrzycka, Marek Zaionc: Asymptotic Densities in Logic and Type Theory. Studia Logica 88(3): 385-403 (2008) | |
| 2007 | ||
| c7 | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc: Classical and Intuitionistic Logic Are Asymptotically Identical. CSL 2007: 177-193 | |
| c6 | Antoine Genitrini, Jakub Kozik, Marek Zaionc: Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES 2007: 100-109 | |
| 2006 | ||
| j11 | Marek Zaionc: Probability distribution for simple tautologies. Theor. Comput. Sci. 355(2): 243-260 (2006) | |
| 2005 | ||
| j10 | ||
| j9 | Marek Zaionc: Probabilistic Approach to the Lambda Definability for Fourth Order Types. Electr. Notes Theor. Comput. Sci. 140: 41-54 (2005) | |
| j8 | Marek Zaionc: On the Asymptotic Density of Tautologies in Logic of Implication and Negation. Reports on Mathematical Logic 39: 67-87 (2005) | |
| 2004 | ||
| j7 | Zofia Kostrzycka, Marek Zaionc: Statistics of Intuitionistic versus Classical Logics. Studia Logica 76(3): 307-328 (2004) | |
| 2003 | ||
| j6 | Marek Zaionc: Statistics of implicational logic. Electr. Notes Theor. Comput. Sci. 84: 205-216 (2003) | |
| 2000 | ||
| j5 | Malgorzata Moczurad, Jerzy Tyszkiewicz, Marek Zaionc: Statistical properties of simple types. Mathematical Structures in Computer Science 10(5): 575-594 (2000) | |
| 1997 | ||
| c5 | Jan Malolepszy, Malgorzata Moczurad, Marek Zaionc: Schwichtenberg-Style Lambda Definability Is Undecidable. TLCA 1997: 267-283 | |
| 1994 | ||
| c4 | ||
| 1991 | ||
| j4 | ||
| 1990 | ||
| j3 | Marek Zaionc: A Characterisation of Lambda Definable Tree Operations. Inf. Comput. 89(1): 35-46 (1990) | |
| 1989 | ||
| c3 | Marek Zaionc: How to Define Functionals of Free Structures in Typed Lambda Calculus. MFCS 1989: 566-576 | |
| 1988 | ||
| j2 | Marek Zaionc: Mechanical Procedure for Proof Construction via Closed Terms in Typed \lambda Calculus. J. Autom. Reasoning 4(2): 173-190 (1988) | |
| c2 | Marek Zaionc: On the "lambda"-definable tree operations. Algebraic Logic and Universal Algebra in Computer Science 1988: 279-292 | |
| 1987 | ||
| j1 | Marek Zaionc: Word Operation Definable in the Typed lambda-Calculus. Theor. Comput. Sci. 52: 1-14 (1987) | |
| 1985 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sun May 26 11:00:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page