The taming of recurrences in computability logic through cirquent calculus, Part I
The taming of recurrences in computability logic through cirquent calculus, Part II
The Three Gap Theorem (Steinhauss Conjecture)
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
The Variable Hierarchy for the Games mu-Calculus
The Wadge Hierarchy of Deterministic Tree Languages
The weak pigeonhole principle for function classes in S^1_2
Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability
Theorem proving support in programming language semantics
Theories for TC0 and Other Small Complexity Classes
Theory of Finite or Infinite Trees Revisited
Theory of processes
There Exist some Omega-Powers of Any Borel Rank
Thread algebra for poly-threading
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language
Three qubit entanglement within graphical Z/X-calculus
Ticket Entailment is decidable
Tight Upper Bounds for Streett and Parity Complementation
Time-complexity semantics for feasible affine recursions (extended abstract)
Timed Automata Semantics for Analyzing Creol