| Abstract | .... 2 | |
| Contents | .... 2 | |
| 1 | Introduction | .... 3 |
| 2 | Preliminaries | .... 4 |
| 2.1 | PTL | .... 4 |
| 2.2 | QFTL | .... 5 |
| 2.3 | Provability and Consistency | .... 5 |
| 2.4 | Satisfiability and Validity | .... 6 |
| 3 | PTL and w-Graph | .... 7 |
| 3.1 | Decomposotion Rule | .... 7 |
| 3.2 | w-graph | .... 8 |
| 3.3 | Fundamental Theorem | .... 8 |
| 3.4 | w-automata | .... 9 |
| 3.5 | Canonical Modlel | .... 10 |
| 3.6 | Completeness | .... 11 |
| 3.7 | PTL and w-regular Language | .... 12 |
| 4 | QFTL | .... 13 |
| 4.1 | QFTL and w-graphs | .... 13 |
| 4.2 | w-graphs Refutation | .... 13 |
| 4.3 | Turing Machine | .... 14 |
| 4.4 | Simulation of the Behavior of TM in QFTL | .... 14 |
| 4.5 | Incompleteness of QFTL | .... 15 |
| 5 | Concluding Remarks | .... 17 |
| 5.1 | Conclusion | .... 17 |
| 5.2 | Additional discussion | .... 17 |
| Acknowledgment | .... 18 | |
| References | .... 19 | |
| End | .... 21 |
ICOT研究論文(TR)一覧に戻る / Back to the list of ICOT Technical Reports