Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)

Q4 Mathematics 信息与控制 Pub Date : 1985-05-01 DOI:10.1016/S0019-9958(85)80002-4
A.J. Kfoury
{"title":"Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)","authors":"A.J. Kfoury","doi":"10.1016/S0019-9958(85)80002-4","DOIUrl":null,"url":null,"abstract":"<div><p>We make explicit a connection between the “unwind property” and first-order logics of programs. Using known results on the unwind property, we can then quickly compare various logics of programs. In Section 1, we give a sample of these comparative results, which are already known but established differently in this paper. In Sections 2 and 3, given an arbitrary deterministic regular program <em>S</em> (with or without parameterless recursive calls), we show how to construct a first-order structure where <em>S</em> will unwind. Based on this construction, we then prove that the logic of regular programs (with or without parameterless recursive calls) is more expressive than the logic of deterministic regular programs (with or without parameterless recursive calls, respectively).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 98-121"},"PeriodicalIF":0.0000,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80002-4","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 11

Abstract

We make explicit a connection between the “unwind property” and first-order logics of programs. Using known results on the unwind property, we can then quickly compare various logics of programs. In Section 1, we give a sample of these comparative results, which are already known but established differently in this paper. In Sections 2 and 3, given an arbitrary deterministic regular program S (with or without parameterless recursive calls), we show how to construct a first-order structure where S will unwind. Based on this construction, we then prove that the logic of regular programs (with or without parameterless recursive calls) is more expressive than the logic of deterministic regular programs (with or without parameterless recursive calls, respectively).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
确定性和非确定性程序的可定义性(应用于一阶动态逻辑)
我们明确地将“unwind属性”与程序的一阶逻辑联系起来。使用unwind属性上的已知结果,我们可以快速比较程序的各种逻辑。在第1节中,我们给出了这些比较结果的一个样本,这些结果是已知的,但在本文中建立的不同。在第2节和第3节中,给定一个任意的确定性正则程序S(有或没有无参数递归调用),我们将展示如何构造一个一阶结构,其中S将展开。基于这种构造,我们证明了常规程序的逻辑(有或没有无参数递归调用)比确定性常规程序的逻辑(分别有或没有无参数递归调用)更具表现力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
期刊最新文献
Systolic trellis automata: Stability, decidability and complexity On relativized exponential and probabilistic complexity classes A note on succinct representations of graphs Function definitions in term rewriting and applicative programming Simulation of large networks on smaller networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1