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