Logics for the Relational Syllogistic
Logics for Unranked Trees: An Overview
Loops under Strategies ... Continued
LoopW Technical Reference v0.3
Lower Bound for the Communication Complexity of the Russian Cards Problem
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Lower Bounds for the Complexity of Monadic Second-Order Logic
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangian Dual to characterize optimality conditions
LTL with the Freeze Quantifier and Register Automata
Ludics with repetitions (Exponentials, Interactive types and Completeness)