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

一种奇特的对话逻辑及其构成问题

A curious dialogical logic and its composition problem

Jesse Alama, Sara Uckelman

摘要:

对话游戏是两个玩家之间的逻辑游戏,一个提出逻辑公式A有效或正确的提议者和一个对此提出异议的反对者。对话方法的一个优点是,它是一个统一的框架,通过对基本规则的微小变化,可以获得不同的逻辑。我们引入了对话游戏的合成问题,作为解决的问题,对于一组S的对话游戏的规则,是否S-对话有效的公式集是封闭下的肯定前件。解决组合问题是对话式逻辑方法的基础;尽管它很简单,但它往往需要借助重要的逻辑机制(如切消)的间接解决方案。我们给出一组对话规则N,它非常接近于一组已知的描述经典命题逻辑的规则,并且从对话的观点来看,它显然是合理的,但是它的一组对话有效的公式是非常特殊的(和非平凡的)。尽管它的特殊性,N的合成问题可以直接解决。

英文摘要:

Dialogue games are two-player logic games between a Proponent who puts forward a logical formula A as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which different logics can be obtained through only small variations of the basic rules. We introduce the composition problem for dialogue games as the problem of resolving, for a set S of rules for dialogue games, whether the set of S-dialogically valid formulas is closed under modus ponens. Solving the composition problem is fundamental for the dialogical approach to logic; despite its simplicity, it often requires an indirect solution with the help of significant logical machinery such as cut-elimination. We give a set N of dialogue rules that is quite close to a set of rules known to characterize classical propositional logic, and which is evidently well-justified from the dialogical point of view, but whose set of dialogically valid formulas is quite peculiar (and non-trivial). Its peculiarity notwithstanding, the composition problem for N can be solved directly.

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

↑