首页/论文/2008.09016

arXiv 2008.090162020-08-20math.LOcs.LO

From Intuitionism to Many-Valued Logics through Kripke Models

Saeed Salehi

备注：: 10 pages, to appear in: Mathematics, Logic, and their Philosophies---Essays in Honor of Mohammad Ardeshir (Springer)
发表信息：: M. Mojtahedi & Sh. Rahman & M.S. Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir, Springer (2021) pp. 339--348
DOI：: 10.1007/978-3-030-53654-1_11

英文摘要：

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Kurt Gödel (1932), and it is proved by Stanisław Jaśkowski (1936) to be a countably many valued logic. In this paper, we provide alternative proofs for these theorems by using models of Saul Kripke (1959). Gödel's proof gave rise to an intermediate propositional logic (between intuitionistic and classical), that is known nowadays as Gödel or the Gödel-Dummet Logic, and is studied by fuzzy logicians as well. We also provide some results on the inter-definablility of propositional connectives in this logic.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Bi-modal Gödel logic over [0,1]-valued Kripke frames

Universidad de los Andes（德洛斯安第斯大学）；Universidad de Buenos Aires（布宜诺斯艾利斯大学）

We consider the Gödel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard Gödel algebra [0,1] and prove strong completeness of Fischer Servi intuitionistic modal logic IK plus the prelinearity axiom with respect to this semantics. We axiomatize also the bi-modal analogues of $T,$ $S4,$ and $S5$ obtained by restricting to models over frames satisfying the [0,1]-valued versions of the structural properties which characterize these logics. As application of the completeness theorems we obtain a represe…

2011-10-11cs.AImath.LO

Completeness results for many-valued \Lukasiewicz modal systems and relational semantics

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding Kripke models and modal many-valued algebras. Completeness results are considered through the construction of a canonical model. Completeness is obtained for modal finitely-valued logics but also for a modal many-valued system with an infinitary deduction rule. We introduce two classes of frames for the finitely-valued logics and show that they define two dis…

2006-12-19math.LO

Undecidability and non-axiomatizability of modal many-valued logics

In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal logics which are undecidable, in contrast with classical modal logic and propositional logics defined over the same classes of algebras. This family includes the global modal logics arising from Kripke frames evaluated over the standard Lukasiewicz and Product algebras. We later refine the previous result, and prove that global modal Lukasiewicz and Product lo…

2022-04-15cs.LOmath.LO

模态剩余逻辑中的集合论类Kripke模型

Kripke-like models of Set Theory in Modal Residuated Logic

本文借助Ono–Komori剩余Kripke模型推广Fitting的直觉主义集合论语义，构建模态剩余逻辑中的von Neumann层级，建立与Heyting值模型的公式翻译，并提出可构造集全域概念。

2024-05-07math.LO

On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice

This paper deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum modal logic), the ones evaluated in the idempotent elements and the ones evaluated in 0 and 1. We show how to expand an axiomatization, with canonical constants in the language, of a finite residuated lattice into one of the modal logic, for each one of the three basic classes of Kripke frames, over the …

2009-10-02math.LO

Simplified Kripke semantics for K45-like Godel modal logics and its axiomatic extensions

FCEyN - UBA（布宜诺斯艾利斯大学理学院与自然科学院）；University of Bern（伯尔尼大学）；IIIA - CSIC（西班牙国家研究委员会人工智能研究所）

In this paper, we provide simplified semantics for the logic K45(G), i.e. the many-valued Godel counterpart of the classical modal logic K45. More precisely, we characterize K45(G) as the set of valid formulae of the class of possibilistic Godel Kripke Frames <W,π> where W is a non-empty set of worlds and π: W \to [0, 1] is a possibility distribution on W.

2021-05-13cs.AImath.LO

更多相关论文收起更多论文

