Tight Upper Bounds for Streett and Parity Complementation

Time-complexity semantics for feasible affine recursions (extended abstract)

Timed Automata Semantics for Analyzing Creol

Timed Automata Semantics for Visual e-Contracts

Timed Parity Games: Complexity and Robustness

Timed Parity Games: Complexity and Robustness

To Preference via Entrenchment

Toggling operators in computability logic

Topological Complexity of Context-Free omega-Languages: A Survey

Topological Complexity of omega-Powers : Extended Abstract

Topological Logics with Connectedness over Euclidean Spaces

Topological Observations on Multiplicative Additive Linear Logic

Topology and Ambiguity in Omega Context Free Languages

Toward the Verification of a Simple Hypervisor

Towards a Coalgebraic Interpretation of Propositional Dynamic Logic

Towards a formalization of budgets

Towards a Mathematical Theory of the Delays of the Asynchronous Circuits

Towards an efficient prover for the C1 paraconsistent logic

Towards an embedding of Graph Transformation in Intuitionistic Linear Logic

Towards applied theories based on computability logic