Every recursively enumerable extension of a theory of linear order has a constructive model
M. G. Peretyat'kin

This publication is cited in the following articles:

1. A. N. Frolov, “Computable presentability of countable linear orders”, J. Math. Sci. (N. Y.), 256:2 (2021), 199–233