Completeness Theorem for a First Order Linear-time Logic
Publications de l'Institut Mathématique, _N_S_69 (2001) no. 83, p. 1
We describe a first order temporal logic over the natural
numbers time. It is well known that the corresponding set of all valid
formulas is not recursively enumerable, and that there is no finitistic
axiomatization. We present an infinitary axiomatization which is sound
and complete with respect to the considered logic.
Classification :
03B44
@article{PIM_2001_N_S_69_83_a0,
author = {Zoran Ognjanovi\'c},
title = {Completeness {Theorem} for a {First} {Order} {Linear-time} {Logic}},
journal = {Publications de l'Institut Math\'ematique},
pages = {1 },
year = {2001},
volume = {_N_S_69},
number = {83},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_2001_N_S_69_83_a0/}
}
Zoran Ognjanović. Completeness Theorem for a First Order Linear-time Logic. Publications de l'Institut Mathématique, _N_S_69 (2001) no. 83, p. 1 . http://geodesic.mathdoc.fr/item/PIM_2001_N_S_69_83_a0/