摘要翻译：
可计算性逻辑(CL)（见http://www.cis.upenn.edu/~giorgi/CL.html)是一个语义平台和研究程序，用于将逻辑重新开发为可计算性的形式化理论，而不是传统上的真的形式化理论。CL中的公式代表（交互式）计算问题，理解为机器与其环境之间的博弈；逻辑运算符表示对这类实体的操作；而“真理”被理解为一个有效解决方案的存在，即一个算法获胜策略的存在。语言学习的形式主义是开放的，随着学科研究的深入，它可能会经历一系列的扩展。到目前为止，CL关注的主要运算符群是并行运算符、选择运算符、分支运算符和盲运算符。本文介绍了一个新的重要算子群&序贯算子。后者以顺序合取、顺序量词和顺序递归的形式出现。顾名思义，与该组相关联的算法直觉是顺序计算的直觉，而不是与并行操作组相关联的并行计算的直觉：玩游戏的顺序组合意味着以顺序的方式，一个接一个地玩它的组成部分。本文的主要技术成果是对可计算逻辑的命题片段进行了合理而完整的公理化，它的词汇和否定一起包括了所有三种--平行、选择和顺序--合取。本文还将这一结果推广到一阶水平。
---
英文标题：
《Sequential operators in computability logic》
---
作者：
Giorgi Japaridze
---
最新提交年份：
2008
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Logic in Computer Science        计算机科学中的逻辑
分类描述：Covers all aspects of logic in computer science, including finite model theory, logics of programs, modal logic, and program verification. Programming language semantics should have Programming Languages as the primary subject area. Roughly includes material in ACM Subject Classes D.2.4, F.3.1, F.4.0, F.4.1, and F.4.2; some material in F.4.3 (formal languages) may also be appropriate here, although Computational Complexity is typically the more appropriate subject area.
涵盖计算机科学中逻辑的所有方面，包括有限模型理论，程序逻辑，模态逻辑和程序验证。程序设计语言语义学应该把程序设计语言作为主要的学科领域。大致包括ACM学科类D.2.4、F.3.1、F.4.0、F.4.1和F.4.2中的材料；F.4.3（形式语言）中的一些材料在这里也可能是合适的，尽管计算复杂性通常是更合适的主题领域。
--
一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
一级分类：Mathematics        数学
二级分类：Logic        逻辑
分类描述：Logic, set theory, point-set topology, formal mathematics
逻辑，集合论，点集拓扑，形式数学
--

---
英文摘要：
  Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been. Formulas in CL stand for (interactive) computational problems, understood as games between a machine and its environment; logical operators represent operations on such entities; and "truth" is understood as existence of an effective solution, i.e., of an algorithmic winning strategy.   The formalism of CL is open-ended, and may undergo series of extensions as the study of the subject advances. The main groups of operators on which CL has been focused so far are the parallel, choice, branching, and blind operators. The present paper introduces a new important group of operators, called sequential. The latter come in the form of sequential conjunction and disjunction, sequential quantifiers, and sequential recurrences. As the name may suggest, the algorithmic intuitions associated with this group are those of sequential computations, as opposed to the intuitions of parallel computations associated with the parallel group of operations: playing a sequential combination of games means playing its components in a sequential fashion, one after one.   The main technical result of the present paper is a sound and complete axiomatization of the propositional fragment of computability logic whose vocabulary, together with negation, includes all three -- parallel, choice and sequential -- sorts of conjunction and disjunction. An extension of this result to the first-order level is also outlined.
---
PDF链接：
https://arxiv.org/pdf/0712.1345