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
β¦ LIBER β¦
Arithmetical axiomatization of first-order temporal logic
β Scribed by Andrzej Szalas
- Book ID
- 113163000
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 332 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Axiomatizing the monodic fragment of fir
β
Frank Wolter; Michael Zakharyaschev
π
Article
π
2002
π
Elsevier Science
π
English
β 141 KB
An arithmetical view to first-order logi
β
Seyed Mohammad Bagheri; Bruno Poizat; Massoud Pourmahdian
π
Article
π
2010
π
Elsevier Science
π
English
β 630 KB
Axiomatizing first-order consequences in
β
Kontinen, Juha; VÀÀnÀnen, Jouko
π
Article
π
2013
π
Elsevier Science
π
English
β 315 KB
The first axiomatization of relevant log
β
Kosta DoΕ‘en
π
Article
π
1992
π
Springer Netherlands
π
English
β 848 KB
Decidable fragments of first-order tempo
β
Ian Hodkinson; Frank Wolter; Michael Zakharyaschev
π
Article
π
2000
π
Elsevier Science
π
English
β 342 KB
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
Equality and Monodic First-Order Tempora
β
Anatoli Degtyarev; Michael Fisher; Alexei Lisitsa
π
Article
π
2002
π
Springer Netherlands
π
English
β 516 KB