Resumen de Temporal logic of linearly ordered a-spaces
Using the language of temporal logic, we construct a decidable calculus L* ? and prove that the calculus is complete w.r.t. the class of all strictly linearly ordered ?-frames.
Using the language of temporal logic, we construct a decidable calculus L* ? and prove that the calculus is complete w.r.t. the class of all strictly linearly ordered ?-frames.
