Topological completeness of the provability logic GLP

Author:

Beklemishev Lev,Gabelaia David

Funder

Russian Foundation for Basic Research (RFBR)

Russian Presidential Council for Support of Leading Scientific Schools

Swiss–Russian cooperation project STCP-CH-RU “Computational proof theory”

Shota Rustaveli National Science Foundation

French–Georgian grant CNRS–SRNSF

Publisher

Elsevier BV

Subject

Logic

Reference27 articles.

1. Ordinal completeness of the Gödel–Löb modal system;Abashidze,1985

2. J. Bagaria, Topologies on ordinals and the completeness of polymodal provability logic, 2012, in preparation.

3. J. Bagaria, M. Magidor, H. Sakai, Reflection and indescribability in the constructible universe, 2012, manuscript.

4. Provability algebras and proof-theoretic ordinals, I;Beklemishev;Ann. Pure Appl. Logic,2004

5. Reflection principles and provability algebras in formal arithmetic;Beklemishev;Uspekhi Mat. Nauk,2005

Cited by 17 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Geometric Modal Logic;Notre Dame Journal of Formal Logic;2023-08-01

2. COMPLETENESS OF THE GÖDEL–LÖB PROVABILITY LOGIC FOR THE FILTER SEQUENCE OF NORMAL MEASURES;The Journal of Symbolic Logic;2023-02-23

3. A topological completeness theorem for transfinite provability logic;Archive for Mathematical Logic;2023-02-22

4. MÜNCHHAUSEN PROVABILITY;The Journal of Symbolic Logic;2021-06-10

5. Deducibility and independence in Beklemishev's autonomous provability calculus;Information and Computation;2021-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3