Journal of symbolic computation. 1992;14(5):437-457. doi: 10.1016/0747-7171(92)90016-w Q21.12025
A new method for undecidability proofs of first order theories
DOI: 10.1016/0747-7171(92)90016-w
摘要 查看摘要
Journal of symbolic computation. 1992;14(5):437-457. doi: 10.1016/0747-7171(92)90016-w Q21.12025
DOI: 10.1016/0747-7171(92)90016-w
摘要 查看摘要