Related papers: The Problem of Analogical Inference in Inductive L…
Underlying many Bayesian inference techniques that seek to approximate the posterior as a Gaussian distribution is a fundamental linear algebra problem that must be solved for both the mean and key entries of the covariance. Even when the…
This work presents a novel systematic methodology to analyse the capabilities and limitations of Large Language Models (LLMs) with feedback from a formal inference engine, on logic theory induction. The analysis is complexity-graded w.r.t.…
Treating syntactic equality as a logical connective -- governed by left- and right-introduction rules within the sequent calculus -- offers an elegant and powerful approach to term identity. This treatment of equality allows for the…
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…
In this talk - based on the results of a forthcoming paper (Coletti, Scozzafava and Vantaggi 2002), presented also by one of us at the Conference on "Non Classical Logic, Approximate Reasoning and Soft-Computing" (Anacapri, Italy, 2001) -…
I aim to promote an alternative agenda for teaching modal logic chiefly inspired by the relationships between modal logic and philosophy. The guiding idea for this proposal is a reappraisal of the interest of modal logic in philosophy,…
Despite recent advances in modern machine learning algorithms, the opaqueness of their underlying mechanisms continues to be an obstacle in adoption. To instill confidence and trust in artificial intelligence systems, Explainable Artificial…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
This paper explores trivalent truth conditions for indicative conditionals, examining the "defective" table put forward by de Finetti 1936, as well as Reichenbach 1944, first sketched in Reichenbach 1935. On their approach, a conditional…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…
D. Wallace has tried to use decoherence to solve the preferred basis problem of Everettian Quantum Mechanics, and this solution lays the foundation for his proof of the Born rule. But this is a circular argument, as approximations used in…
The goal of inductive logic programming is to induce a logic program (a set of logical rules) that generalises training examples. Inducing programs with many rules and literals is a major challenge. To tackle this challenge, we introduce an…
Two major difficulties in using default logics are their intractability and the problem of selecting among multiple extensions. We propose an approach to these problems based on integrating nommonotonic reasoning with plausible reasoning…
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…
This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…
Fundamental logic was introduced by Wesley Holliday (2023) to unify intuitionistic logic and quantum logic from a proof-theoretic perspective, capturing the logic determined solely by the introduction and elimination rules of connectives…
The classical platonist / formalist dilemma in philosophy of mathematics can be expressed in lay terms as a deceptively naive question: \emph{Is new mathematics discovered or invented? Using examples from my own mathematical work during the…
Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article we show that Bertrand's paradox contains two different problems: an "easy"…