Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Marek Zawadowski
2019
- Justyna Grudzińska and Marek Witold Zawadowski, Inverse Linking, Possessive Weak Definites and Haddock Descriptions: A Unified Dependent Type Account, Journal Of Logic, Language And Information 2019.see in PBN
- Marek Witold Zawadowski, co-Semi-analytic Functors, Fundamenta Informaticae 164 (4) 2019, p. 359–373.see in PBN
- Justyna Grudzińska and Marek Witold Zawadowski, Continuation Semantics for Multi-Quantifier Sentences: Operation-Based Approaches, Fundamenta Informaticae 164 (4) 2019, p. 327–344.see in PBN
2017
- Justyna Grudzińska and Marek Witold Zawadowski, Generalized Quantifiers on Dependent Types: A System for Anaphora, in: Modern Perspectives in Type-Theoretical Semantics, Springer International Publishing, 2017, r. 4, p. 95–131.see in PBN
- Justyna Grudzińska and Marek Witold Zawadowski, Whence Long-Distance Indefinite Readings? Solving Chierchia’s Puzzle with Dependent Types, Lecture Notes In Computer Science 10148 2017, p. 37–53.see in PBN
- Justyna Grudzińska and Marek Witold Zawadowski, Scope ambiguities, monads and strengths, Journal Of Language Modelling 5 (2) 2017, p. 179–227.see in PBN
- Justyna Grudzińska and Marek Witold Zawadowski, Inverse Linking: Taking Scope with Dependent Types, in: Proceedings of the 21st Amsterdam Colloquium, Amsterdam 2017, p. 285–295.see in PBN
- Justyna Grudzińska and Marek Witold Zawadowski, Whence Long-Distance Indefinite Readings? Solving Chierchia’s Puzzle with Dependent Types, in: Logic, Language, and Computation, Springer-Verlag GmbH Germany, Berlin, Heidelberg 2017, p. 37–53.see in PBN
2014
- Stanisław Konrad Szawiel and Marek Witold Zawadowski, Theories of analytic monads, Mathematical Structures In Computer Science 2014.see in PBN
- Mikołaj Bojańczyk, Stanisław Konrad Szawiel and Marek Witold Zawadowski, Rigidity is undecidable, Mathematical Structures In Computer Science 2014.see in PBN
- Justyna Grudzińska and Marek Witold Zawadowski, System with Generalized Quantifiers on Dependent Types for Anaphora, in: Proceedings of the EACL 2014 Workshop on Type Theory and Natural Language Semantics (TTNLS), The Association for Computational Linguistics, Stroudsburg, USA 2014, r. 2, p. 10–18.see in PBN
2002
- S Ghilardi and Marek Witold Zawadowski, From bisimulation quantifiers to classifying toposes, in: Advances in Modal Logic, vol. III, F.Wolter, H.Wansing, M.de Rijke, M.Zakharyashev (eds.), World Scientific Publisher, Singapure 2002.see in PBN
- S Ghilardi and Marek Zawadowski, Sheaves, games and model completions (a categorical approach to non-classical propositional logics), Kluwer Academic Publisher, Doordrecht 2002.see in PBN
1995
- Marek Witold Zawadowski, Lax descent theorems for left exact categories, Dissertationes Mathematicae 346 1995, p. 1–55.see in PBN
- Silvio Ghilardi and Marek Witold Zawadowski, Undefinability of propositional quantifiers in the modal system S4, Studia Logica 55 (2) 1995, p. 259–271.see in PBN
- Marek Witold Zawadowski, Pre-Ordered Quantifiers in Elementary Sentences of Natural Language, in: QUANTIFIERS: LOGICS, MODELS AND COMPUTATION Volume Two: Contributions, SPRINGER-SCIENCE+BUSINESS MEDIA. B.V., Dordrecht 1995, p. 237–253.see in PBN
- Silvio Ghilardi and Marek Witold Zawadowski, A sheaf representation and duality for finitely presented Heyting algebras, Journal Of Symbolic Logic 60 (3) 1995, p. 911–939.see in PBN
- Marek Witold Zawadowski, Descent and duality, Annals Of Pure And Applied Logic 71 (2) 1995, p. 131–188.see in PBN
1989
- Marek Witold Zawadowski, Appendix: Formalization of the feature system in terms of pre-orders, in: Feature system for quantification structures in natural language, 1989 Fortis Publications -Dordrecht, 1989, p. 155–172.see in PBN
You are not logged in | log in
