arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.1936cs.LO
收藏

两个左序贯逻辑的完备性

Completeness for Two Left-Sequential Logics

D. J. C. Staudt

摘要:

左序贯逻辑提供了一种方法来推理(封闭的)命题项与原子命题,可能有副作用,并从左到右顺序评估。这样的命题术语通常用在程序设计语言中来指导程序的流程。在这篇论文中,我们探讨了两个这样的左序贯逻辑。首先,我们讨论完全求值左序逻辑,它采用完全求值策略,即,为了评估一个项,评估它的每一个原子命题,从而导致其可能的副作用发生。然后,我们转向短路(左序)逻辑,如[BP 10b]所示,其中评估可能是“短路”的,从而防止某些(如果不是全部)被评估的项中的原子命题。我们提出了评估树作为一个自然的语义逻辑,并提供公理化的最小识别的变体。由此,我们定义了一个逻辑与连接词,规定了一个完整的评估策略,以及连接词,规定了短路评估策略。

英文摘要:

Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used in programming languages to direct the flow of a program. In this thesis we explore two such left-sequential logics. First we discuss Fully Evaluated Left-Sequential Logic, which employs a full evaluation strategy, i.e., to evaluate a term every one of its atomic propositions is evaluated causing its possible side effects to occur. We then turn to Short-Circuit (Left-Sequential) Logic as presented in [BP10b], where the evaluation may be 'short-circuited', thus preventing some, if not all, of the atomic propositions in a term being evaluated. We propose evaluation trees as a natural semantics for both logics and provide axiomatizations for the least identifying variant of each. From this, we define a logic with connectives that prescribe a full evaluation strategy as well as connectives that prescribe a short-circuit evaluation strategy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