中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Completeness of Hoare logic with inputs over the standard model
Author: Xu, ZW ; Sui, YF ; Zhang, WH
Keyword: Hoare logic ; Peano arithmetic ; The standard model ; Computation ; Arithmetical definability ; Logical completeness
Source: THEORETICAL COMPUTER SCIENCE
Issued Date: 2016
Volume: 612, Pages:23-28
Indexed Type: SCI
Department: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China. Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing, Peoples R China.
Abstract: Hoare logic for the set of while-programs with the first-order logical language L and the first-order theory T subset of L is denoted by HL(T). Bergstra and Tucker have pointed out that the complete number theory Th(N) is the only extension T of Peano arithmetic PA for which HL(T) is logically complete. The completeness result is not satisfying, since it allows inputs to range over nonstandard models. The aim of this paper is to investigate under what circumstances HL(T) is logically complete when inputs range over the standard model N. PA(+) is defined by adding to PA all the unprovable Pi(1)-sentences that describe the nonterminating computations. It is shown that each computable function in N is uniformly Sigma(1)-definable in all models of PA(+), and that PA(+) is arithmetical. Finally, it is established, based on the reduction from HL(T) to T, that PA(+) is the minimal extension T of PA for which HL(T) is logically complete when inputs range over N. This completeness result has an advantage over Bergstra's and Tucker's one, in that PA(+) is arithmetical while Th(N) is not. (C) 2015 Elsevier B.V. All rights reserved.
English Abstract: Hoare logic for the set of while-programs with the first-order logical language L and the first-order theory T subset of L is denoted by HL(T). Bergstra and Tucker have pointed out that the complete number theory Th(N) is the only extension T of Peano arithmetic PA for which HL(T) is logically complete. The completeness result is not satisfying, since it allows inputs to range over nonstandard models. The aim of this paper is to investigate under what circumstances HL(T) is logically complete when inputs range over the standard model N. PA(+) is defined by adding to PA all the unprovable Pi(1)-sentences that describe the nonterminating computations. It is shown that each computable function in N is uniformly Sigma(1)-definable in all models of PA(+), and that PA(+) is arithmetical. Finally, it is established, based on the reduction from HL(T) to T, that PA(+) is the minimal extension T of PA for which HL(T) is logically complete when inputs range over N. This completeness result has an advantage over Bergstra's and Tucker's one, in that PA(+) is arithmetical while Th(N) is not. (C) 2015 Elsevier B.V. All rights reserved.
Language: 英语
WOS ID: WOS:000369211200002
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17412
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
1-s2.0-S0304397515007239-main.pdf(279KB)----限制开放 联系获取全文

Recommended Citation:
Xu, ZW,Sui, YF,Zhang, WH. Completeness of Hoare logic with inputs over the standard model[J]. THEORETICAL COMPUTER SCIENCE,2016-01-01,612:23-28.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xu, ZW]'s Articles
[Sui, YF]'s Articles
[Zhang, WH]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xu, ZW]‘s Articles
[Sui, YF]‘s Articles
[Zhang, WH]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace