COMPLETENESS VIA COMPLETENESS: SINCE AND UNTIL
暂无分享,去创建一个
In this paper we give finite axiomatizations of the set of all valid formulas in the formalism with S and U , for the class of the well-ordered flows of time and for the frame consisting of the natural numbers. These axiom systems are orthodox in the sense that they only use the standard derivation rules of Modus Ponens, Temporal Generalization and Substitution. An essential use is made of the fact that the language with S and U is expressively complete over the frames involved.
[1] Dov M. Gabbay,et al. An Axiomitization of the Temporal Logic with Until and Since over the Real Numbers , 1990, J. Log. Comput..
[2] Kees Doets. Monadic Π 1 1 -Theories of Π 1 1 -Properties. , 1989 .
[3] Johan Anthory Willem Kamp,et al. Tense logic and the theory of linear order , 1968 .