Tadeusz Litak

Orcid: 0000-0003-2240-3161

Affiliations:
  • University of Erlangen-Nuremberg, Germany


According to our database1, Tadeusz Litak authored at least 33 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ruitenburg's Theorem mechanized and contextualized.
CoRR, 2024

2021
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
The high-level benefits of low-level sandboxing.
Proc. ACM Program. Lang., 2020

Cheap CTL Compassion in NuSMV.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

2019
Complete additivity and Modal Incompleteness.
Rev. Symb. Log., 2019

Lewisian Fixed Points I: Two Incomparable Constructions.
CoRR, 2019

2018
Infinite Populations, Choice and Determinacy.
Stud Logica, 2018

Model Theory and Proof Theory of Coalgebraic Predicate Logic.
Log. Methods Comput. Sci., 2018

Some notes on the superintuitionistic logic of chequered subsets of R<sup>∞</sup>.
CoRR, 2018

One Modal Logic to Rule Them All?.
Proceedings of the Advances in Modal Logic 12, 2018

2017
A Van Benthem/Rosen theorem for coalgebraic predicate logic.
J. Log. Comput., 2017

Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion.
Fundam. Informaticae, 2017

An Algebraic Glimpse at Bunched Implications and Separation Logic.
CoRR, 2017

Constructive Modalities with Provability Smack.
CoRR, 2017

Lewis meets Brouwer: constructive strict implication.
CoRR, 2017

Model Theory and Proof Theory of CPL.
CoRR, 2017

Negative Translations and Normal Modality.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016
Relational lattices: From databases to universal algebra.
J. Log. Algebraic Methods Program., 2016

2014
Relational Lattices.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013
Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion.
Proceedings of the Proceedings Workshop on Fixed Points in Computer Science, 2013

2012
Coalgebraic Predicate Logic.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Coalgebraic Predicate Logic: Equipollence Results and Proof Theory.
Proceedings of the Logic, Language, and Computation, 2011

Stone Duality for Nominal Boolean Algebras with И.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Complete axiomatizations for XPath fragments.
J. Appl. Log., 2010

Some modal aspects of XPath.
J. Appl. Non Class. Logics, 2010

2009
On the Termination Problem for Declarative XML Message Processing.
Proceedings of the Database and Expert Systems Applications, 20th International Conference, 2009

2006
Topological Perspective on the Hybrid Proof Rules.
Proceedings of the International Workshop on Hybrid Logic, 2006

Isomorphism via translation.
Proceedings of the Advances in Modal Logic 6, 2006

Algebraization of Hybrid Logic with Binders.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

2005
All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.
Stud Logica, 2005

2004
Modal Incompleteness Revisited.
Stud Logica, 2004

On Notions of Completeness Weaker than Kripke Completeness.
Proceedings of the Advances in Modal Logic 5, 2004

2002
A Continuum of Incomplete Intermediate Logics.
Reports Math. Log., 2002


  Loading...