|
This article is cited in 1 scientific paper (total in 1 paper)
Theoretical Foundations of Computer Science
Modeling arithmetic in the first-order language enriched with temporal quantifiers
E. A. Kotikovaa, M. N. Rybakovabc a Tver State University
b CJSC Scientific Research Institute Centerprogramsystem
c University of the Witwatersrand, Johannesburg
Abstract:
We investigate the classical first-order language with equality enriched by the modalities of the computational tree logic $\bf CTL^\ast$. As a semantics for it we consider serial Kripke frames with constant domains. We construct an embedding of the truth arithmetics into the set of all formulas that are valid in the class of such frames. Then, we obtain some corollaries concerned algorithmical, syntactical, and semantical properties for a large class of logic in the language.
Keywords:
first-order logic, computational tree logic, recursive enumerability, Kripke semantics.
Received: 29.08.2016 Revised: 07.10.2016
Citation:
E. A. Kotikova, M. N. Rybakov, “Modeling arithmetic in the first-order language enriched with temporal quantifiers”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2016, no. 4, 5–19
Linking options:
https://www.mathnet.ru/eng/vtpmk25 https://www.mathnet.ru/eng/vtpmk/y2016/i4/p5
|
Statistics & downloads: |
Abstract page: | 240 | Full-text PDF : | 201 | References: | 51 |
|