English
Related papers

Related papers: Contrapositionally Complemented Pseudo-Boolean Alg…

200 papers

It is customary to expect from a logical system that it can be algebraizable, in the sense that an algebraic companion of the deductive machinery can always be found. Since the inception of da Costa's paraconsistent calculi $C_n$, algebraic…

Logic · Mathematics 2021-05-24 Walter Carnielli , Marcelo E. Coniglio , David Fuenmayor

Since the discovery of critical mistakes in Rauszer's work on bi-intuitionistic logics, solid foundations for these have progressively been rebuilt. However, the algebraic treatment of these logics has not yet been tended to. We fill this…

Logic · Mathematics 2025-03-24 Jonte Deakin , Ian Shillito

In their seminal paper Birkhoff and von Neumann revealed the following dilemma: "... whereas for logicians the orthocomplementation properties of negation were the ones least able to withstand a critical analysis, the study of mechanics…

Logic · Mathematics 2007-05-23 Bob Coecke

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

In their seminal paper Artemov and Protopopescu provide Hilbert formal systems, Brower-Heyting-Kolmogorov and Kripke semantics for the logics of intuitionistic belief and knowledge. Subsequently Krupski has proved that the logic of…

Logic · Mathematics 2021-03-08 Guido Fiorino

A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively,…

Logic · Mathematics 2025-01-14 Prosenjit Howlader , Churn-Jung Liau

We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic (CHL), hereby introduced as an example of a strong connexive logic with intuitive semantics. We use the reverse algebraisation paradigm: CHL is presented…

Logic · Mathematics 2022-09-01 Davide Fazio , Antonio Ledda , Francesco Paoli

A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always…

Logic · Mathematics 2020-07-24 Arun Kumar , Mohua Banerjee

In this paper we define two types of implicative derivations on pseudo-BCI algebras, we investigate their properties and we give a characterization of regular implicative derivations of type II. We also define the notion of a $d$-invariant…

Logic · Mathematics 2019-03-22 Lavinia Corina Ciungu

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

Vision-Language Models (VLMs) like CLIP struggle to understand negation, often embedding affirmatives and negatives similarly (e.g., matching "no dog" with dog images). Existing methods refine negation understanding via fine-tuning CLIP's…

Computer Vision and Pattern Recognition · Computer Science 2026-02-25 Junhao Xiao , Zhiyu Wu , Hao Lin , Yi Chen , Yahui Liu , Xiaoran Zhao , Zixu Wang , Zejiang He

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subuintuitionistic…

Logic · Mathematics 2022-11-08 J. L. Castiglioni , V. Fernández , H. F. Mallea , H. J. San Martín

In this paper we derive some basic results of circuit theory using `Implicit Linear Algebra' (ILA). This approach has the advantage of simplicity and generality. Implicit linear algebra is outlined in [1]. We denote the space of all vectors…

Systems and Control · Electrical Eng. & Systems 2020-05-05 H. Narayanan , Hariharan Narayanan

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…

Artificial Intelligence · Computer Science 2022-03-29 Jorge Fandinno , Luis Fariñas del Cerro

In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…

Logic · Mathematics 2023-06-06 Paolo Aglianò

The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the…

Logic · Mathematics 2020-07-13 David Ellerman

Bochvar algebras consist of the quasivariety BCA playing the role of equivalent algebraic semantics for Bochvar (external) logic, a logical formalism introduced by Bochvar in the realm of (weak) Kleene logics. In this paper, we provide an…

Logic · Mathematics 2024-06-05 Stefano Bonzio , Michele Pra Baldi

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

Pre-trained language models (PLMs) have made significant advances in natural language inference (NLI) tasks, however their sensitivity to textual perturbations and dependence on large datasets indicate an over-reliance on shallow…

Machine Learning · Computer Science 2025-02-14 Mingyue Liu , Ryo Ueda , Zhen Wan , Katsumi Inoue , Chris G. Willcocks