Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps forms a simple distributive involutive residuated lattice -- called the time warp algebra -- that is equipped with residual operations relevant to potential applications. In this paper, we show that although the time warp algebra generates a variety that lacks the finite model property, it nevertheless has a decidable equational theory. We also describe an implementation of a procedure for deciding equations in this algebra, written in the OCaml programming language, that makes use of the Z3 theorem prover.

翻译：关于离散时间尺度 $\omega^+$ 上的保并映射（称为时间扭曲）已被提出作为分级模态，可用于量化程序执行过程中信息的增长。时间扭曲的集合构成一个简单的分配对合剩余格——称为时间扭曲代数——该代数配备了与潜在应用相关的剩余运算。本文证明，尽管时间扭曲代数生成的簇缺乏有限模型性质，但其等式理论仍是可判定的。我们同时描述了一个用OCaml编程语言编写的判定该代数中等式的实现过程，该过程利用了Z3定理证明器。