Finite Tree-Countermodels via Refutation Systems in Extensions of Positive Logic with Strong Negation

IF 0.4 2区数学 Q4 LOGIC Logica Universalis Pub Date : 2023-09-14 DOI:10.1007/s11787-023-00338-8

Tomasz Skura

引用次数: 0

Abstract

Abstract A sufficient condition for an extension of positive logic with strong negation to be characterized by a class of finite trees is given.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

具有强否定的肯定逻辑扩展中的有限树反模型

摘要给出了具有强否定的正逻辑的扩展被一类有限树所表征的一个充分条件。

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

求助全文

约1分钟内获得全文去求助

来源期刊

Logica Universalis Mathematics-Logic

CiteScore

1.30

自引率

12.50%

发文量

期刊介绍： Logica Universalis (LU) publishes peer-reviewed research papers related to universal features of logics. Topics include general tools and techniques for studying already existing logics and building new ones, the study of classes of logics, the scope of validity and the domain of application of fundamental theorems, and also philosophical and historical aspects of general concepts of logic.

期刊最新文献

Dynamic Oppositional Symmetries for Color, Jungian and Kantian Categories The Internal Logic and Finite Colimits Morphisms Between Aristotelian Diagrams Preface to the Rejection Special Issue Operator Counterparts of Types of Reasoning