English
Related papers

Related papers: Filter-induced entailment relations in paraconsist…

200 papers

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…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

We introduce relational semantics for "flat Heyting-Lewis logic" $\mathsf{HLC}^{\flat}$. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart…

Logic · Mathematics 2026-03-31 Jim de Groot , Tadeusz Litak

If a $p$-adic Galois representation $\rho_{f,\nu}:\Gamma_{\mathbb Q} \to \GL_2(E_{f,\nu})$ attached to some eigenform $f$ is residually reducible it will have 2 non-isomorphic reductions, which have the same semi-simplification. In this…

Number Theory · Mathematics 2025-06-17 Stefan Nikoloski

We present two deductively equivalent calculi for non-deterministic many-valued logics. One is defined by axioms and the other - by rules of inference. The two calculi are obtained from the truth tables of the logic under consideration in a…

Logic in Computer Science · Computer Science 2023-06-22 Michael Kaminski

We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…

Logic · Mathematics 2021-09-07 Nicholas Pischke

This paper treats logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is constructed for negations so…

Logic in Computer Science · Computer Science 2007-05-23 Susumu Yamasaki

Let $\mathcal{PL}({\sf T},{\sf T}')$ and $\mathcal{PL}_{\Sigma_1}({\sf T},{\sf T}')$ respectively indicates the provability logic and $\Sigma_1$-provability logic of ${\sf T}$ relative in ${\sf T}'$. In this paper we characterize the…

Logic · Mathematics 2019-11-12 Mojtaba Mojtahedi

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

Logic in Computer Science · Computer Science 2015-07-01 Luc Segoufin , Balder ten Cate

In this paper, we introduce a novel approach to deductive databases meant to take into account the needs of current applications in the area of data integration. To this end, we extend the formalism of standard deductive databases to the…

Databases · Computer Science 2021-08-06 Dominique Laurent , Nicolas Spyratos

How to study a nice function on the real line? The physically motivated Fourier theory technique of harmonic analysis is to expand the function in the basis of exponentials and study the meaningful terms in the expansion. Now, suppose the…

Representation Theory · Mathematics 2021-05-25 Shamgar Gurevich , Roger Howe

We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We…

Computational Complexity · Computer Science 2014-02-28 Nadia Creignou , Uwe Egly , Johannes Schmidt

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

This paper studies relative unification and admissibility in the intuitionistic logic. We generalize results of [Ghilardi, 1999; Iemhoff, 2001a] and prove them relative in NNIL(par) propositions, the class of propositions with No Nested…

Logic · Mathematics 2025-10-07 Mojtaba Mojtahedi

Uncovering rationales behind predictions of graph neural networks (GNNs) has received increasing attention over recent years. Instance-level GNN explanation aims to discover critical input elements, like nodes or edges, that the target GNN…

Machine Learning · Computer Science 2023-09-06 Tianxiang Zhao , Dongsheng Luo , Xiang Zhang , Suhang Wang

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

Logic · Mathematics 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

Logic · Mathematics 2020-08-13 Balthasar Grabmayr

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

This paper grew as a continuation of [Sh462] but in the present form it can serve as a motivation for it as well. We deal with the same notions, and use just one simple lemma from there. Originally entangledness was introduced in order to…

Logic · Mathematics 2016-09-07 Ofer Shafir , Saharon Shelah

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to 'recover' the properties of classical…

Logic in Computer Science · Computer Science 2023-07-25 David Fuenmayor