Search
Search Results
-
De Finettian Logics of Indicative Conditionals Part II: Proof Theory and Algebraic Semantics
In Part I of this paper, we identified and compared various schemes for trivalent truth conditions for indicative conditionals, most notably the...
-
On Finch’s Conditions for the Completion of Orthomodular Posets
In this paper, we aim at highlighting the significance of the A - and B -properties introduced by Finch (Bull Aust Math Soc 2:57–62, 1970b). These...
-
Quasi-Nelson; Or, Non-involutive Nelson Algebras
We introduce a generalisation of Nelson algebras having a not necessarily involutive negation. We suggest dubbing this class quasi-Nelson algebras,...
-
Structure in Machine Learning
I give some examples of instances of ideas from semantics being useful in machine learning.
-
A Modal View on Resource-Bounded Propositional Logics
Classical propositional logic plays a prominent role in industrial applications, and yet the complexity of this logic is presumed to be non-feasible....
-
Nelson Conuclei and Nuclei: The Twist Construction Beyond Involutivity
Recent work by Busaniche, Galatos and Marcos introduced a very general twist construction, based on the notion of conucleus , which subsumes most...
-
Derivability and Metainferential Validity
The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive...
-
The Limits of Computation
This article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued...
-
The Strict/Tolerant Idea and Bilattices
Strict/tolerant logic is a formally defined logic that has the same consequence relation as classical logic, though it differs from classical logic...
-
Signed Dual Tableaux for Kleene Answer Set Programs
Dual tableaux were introduced by Rasiowa and Sikorski (1960) as a cut free deduction system for classical first-order logic. In the current paper, a...
-
Is the HYPE about strength warranted?
In comparing classical and non-classical solutions to the semantic paradoxes arguments relying on strength have been influential. In this paper I...
-
Extensions of Lambek Calculi
The Lambek calculus (associative and nonassociative) is a basis of a rich family of formal logics: type logics for categorial grammars, substructural...
-
A Categorical Equivalence for Tense Nelson Algebras
In this paper we present a category equivalent to that of tense Nelson algebras. The objects in this new category are pairs consisting of an...
-
Logics of Left Variable Inclusion
Regular varieties are defined by regular identities, where the same set of variables occurs on both sides. Therefore, we are not taking a wild guess...
-
Editorial Introduction
After providing an overview of the algebraic investigations into substructural logics in a historical perspective, with a special focus on their...
-
The Catuṣkoṭi, the Saptabhaṇgī, and “Non-Classical” Logic
The Principles of Excluded Middle and Non-Contradiction are highly orthodox in Western philosophy. They are much less so in Indian philosophy....
-
A Scientific Autobiography
This is a short autobiography consisting of personal recollections and experiences in my academic life. It starts from my student days, and covers...
-
Truth and the Philosophy of Mathematics
Is truth – qua a primitive notion – fit to play an independent role in the philosophy of mathematics and in the foundational investigations? The...
-
Fixed-Point Posets in Theories of Truth
We show that any coherent complete partial order (ccpo) is obtainable as the fixed-point poset of the strong Kleene jump of a suitably chosen...
-
Aspects of Categorical Recursion Theory
We present a survey of some developments in the general area of category-theoretic approaches to the theory of computation, with a focus on topics...