中文
相关论文

相关论文: Effects of the Strict-Tolerant Approach on Intuiti…

200 篇论文

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

逻辑 · 数学 2024-08-23 Jonte Deakin , Jim de Groot

Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…

逻辑 · 数学 2025-11-11 Gilda Ferreira , Paulo Oliva , Clarence Lewis Protin

This paper undertakes a foundational inquiry into logical inferentialism with particular emphasis on the normative standards it establishes and the implications these pose for classical logic. The central question addressed herein is: 'What…

计算机科学中的逻辑 · 计算机科学 2025-09-29 Khashayar Irani

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

计算机科学中的逻辑 · 计算机科学 2011-01-31 Luís Pinto , Tarmo Uustalu

Strict-Tolerant Logic (ST) underpins naive theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical…

逻辑 · 数学 2026-03-02 Francesco Paoli , Adam Přenosil

In this work, we develop a formal system of inductive logic. It uses an infinitary language that allows for countable conjunctions and disjunctions. It is based on a set of nine syntactic rules of inductive inference, and contains classical…

概率论 · 数学 2025-05-01 Jason Swanson

In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics can be interesting for formal verification purposes.…

计算机科学中的逻辑 · 计算机科学 2023-10-05 Davide Catta , Vadim Malvone , Aniello Murano

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…

人工智能 · 计算机科学 2013-04-11 Peter Haddawy , Alan M. Frisch

This work is a mathematician's attempt to understand intuitionistic logic. It can be read in two ways: as a research paper interspersed with lengthy digressions into rethinking of standard material; or as an elementary (but highly…

逻辑 · 数学 2017-05-02 Sergey A. Melikhov

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

计算机科学中的逻辑 · 计算机科学 2010-06-17 Kaustuv Chaudhuri

We introduce and investigate a family of consequence relations with the goal of capturing certain important patterns of data-driven inference. The inspiring idea for our framework is the fact that data may reject, possibly to some degree,…

逻辑 · 数学 2024-08-23 Paolo Baldi , Esther Anna Corsi , Hykel Hosni

The standard notion of formal theory, in Logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed…

逻辑 · 数学 2019-04-04 Carolina Blasio , Carlos Caleiro , João Marcos

On the one hand, classical logic is an extremely successful theory, even if not being perfect. On the other hand, intuitionistic logic is, without a doubt, one of the most important non-classical logics. But, how can proponents of one logic…

计算机科学中的逻辑 · 计算机科学 2022-04-15 Satoru Niki , Hitoshi Omori

In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…

计算机科学中的逻辑 · 计算机科学 2014-02-20 Julio Lemos

Shortcut reasoning is an irrational process of inference, which degrades the robustness of an NLP model. While a number of previous work has tackled the identification of shortcut reasoning, there are still two major limitations: (i) a…

计算与语言 · 计算机科学 2023-12-18 Daichi Haraguchi , Kiyoaki Shirai , Naoya Inoue , Natthawut Kertkeidkachorn

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

计算机科学中的逻辑 · 计算机科学 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

逻辑 · 数学 2013-12-17 Jesse Alama

This paper investigates logical consequence defined in terms of probability distributions, for a classical propositional language using a standard notion of probability. We examine three distinct probabilistic consequence notions, which we…

逻辑 · 数学 2025-07-04 Paul Égré , Ellie Ripley

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…

逻辑 · 数学 2023-01-31 Takahiro Yamada

Debates concerning philosophical grounds for the validity of classical and intuitionistic logics often have the very nature of logical proofs as one of the main points of controversy. The intuitionist advocates for a strict notion of…

计算机科学中的逻辑 · 计算机科学 2025-04-07 Victor Nascimento , Luiz Carlos Pereira , Elaine Pimentel
‹ 上一页 1 2 3 10 下一页 ›