共 50 条
- [27] GODEL THEOREMS, EXPONENTIAL DIFFICULTY AND UNDECIDABILITY OF ARITHMETIC THEORIES - AN EXPOSITION PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS, 1985, 42 : 503 - 522
- [28] Undecidability of weak bisimulation equivalence for 1-counter processes AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 570 - 583
- [29] Decision problems for membership extension theories BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA, 1999, 2A : 9 - 12