enumerating proofs of positive formulae
文献类型：期刊论文
| 作者 | Dowek Gilles ; Jiang Ying |
| 刊名 | COMPUTER JOURNAL
 |
| 出版日期 | 2009 |
| 卷号 | 52期号:7页码:799-807 |
| 关键词 | positive formulae enumerating proofs minimal predicate logic |
| ISSN号 | 0010-4620 |
| 学科主题 | Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering |
| 收录类别 | SCI,EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000271903900006 |
| 公开日期 | 2011-03-18 |
| 附注 | We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This method is complete in the sense that each normal proof-term of the formula is produced by some scheme generated by the grammar. As a corollary, we get a similar description of the set of normal proofs of positive formulae for a large class of theories including simple type theory and System F. |
| 源URL | [http://124.16.136.157/handle/311060/7956]  |
| 专题 | 软件研究所_软件所图书馆_2009年期刊/会议论文 |
| 推荐引用方式 GB/T 7714 | Dowek Gilles,Jiang Ying. enumerating proofs of positive formulae[J]. COMPUTER JOURNAL,2009,52(7):799-807. |
| APA | Dowek Gilles,&Jiang Ying.(2009).enumerating proofs of positive formulae.COMPUTER JOURNAL,52(7),799-807. |
| MLA | Dowek Gilles,et al."enumerating proofs of positive formulae".COMPUTER JOURNAL 52.7(2009):799-807. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。