首页> 外文会议>International Workshop on Logic, Language, Information and Computation >Reflection Algebras for Theories of Iterated Truth Definitions
【24h】

Reflection Algebras for Theories of Iterated Truth Definitions

机译:迭代真理定义理论的反射代数

获取原文

摘要

We consider extensions of the language of Peano arithmetic by iterated truth definitions satisfying uniform Tarskian biconditionals. Given a first-order language L containing that of arithmetic one can add a new symbol T for a truth predicate and postulate the equivalence of each formula φ(x) of L with T(~┌φ(x)~┐) where ~┌φ(x)~┐ denotes the Goedel number of the result of substituting numeral for x into φ. This extension procedure can be repeated transfinitely many times. Without further axioms, such theories are known to be weak conservative extensions of the original system of arithmetic. Much stronger systems, however, are obtained by adding either induction axioms or reflection axioms on top of them. Theories of this kind can interpret some well-known predicatively reducible fragments of second-order arithmetic such as iterated arithmetical comprehension. Feferman and Schuette studied related systems of ramified analysis. They used their systems to explicate the intuitive idea of a predicative proof and determined the ordinal Γ_0 as the bound to transfinite induction provable in predicative systems. We obtain sharp results on the proof-theoretic strength of these systems using methods of provability logic, in particular, we calculate their proof-theoretic ordinals and conservativity spectra. We consider the semilattice of axiomatizable extensions of a basic theory of iterated truth definitions. We enrich the structure of this semilattice by suitable reflection operators and isolate the corresponding strictly positive modal logic (reflection calculus) axiomatizing the identities of this structure. The variable-free fragment of the logic provides a canonical ordinal notation system for the class of theories under investigation. This setup allows us to obtain in a technically smooth way conservativity relationships for iterated reflection principles of various strength which provide a sharp proof-theoretic analysis of our systems. Joint work with F. Pakhomov and E. Kolmakov. This work is supported by a grant of the Russian Science Foundation (project No. 16-11-10252).
机译:我们考虑通过满足统一Tarskian双条件的迭代真值定义来扩展Peano算术语言。给定包含算术语言的一阶语言L,可以为真谓词添加新符号T,并假设L的每个公式φ(x)的等价性为T(〜┌φ(x)〜┐),其中〜┌ φ(x)〜┐表示将x代入φ的结果的Goedel数。此扩展过程可以无限次重复多次。没有进一步的公理,已知这些理论是原始算术系统的弱保守扩展。但是,通过在它们之上添加感应公理或反射公理可以获得更强大的系统。这种理论可以解释一些众所周知的可预测的二阶算术片段,例如迭代算术理解。 Feferman和Schuette研究了相关的分枝分析系统。他们使用他们的系统来阐明谓词证明的直观思想,并确定序数Γ_0是在谓词系统中可证明的超限归纳的范围。我们使用可证明性逻辑方法在这些系统的证明理论强度上获得了尖锐的结果,特别是,我们计算了它们的证明理论序数和保守性谱。我们考虑迭代真相定义的基本理论的可公理化扩展的半格。我们通过适当的反射算子来丰富该半晶格的结构,并隔离出相应的严格正模态逻辑(反射演算),以公之于众。逻辑的无变量片段为正在研究的一类理论提供了规范的序数符号系统。这种设置使我们能够以技术上平滑的方式获得各种强度的迭代反射原理的保守性关系,从而为我们的系统提供了清晰的证明理论分析。与F. Pakhomov和E. Kolmakov的合作。这项工作得到了俄罗斯科学基金会的资助(项目编号16-11-10252)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号