A typed logic of partial functions reconstructed classically
A typed logic of partial functions reconstructed classically
复制标题
经典重构的部分函数的类型化逻辑
DOI：
10.1007/bf01178666
复制
发表时间：
1993
期刊：
影响因子：
0.6
通讯作者：
K. Middelburg
中科院分区：
文献类型：
--
作者：
Cliff B. Jones;K. Middelburg
本文对称为LPF的逻辑的打字版本进行了全面描述。该逻辑是正式规范和软件开发方法VDM中的验证设计的基础。如果适当扩展以处理递归定义的功能，VDM中使用的数据类型等，它给出了VDM符号及其相关的推理规则。本文概述了所需的扩展名，并详细介绍了其中一些。它显示了如何通过嵌入经典的无限逻辑中经典地重建这种非经典逻辑和扩展-can。
This paper gives a comprehensive description of a typed version of the logic known as LPF. This logic is basic to formal specification and verified design in the software development method VDM. If appropriately extended to deal with recursively defined functions, the data types used in VDM, etc., it gives the VDM notation and its associated rules of reasoning. The paper provides an overview of the needed extensions and examines some of them in detail. It is shown how this nonclassical logic-and the extensions-can be reconstructed classically by embeddings into classical infinitary logic.