|
Theoretical Foundations of Computer Science
On expressive power of monadic transitive close logic over discrete order
S. M. Dudakov Tver State University, Tver
Abstract:
We establish that the monadic transitive close operator over linear discrete order allows to express addition, multiplication and exponential function up to $H_2(n)$. Here $n$ is formulas length and $H_2(n)$ is the hyperexponential function.
Keywords:
transitive close logic, linerar discrete order, expressive power.
Received: 12.09.2017 Revised: 05.12.2017
Citation:
S. M. Dudakov, “On expressive power of monadic transitive close logic over discrete order”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2017, no. 4, 25–33
Linking options:
https://www.mathnet.ru/eng/vtpmk186 https://www.mathnet.ru/eng/vtpmk/y2017/i4/p25
|
Statistics & downloads: |
Abstract page: | 252 | Full-text PDF : | 145 | References: | 38 |
|