AN APPROACH TO DESIGN OF AUTOMATA-BASED AXIOMATIZATION FOR PROPOSITIONAL PROGRAM AND TEMPORAL LOGICS (BY EXAMPLE OF LINEAR TEMPORAL LOGIC)

Chapters in this book

1. Frontmatter i
2. Preface vii
3. Contents ix
4. The life and work of Victor L. Selivanov 1
5. Tight extensions of T₀-quasi-metric spaces 9
6. On the strongly bounded turing degrees of simple sets 23
7. Levels of discontinuity, limit-computability, and jump operators 79
8. The wadge hierarchy of Petri Nets ω-languages 109
9. Diophantine properties of brownian motion: recursive aspects 139
10. The completeness of isomorphism 157
11. Complexity issues for Preorders on finite labeled forests 165
12. Boolean algebras of regular quasi-aperiodic languages 191
13. A simple indeterminate infinite game 205
14. Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces 213
15. ON THE EQUIVALENCE OF PARACONSISTENT AND EXPLOSIVE VERSIONS OF NELSON LOGIC 259
16. COMPUTING CLEBSCH-GORDAN MATRICES WITH APPLICATIONS IN ELASTICITY THEORY 273
17. AN APPROACH TO DESIGN OF AUTOMATA-BASED AXIOMATIZATION FOR PROPOSITIONAL PROGRAM AND TEMPORAL LOGICS (BY EXAMPLE OF LINEAR TEMPORAL LOGIC) 297
18. PARTIAL NUMBERINGS AND PRECOMPLETENESS 325
19. AN ISOMORPHISM THEOREM FOR PARTIAL NUMBERINGS 341
20. TWO THEOREMS ON THE HAUSDORFF MEASURE OF REGULAR ω-LANGUAGES 383
21. SOME NOTES ON THE UNIVERSALITY OF THREE-ORDERS ON FINITE LABELED POSETS 393
22. INDEX 411