Yde Venema

According to our database1, Yde Venema authored at least 76 papers between 1990 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Completeness of Flat Coalgebraic Fixpoint Logics.
ACM Trans. Comput. Log., 2018

Completeness for the modal μ-calculus: Separating the combinatorics from the dynamics.
Theor. Comput. Sci., 2018

Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties.
Logical Methods in Computer Science, 2018

2017
An expressive completeness theorem for coalgebraic modal mu-calculi.
Logical Methods in Computer Science, 2017

Irreducible Equivalence Relations, Gleason Spaces, and de Vries Duality.
Applied Categorical Structures, 2017

Parity Games and Automata for Game Logic.
Proceedings of the Dynamic Logic. New Trends and Applications, 2017

Disjunctive Bases: Normal Forms for Modal Logics.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Completeness for Coalgebraic Fixpoint Logic.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
Lax extensions of coalgebra functors and their logic.
J. Comput. Syst. Sci., 2015

Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Uniform Interpolation for Coalgebraic Fixpoint Logic.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Proof systems for Moss' coalgebraic logic.
Theor. Comput. Sci., 2014

Weak MSO: automata and expressiveness modulo bisimilarity.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

PDL Inside the ?-calculus: A Syntactic and an Automata-theoretic Characterization.
Proceedings of the Advances in Modal Logic 10, 2014

Expressiveness Modulo Bisimilarity: A Coalgebraic Perspective.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013
Generalised powerlocales via relation lifting.
Mathematical Structures in Computer Science, 2013

A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
Foreword.
Studia Logica, 2012

Completeness for the coalgebraic cover modality
Logical Methods in Computer Science, 2012

Lax Extensions of Coalgebra Functors.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

Stream Automata Are Coalgebras.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011
On monotone modalities and adjointness.
Mathematical Structures in Computer Science, 2011

Model Constructions for Moss' Coalgebraic Logic.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Logics and Algebras for Multiple Players.
Rew. Symb. Logic, 2010

Coalgebra and Logic: A Brief Overview.
J. Log. Comput., 2010

Vietoris Bisimulations.
J. Log. Comput., 2010

Automata for Coalgebras: An Approach Using Predicate Liftings.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Flat Coalgebraic Fixed Point Logics.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Uniform Interpolation for Monotone Modal Logic.
Proceedings of the Advances in Modal Logic 8, 2010

Coalgebraic Lindströom Theorems.
Proceedings of the Advances in Modal Logic 8, 2010

2009
Algebraic and Coalgebraic Logic Corner.
J. Log. Comput., 2009

Fixpoint Logics and Automata: A Coalgebraic Approach.
Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Complementation of Coalgebra Automata.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Coalgebraic Automata Theory: Basic Results.
Logical Methods in Computer Science, 2008

Modal Logics are Coalgebraic.
Proceedings of the Visions of Computer Science, 2008

Completeness of the finitary Moss logic.
Proceedings of the Advances in Modal Logic 7, 2008

Proof systems for the coalgebraic cover modality.
Proceedings of the Advances in Modal Logic 7, 2008

2007
Finite Model Theory and Its Applications
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-68804-4, 2007

A Modal Distributive Law (abstract).
Proceedings of the Logic, 2007

Completeness for Flat Modal Fixpoint Logics.
Proceedings of the Logic for Programming, 2007

Nabla Algebras and Chu Spaces.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Automata and fixed point logic: A coalgebraic perspective.
Inf. Comput., 2006

Definitorially Complete Description Logics.
Proceedings of the Proceedings, 2006

2005
A Sahlqvist theorem for distributive modal logic.
Ann. Pure Appl. Logic, 2005

Closure Properties of Coalgebra Automata.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2004
Stone coalgebras.
Theor. Comput. Sci., 2004

A Dual Characterization of Subdirectly Irreducible BAOs.
Studia Logica, 2004

Automata and Fixed Point Logics for Coalgebras.
Electr. Notes Theor. Comput. Sci., 2004

Erdös graphs resolve Fine's canonicity problem.
Bulletin of Symbolic Logic, 2004

2003
Representation of Game Algebras.
Studia Logica, 2003

Atomless varieties.
J. Symb. Log., 2003

Simulating polyadic modal logics by monadic ones.
J. Symb. Log., 2003

Stone Coalgebras.
Electr. Notes Theor. Comput. Sci., 2003

2002
Book review: Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn, The MIT Press, ISBN 0-262-08289-6.
TPLP, 2002

2001
A Survey of Languages for Specifying Dynamics: A Knowledge Engineering Perspective.
IEEE Trans. Knowl. Data Eng., 2001

Undecidable Theories of Lyndon Algebras.
J. Symb. Log., 2001

1999
Points, Lines and Diamonds: A two-sorted Modal Logic for Projective Planes.
J. Log. Comput., 1999

Editorial.
Logic Journal of the IGPL, 1999

1998
Rectangular Games.
J. Symb. Log., 1998

A Modal Logic of Information Change.
Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-98), 1998

Specification of Dynamics for Knowledge-Based Systems.
Proceedings of the Transactions and Change in Logic Databases, 1998

Canonical Pseudo-Correspondence.
Proceedings of the Advances in Modal Logic 2, 1998

1997
Editorial: Modal Logic and Dynamic Semantics.
Journal of Logic, Language and Information, 1997

Axioms for Jonsson's Q-Algebras.
Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997

1996
Tree Models and (Labeled) Categorial Grammar.
Journal of Logic, Language and Information, 1996

Atom Structures.
Proceedings of the Advances in Modal Logic 1, 1996

1995
Meeting strength in substructural logics.
Studia Logica, 1995

Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras.
Studia Logica, 1995

Cylindrical Modal Logic.
J. Symb. Log., 1995

Dynamic squares.
J. Philosophical Logic, 1995

1994
A Modal Logic for Quantification and Substitution.
Logic Journal of the IGPL, 1994

Completeness through Flatness in Two-Dimensional Temporal Logic.
Proceedings of the Temporal Logic, First International Conference, 1994

1993
Derivation Rules as Anti-Axioms in Modal Logic.
J. Symb. Log., 1993

1992
A note on the tense logic of dominoes.
J. Philosophical Logic, 1992

1991
A Modal Logic for Chopping Intervals.
J. Log. Comput., 1991

1990
Expressiveness and Completeness of an Interval Tense Logic.
Notre Dame Journal of Formal Logic, 1990


  Loading...