default search action
Marek Zaionc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Zofia Kostrzycka, Marek Zaionc
:
Fuzzy logics - quantitatively. J. Appl. Non Class. Logics 34(1): 97-132 (2024) - 2020
- [c13]Zofia Kostrzycka
Quantitative Study of Fuzzy Logics. FUZZ-IEEE 2020: 1-8
2010 – 2019
- 2019
- [j17]Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc:
Preface. Comb. Probab. Comput. 28(4): 483-484 (2019) - 2018
- [j16]Wojciech Turek, Aleksander Byrski
Special issue on Parallel and distributed computing based on the functional programming paradigm. Concurr. Comput. Pract. Exp. 30(22) (2018) - 2017
- [j15]Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
On the likelihood of normalization in combinatory logic. J. Log. Comput. 27(7): 2251-2269 (2017) - [j14]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. 27(8): 2611-2630 (2017) - 2016
- [c12]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A Natural Counting of Lambda Terms. SOFSEM 2016: 183-194 - [i5]Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
On the likelihood of normalisation in combinatory logic. CoRR abs/1607.04908 (2016) - [i4]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of λ-terms: a natural approach. CoRR abs/1609.07593 (2016) - 2015
- [c11]Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
Asymptotic Properties of Combinatory Logic. TAMC 2015: 62-72 - [i3]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A natural counting of Lambda terms. CoRR abs/1506.02367 (2015) - 2013
- [j13]Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc:
How big is BCI fragment of BCK logic. J. Log. Comput. 23(3): 673-691 (2013) - 2011
- [i2]Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc:
How big is BCI fragment of BCK logic. CoRR abs/1112.0643 (2011) - 2010
- [j12]Hervé Fournier, Danièle Gardy
Tautologies over implication with negative literals. Math. Log. Q. 56(4): 388-396 (2010)
2000 – 2009
- 2009
- [j11]René David, Marek Zaionc:
Counting proofs in propositional logic. Arch. Math. Log. 48(2): 185-199 (2009) - [j10]René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik
Some properties of random lambda terms. Log. Methods Comput. Sci. 9(1) (2009) - [i1]René David, Marek Zaionc:
Counting proofs in propositional logic. CoRR abs/0905.2880 (2009) - 2008
- [j9]Zofia Kostrzycka
Asymptotic Densities in Logic and Type Theory. Stud Logica 88(3): 385-403 (2008) - 2007
- [c10]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical. CSL 2007: 177-193 - [c9]Antoine Genitrini, Jakub Kozik, Marek Zaionc:
Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES 2007: 100-109 - 2006
- [j8]Marek Zaionc:
Probability distribution for simple tautologies. Theor. Comput. Sci. 355(2): 243-260 (2006) - 2005
- [j7]Marek Zaionc:
On the Asymptotic Density of Tautologies in Logic of Implication and Negation. Reports Math. Log. 39: 67-87 (2005) - [e1]Pierre Lescanne, René David, Marek Zaionc:
Proceedings of the Second Workshop on Computational Logic and Applications, CLA 2004, Lyon, France, June 17-18, 2004. Electronic Notes in Theoretical Computer Science 140, Elsevier 2005 [contents] - 2004
- [j6]Zofia Kostrzycka, Marek Zaionc:
Statistics of Intuitionistic versus Classical Logics. Stud Logica 76(3): 307-328 (2004) - [c8]Pierre Lescanne, René David, Marek Zaionc:
Preface. CLA 2004: 1 - [c7]Marek Zaionc:
Probabilistic Approach to the Lambda Definability for Fourth Order Types. CLA 2004: 41-54 - 2003
- [c6]Marek Zaionc:
Statistics of implicational logic. WoLLIC 2003: 205-216 - 2000
- [j5]Malgorzata Moczurad, Jerzy Tyszkiewicz, Marek Zaionc:
Statistical properties of simple types. Math. Struct. Comput. Sci. 10(5): 575-594 (2000)
1990 – 1999
- 1997
- [c5]Jan Malolepszy, Malgorzata Moczurad, Marek Zaionc:
Schwichtenberg-Style Lambda Definability Is Undecidable. TLCA 1997: 267-283 - 1994
- [c4]Marek Zaionc:
Lambda Representation of Operations Between Fifferent Term Algebras. CSL 1994: 91-105 - 1991
- [j4]Marek Zaionc:
lambda-Definability on Free Algebras. Ann. Pure Appl. Log. 51(3): 279-300 (1991) - 1990
- [j3]Marek Zaionc:
A Characterisation of Lambda Definable Tree Operations. Inf. Comput. 89(1): 35-46 (1990)
1980 – 1989
- 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. Reason. 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]Marek Zaionc:
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. RTA 1985: 430-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: