Cs-Lo
On a coalgebraic view on Logic
The size of a formula as a measure of complexity
Implicit complexity for coinductive data: a characterization of corecurrence
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
What is Nature-like Computation? A Behavioural Approach and a Notion of Programmability
Quantified preference logic
Unifying exact completions
A PSPACE-Complete First Order Fragment of Computability Logic
On the Use of Underspecified Data-Type Semantics for Type Safety in Low-Level Code
Things that can be made into themselves
A Locale for Minimal Bad Sequences
Interaction and observation: categorical semantics of reactive systems trough dialgebras
Extending the Interaction Nets Calculus by Generic Rules
Confluence by Decreasing Diagrams -- Formalized
Computational Complexity of Interactive Behaviors
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach
A Modal Characterization of Alternating Approximate Bisimilarity
A Method for Constructing Minimally Unsatisfiable CNFs
Obligation Blackwell Games and p-Automata
A Robust Specification Theory for Modal Event-Clock Automata
ProofPeer - A Cloud-based Interactive Theorem Proving System
