In this paper, we introduce a new fragment of the ΓΏrst-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisΓΏability problem for monodic formulas in various linear time st
Decidable Cases of First-order Temporal Logic with Functions
β Scribed by Walter Hussak
- Publisher
- Springer Netherlands
- Year
- 2008
- Tongue
- English
- Weight
- 234 KB
- Volume
- 88
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is known that even seemingly small fragments of the ΓΏrst-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic (not monadic, where this result does not hold) fragment is an exception by constructing its ΓΏnite Hilbert-style axiomatizat
DECIDABILITY AND DEFINABILITY RESULTS CONCERNING WELL-ORDERINGS AND SOME EXTENSIONS OF FIRST ORDER LOGIC by BOGDAN STANISLAW CHLEBUS in Warsaw (Poland) ## 1. Introdiirtion Let L\* denote a countable extension of the first order language L. I n this paper 1 ) definability of the class of well-order