Wright's Strict Finitistic Logic in the Classical Metatheory: The Propositional Case

Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in his strict finitistic metatheory, of equations between numerals on which concrete arithmetical sentences are evaluated. As a first step towards classical formalisation of strict finitism, we propose their counterparts in the classical metatheory with one additional assumption, and then extract the propositional part of `strict finitistic logic' from it and …

2023-01-28math.LO

Towards a Proof Theory of Gödel Modal Logics

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of Gödel logic. The calculi are used to establish completeness and complexity results for these fragments.

2011-05-14cs.LOmath.LO

Approximating Propositional Calculi by Finite-valued Logics

Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few tautologies as possible, but which has all the valid formulas of the given logic as tautologies. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of finite-valued logics. It is shown that the best candidate matrices for (1) can be computed from a calculus, and how sequences for (2) can be found for certain classes of …

2002-03-19math.LO

常规非正常模态经典性

Regular non-normal modal classicalities

本文提出了一种基于一致性算子的四值布尔逻辑B_4^∘，并扩展其到模态逻辑中，揭示了非正常全局推理关系及新的可及性类型。

2026-02-23math.LO

本质模态与偶然模态遇见贝尔纳普真值

Essence and accident modalities meet Belnapian truth values

University of Lodz（罗兹大学）

本文在贝尔纳普-邓恩四值逻辑FDE上推广本质与偶然模态，定义本质/偶然真、假、不一致和不确定模态，给出四值S5克里普克语义及无切超相继式演算，并证明嵌入定理，获得可靠、完全和切消除结果。

2026-10-07cs.LOmath.LO

Wright 的严格有穷主义一阶逻辑

Wright's First-Order Logic of Strict Finitism

本文将 Yamada 对 Wright 严格有穷主义逻辑的经典命题重构扩展为一阶逻辑，给出可靠完备的 Kripke 式语义和自然演绎系统，并说明其与既有结果的关系。

2024-08-12math.LO

A note on public announcements in standard Gödel modal logic

We study public announcement operators in the context of standard Gödel modal logic as introduced by Caicedo and Rodriguez. Over that base logic, admitting a natural semantics over [0,1]-valued generalizations of modal Kripke models, we exhibit three possible semantic interpretations of the public announcement operator, all equivalent in a classical setting, and show that these logics are all different in terms of expressive strength. We provide partial completeness results for these logics via Hilbert-style calculi.

2021-12-13math.LO

Paraconsistent Gödel modal logic on bi-relational frames

We further develop the paraconsistent Gödel modal logic. In this paper, we consider its version endowed with Kripke semantics on $[0,1]$-valued frames with two fuzzy relations $R^+$ and $R^-$ (degrees of trust in assertions and denials) and two valuations $v_1$ and $v_2$ (support of truth and support of falsity) linked with a De Morgan negation $\neg$. We demonstrate that it \emph{does not} extend Gödel modal logic and that $\Box$ and $\lozenge$ are not interdefinable. We also show that several important classes of frames are $\birelKGsquare$ definable (in particular, crisp, mono-relational, a…

2023-03-24cs.LOmath.LO

直觉主义命题逻辑的相继式式表列

Sequent-style tableaux for intuitionistic propositional logic

University of Calabria（卡拉布里亚大学）

本文提出用于直觉主义命题逻辑的块演算$\boldsymbol{B}_{ti}$，证明其为多后件相继式演算$\boldsymbol{G}_{ti}$的倒置形式，且相对于克里普克语义可靠完备，具有有限模型性质与析取性质的块理论证明。

2026-08-24math.LO

论 Belnap-Dunn 四值逻辑与 Nelson 弗协调逻辑 N4 的泛自由一阶扩张

On Universally Free First-Order Extensions of Belnap-Dunn's Four-Valued Logic and Nelson's Paraconsistent Logic N4

本文提出 Belnap-Dunn 四值逻辑和 Nelson 弗协调逻辑 QN4 的泛自由一阶扩张 FFDE 和 FN4，通过引入 Kripke 风格变域语义、空域和空名，更好地表示了数据库中不一致与不完备信息随时间的动态发展。

2024-12-27math.LO

力迫的内部模态逻辑

The Internal Modal Logic of Forcing

该研究通过为模态公式构建内部克里普克语义，将模态集合论与布尔值模型相连，计算模态有效性并分析特殊代数行为，最终证明在特定语义下正规逻辑$\KTB$是相关模型中有效模态公式集。

2026-07-29math.LO

表格用于知识 Gödel 逻辑

Tableaux for epistemic Gödel logic

本文提出了一种多智能体知识 Gödel 逻辑，利用表格计算方法解决有效性问题，证明其在不同智能体数量下的复杂性为 PSpace 或 coNP 完全。

2025-10-06math.LO

Intuitionistic logic with two Galois connections combined with Fischer Servi axioms

Earlier, the authors introduced the logic IntGC, which is an extension of intuitionistic propositional logic by two rules of inference mimicking the performance of Galois connections (Logic J. of the IGPL, 18:837-858, 2010). In this paper, the extensions Int2GC and Int2GC+FS of IntGC are studied. Int2GC can be seen as a fusion of two IntGC logics, and Int2GC+FS is obtained from Int2GC by adding instances of duality-like connections $\Diamond(A \to\ B) \to (\Box A \to \Diamond B)$ and $(\Diamond A \to \Box B) \to \Box(A \to B)$, introduced by G. Fischer Servi (Rend. Sem. Mat. Univers. Politecn.…

2012-08-14math.LO

哥德尔模态逻辑两种扩张的简单表系统

Simple tableaux for two expansions of Gödel modal logic

本文研究哥德尔模态逻辑的两种扩张KG_inv与KG_bl，通过采用具有限模型性质的替代语义，构建可显式构造反模型的统一表演算与判定算法，证明二者的可满足性与有效性问题为PSpace完全。

2024-01-27math.LO