default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek W. Zawadowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Marek W. Zawadowski
, Justyna Grudzinska:
Polyadic Quantifiers on Dependent Types. WoLLIC 2024: 278-291
2010 – 2019
- 2019
- [j16]Justyna Grudzinska, Marek W. Zawadowski:
Continuation Semantics for Multi-Quantifier Sentences: Operation-Based Approaches. Fundam. Informaticae 164(4): 327-344 (2019) - [j15]Marek W. Zawadowski:
co-Semi-analytic Functors. Fundam. Informaticae 164(4): 359-373 (2019) - [j14]Justyna Grudzinska, Marek W. Zawadowski:
Inverse Linking, Possessive Weak Definites and Haddock Descriptions: A Unified Dependent Type Account. J. Log. Lang. Inf. 28(2): 239-260 (2019) - 2017
- [j13]Justyna Grudzinska, Marek W. Zawadowski:
Scope ambiguities, monads and strengths. J. Lang. Model. 5(2): 179-227 (2017) - 2016
- [i3]Justyna Grudzinska, Marek W. Zawadowski:
Continuation semantics for multi-quantifier sentences: operation-based approaches. CoRR abs/1608.00255 (2016) - 2015
- [j12]Marek W. Zawadowski:
Generalized Płonka Sums and Products. Appl. Categorical Struct. 23(1): 63-86 (2015) - [j11]Stanislaw Szawiel, Marek W. Zawadowski:
Monads of Regular Theories. Appl. Categorical Struct. 23(3): 215-262 (2015) - [c2]Justyna Grudzinska, Marek W. Zawadowski:
Whence Long-Distance Indefinite Readings? Solving Chierchia's Puzzle with Dependent Types. TbiLLC 2015: 37-53 - 2014
- [j10]Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski:
Rigidity is undecidable. Math. Struct. Comput. Sci. 24(6) (2014) - [j9]Stanislaw Szawiel, Marek W. Zawadowski:
Theories of analytic monads. Math. Struct. Comput. Sci. 24(6) (2014) - [i2]Justyna Grudzinska, Marek W. Zawadowski:
Generalized Quantifiers on Dependent Types: A System for Anaphora. CoRR abs/1402.0033 (2014) - 2012
- [i1]Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski:
Rigidity is undecidable. CoRR abs/1204.4906 (2012)
2000 – 2009
- 2002
- [b1]Silvio Ghilardi, Marek W. Zawadowski:
Sheaves, games, and model completions - a categorical approach to nonclassical propositional logics. Trends in logic 14, Springer 2002, ISBN 978-1-4020-0660-9, pp. I-IX, 1-243 - 2000
- [c1]Silvio Ghilardi, Marek W. Zawadowski:
From Bisimulation Quantifiers to Classifying Toposes. Advances in Modal Logic 2000: 193-220
1990 – 1999
- 1997
- [j8]Silvio Ghilardi, Marek W. Zawadowski:
Model Completions, r-Heyting Categories. Ann. Pure Appl. Log. 88(1): 27-46 (1997) - 1995
- [j7]Marek W. Zawadowski:
Descent and Duality. Ann. Pure Appl. Log. 71(2): 131-188 (1995) - [j6]Silvio Ghilardi, Marek W. Zawadowski:
A Sheaf Representation and Duality for Finitely Presenting Heyting Algebras. J. Symb. Log. 60(3): 911-939 (1995) - [j5]Silvio Ghilardi, Marek W. Zawadowski:
Undefinability of propositional quantifiers in the modal system S4. Stud Logica 55(2): 259-271 (1995) - 1993
- [j4]Gonzalo E. Reyes, Marek W. Zawadowski:
Formal systems for modal operators on locales. Stud Logica 52(4): 595-614 (1993) - 1992
- [j3]Andrzej Ehrenfeucht, Marek W. Zawadowski:
A representation of partial Boolean algebras. Fundam. Informaticae 16(3-4): 349-353 (1992)
1980 – 1989
- 1985
- [j2]Marek W. Zawadowski:
The Skolem-Löwenheim theorem in toposes. II. Stud Logica 44(1): 25-38 (1985) - [j1]Andrzej W. Jankowski, Marek W. Zawadowski:
Sheaves over Heyting lattices. Stud Logica 44(3): 237-256 (1985)
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 2025-01-21 00:15 CET 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:
