Deliverable 1 : Topological foundations of the Stone-Priestley duality for recognizable languages
Deliverable 2 : Algebraic classification of recognizable tree languages
Deliverable 3 : Quantitative extensions of LTL over words
Deliverable 4 : Recognizability for lambda-terms
Deliverable 5 : Structural properties of trees and expressivity of logical formalisms
Deliverable 6 : Cost automata over words: algorithms and logical formalisms
Deliverable 7 : Operations on lattices of recognizable languages and identities
Deliverable 8 : Algebraic classifications of recognizable sets of lambda-terms
Deliverable 9 : Evaluation and algebraic recognizability
Deliverable 10 : Structural theory of stabilization monoids
Deliverable 11 : Explicit examples of identity characterizations
Deliverable 12 : Stone duality in semantics vs. Stone duality in variety theory
Deliverable 13 : Proceedings of the final conference of the FREC project