6 papers
How a computer might think
Sankha S. Basu
Inspired by Nuel Belnap's "How a computer should think," which gave rise to the four-valued logic FDE, we contemplate, in this article, how a computer might think if we add a fifth…
Generalized Explosion Principles: A Semantic Perspective
Sankha S. Basu, Sayantan Roy
This article is motivated by the fact that there is a distinction between the descriptions of logical explosion from syntactic and semantic points of view. The discussion is illust…
Suszko's Thesis and Many-valued Logical Structures
Sayantan Roy, Sankha S. Basu, Mihir K. Chakraborty
In this article, we try to formulate a definition of ''many-valued logical structure''. For this, we embark on a deeper study of Suszko's Thesis () and show that the t…
Topological semantics for a non-self-extensional LFI
Esha Jain, Sankha S. Basu
In this article, we have introduced a Logic of Formal Inconsistency (LFI) that we call $\vd$. This logic is non-self-extensional, i.e., the replacement property, or the rule for su…
Paracomplete Probabilities
Sankha S. Basu, Esha Jain
This paper presents an advance in the direction of working with probabilities in a paracomplete setting using Logics of Formal Undeterminedness (LFUs). The undeterminedness is inte…
Abstract Model Structures and Compactness Theorems
Sayantan Roy, Sankha S. Basu, Mihir K. Chakraborty
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and v…