Journal of automated reasoning. 1985;1(4):391-405. doi: 10.1007/bf00244277 Q40.72025
Circumscription and implicit definability
限定与隐式可定义性
DOI: 10.1007/bf00244277
摘要 查看摘要
Journal of automated reasoning. 1985;1(4):391-405. doi: 10.1007/bf00244277 Q40.72025
DOI: 10.1007/bf00244277
摘要 查看摘要