default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTadeusz Litak
Journal Articles
- 2020
[j12]Michael Sammler, Deepak Garg, Derek Dreyer, Tadeusz Litak
:
The high-level benefits of low-level sandboxing. Proc. ACM Program. Lang. 4(POPL): 32:1-32:32 (2020)- 2019
- [j11]Wesley H. Holliday, Tadeusz Litak:
Complete additivity and Modal Incompleteness. Rev. Symb. Log. 12(3): 487-535 (2019) - 2018
- [j10]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of Coalgebraic Predicate Logic. Log. Methods Comput. Sci. 14(1) (2018) - [j9]Tadeusz Litak:
Infinite Populations, Choice and Determinacy. Stud Logica 106(5): 969-999 (2018) - 2017
- [j8]Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. Fundam. Informaticae 150(3-4): 407-449 (2017) - [j7]Lutz Schröder, Dirk Pattinson, Tadeusz Litak:
A Van Benthem/Rosen theorem for coalgebraic predicate logic. J. Log. Comput. 27(3): 749-773 (2017) - 2016
- [j6]Tadeusz Litak, Szabolcs Mikulás, Jan Hidders:
Relational lattices: From databases to universal algebra. J. Log. Algebraic Methods Program. 85(4): 540-573 (2016) - 2010
- [j5]Balder ten Cate, Gaëlle Fontaine, Tadeusz Litak:
Some modal aspects of XPath. J. Appl. Non Class. Logics 20(3): 139-171 (2010) - [j4]Balder ten Cate, Tadeusz Litak, Maarten Marx:
Complete axiomatizations for XPath fragments. J. Appl. Log. 8(2): 153-172 (2010) - 2005
- [j3]Tadeusz Litak, Frank Wolter:
All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete. Stud Logica 81(2): 153-165 (2005) - 2004
- [j2]Tadeusz Litak:
Modal Incompleteness Revisited. Stud Logica 76(3): 329-342 (2004) - 2002
- [j1]Tadeusz Litak:
A Continuum of Incomplete Intermediate Logics. Reports Math. Log. 36: 131-141 (2002)
Conference and Workshop Papers
- 2021
- [c14]Jim de Groot, Tadeusz Litak, Dirk Pattinson:
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. LICS 2021: 1-15 - 2020
- [c13]Daniel Hausmann, Tadeusz Litak, Christoph Rauch, Matthias Zinner:
Cheap CTL Compassion in NuSMV. VMCAI 2020: 248-269 - 2018
- [c12]Wesley H. Holliday, Tadeusz Litak:
One Modal Logic to Rule Them All?. Advances in Modal Logic 2018: 367-386 - 2017
- [c11]Tadeusz Litak, Miriam Polzer, Ulrich Rabenstein:
Negative Translations and Normal Modality. FSCD 2017: 27:1-27:18 - 2014
- [c10]Tadeusz Litak, Szabolcs Mikulás, Jan Hidders:
Relational Lattices. RAMiCS 2014: 327-343 - 2013
- [c9]Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion. FICS 2013: 72-86 - 2012
- [c8]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Coalgebraic Predicate Logic. ICALP (2) 2012: 299-311 - 2011
- [c7]Murdoch James Gabbay, Tadeusz Litak, Daniela Petrisan:
Stone Duality for Nominal Boolean Algebras with И. CALCO 2011: 192-207 - [c6]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano:
Coalgebraic Predicate Logic: Equipollence Results and Proof Theory. TbiLLC 2011: 257-276 - 2009
- [c5]Tadeusz Litak, Sven Helmer:
On the Termination Problem for Declarative XML Message Processing. DEXA 2009: 83-97 - 2006
- [c4]Tadeusz Litak:
Algebraization of Hybrid Logic with Binders. RelMiCS 2006: 281-295 - [c3]Tadeusz Litak:
Isomorphism via translation. Advances in Modal Logic 2006: 333-351 - [c2]Balder ten Cate, Tadeusz Litak:
Topological Perspective on the Hybrid Proof Rules. HyLo@FLoC 2006: 79-94 - 2004
- [c1]Tadeusz Litak:
On Notions of Completeness Weaker than Kripke Completeness. Advances in Modal Logic 2004: 149-169
Informal and Other Publications
- 2024
- [i12]Tadeusz Litak:
Ruitenburg's Theorem mechanized and contextualized. CoRR abs/2402.01840 (2024) - [i11]Albert Visser, Tadeusz Litak:
Lewis and Brouwer meet Strong L\"ob. CoRR abs/2404.11969 (2024) - 2021
- [i10]Jim de Groot, Tadeusz Litak, Dirk Pattinson:
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. CoRR abs/2105.01873 (2021) - 2019
- [i9]Tadeusz Litak, Albert Visser:
Lewisian Fixed Points I: Two Incomparable Constructions. CoRR abs/1905.09450 (2019) - 2018
- [i8]Tadeusz Litak:
A continuum of incomplete intermediate logics. CoRR abs/1808.06284 (2018) - [i7]Tadeusz Litak:
Some notes on the superintuitionistic logic of chequered subsets of R∞. CoRR abs/1808.06393 (2018) - [i6]Wesley H. Holliday, Tadeusz Litak:
Complete Additivity and Modal Incompleteness. CoRR abs/1809.07542 (2018) - 2017
- [i5]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of CPL. CoRR abs/1701.03773 (2017) - [i4]Tadeusz Litak, Albert Visser:
Lewis meets Brouwer: constructive strict implication. CoRR abs/1708.02143 (2017) - [i3]Tadeusz Litak:
Constructive Modalities with Provability Smack. CoRR abs/1708.05607 (2017) - [i2]Peter Jipsen, Tadeusz Litak:
An Algebraic Glimpse at Bunched Implications and Separation Logic. CoRR abs/1709.07063 (2017) - 2016
- [i1]Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. CoRR abs/1603.05214 (2016)
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.
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.
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.
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:11 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:
