RTL (Recognition Term Language) is the formal syntax interpreted in the sheaf universe of the GFRTU. It is a typed term language whose terms denote objects and morphisms in the sheaf topos Sh(T, J), providing a structured way to refer to and manipulate recognition data.
RTL plays the same role in the GFRTU that the typed lambda calculus and the definable operator algebra Op^def play in the semiotic universe and Interactive Semioverse. It is the syntactic layer that mediates between formal expressions and their semantic interpretations: RTL terms are interpreted as sheaf-theoretic objects, just as Op^def terms are interpreted as semantic endomorphisms of H.
The interpretation of RTL terms is subject to the same discipline as in the semiotic universe: terms must be fragment-preserving, compatible with the Grothendieck topology, and respect the stabilizer and drift dynamics. The generative closure operator UG incorporates RTL-definable constructions when building the least fixed point, ensuring that everything expressible in RTL is included in the universe.