混合逻辑的解析非标记证明系统:概述和几个惊人的事实

Q2 Arts and Humanities

Bulletin of the Section of Logic Pub Date : 2022-01-07 DOI:10.18778/0138-0680.2022.02

T. Braüner

{"title":"混合逻辑的解析非标记证明系统:概述和几个惊人的事实","authors":"T. Braüner","doi":"10.18778/0138-0680.2022.02","DOIUrl":null,"url":null,"abstract":"This paper is about non-labelled proof-systems for hybrid logic, that is, proof-systems where arbitrary formulas can occur, not just satisfaction statements. We give an overview of such proof-systems, focusing on analytic systems: Natural deduction systems, Gentzen sequent systems and tableau systems. We point out major results and we discuss a couple of striking facts, in particular that non-labelled hybrid-logical natural deduction systems are analytic, but this is not proved in the usual way via step-by-step normalization of derivations.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts\",\"authors\":\"T. Braüner\",\"doi\":\"10.18778/0138-0680.2022.02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is about non-labelled proof-systems for hybrid logic, that is, proof-systems where arbitrary formulas can occur, not just satisfaction statements. We give an overview of such proof-systems, focusing on analytic systems: Natural deduction systems, Gentzen sequent systems and tableau systems. We point out major results and we discuss a couple of striking facts, in particular that non-labelled hybrid-logical natural deduction systems are analytic, but this is not proved in the usual way via step-by-step normalization of derivations.\",\"PeriodicalId\":38667,\"journal\":{\"name\":\"Bulletin of the Section of Logic\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Section of Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18778/0138-0680.2022.02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Section of Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18778/0138-0680.2022.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Arts and Humanities","Score":null,"Total":0}

引用次数: 0

摘要

本文是关于混合逻辑的无标记证明系统，即可以出现任意公式的证明系统，而不仅仅是满足性陈述。我们对这类证明系统进行了概述，重点介绍了分析系统：自然演绎系统、根岑序系统和表系统。我们指出了主要的结果，并讨论了几个引人注目的事实，特别是未标记的混合逻辑自然演绎系统是解析的，但这并不是通过导数的逐步规范化以通常的方式证明的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts

This paper is about non-labelled proof-systems for hybrid logic, that is, proof-systems where arbitrary formulas can occur, not just satisfaction statements. We give an overview of such proof-systems, focusing on analytic systems: Natural deduction systems, Gentzen sequent systems and tableau systems. We point out major results and we discuss a couple of striking facts, in particular that non-labelled hybrid-logical natural deduction systems are analytic, but this is not proved in the usual way via step-by-step normalization of derivations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Bulletin of the Section of Logic Arts and Humanities-Philosophy

CiteScore

0.90

自引率

0.00%

发文量

审稿时长

8 weeks