摘要
本文的工作主要分为两部分.首先,我们把验证punlessq是否是UNITY逻辑的定理转化为一阶定理的验证.其次,设p1unlessq1,…,pnunlessqn在一UNITY程序F中成立.我们把验证punlesq在F中成立是否可由以上n个性质得出转化为强推出的验证,其中强推出是本文引进的新概念.
The first goal of this paper is to reduce the provability problem of “unless” formulas in UNITY logic to the propositional provability problem. The Second is to reduce the problem determining if satisfiability of a “unless” property in a UNITY program can be derived from that of othe “unless” properties to the strong provability problem in propositional logic. Where the notion of strong provability is a mew notion introduced in this paper.
出处
《河南师范大学学报(自然科学版)》
CAS
CSCD
1998年第1期1-9,共9页
Journal of Henan Normal University(Natural Science Edition)
基金
国家自然科学基金