Related papers: Twist-Valued Models for Three-valued Paraconsisten…
The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…
We introduce a mixed holomorphic-topological gauge theory in three dimensions associated to a (freely generated) Poisson vertex algebra. The $\lambda$-bracket of the PVA plays the role of the structure constants of the gauge algebra and the…
In this paper we show that using implicative algebras one can produce models of set theory generalizing Heyting/Boolean-valued models and realizability models of (I)ZF, both in intuitionistic and classical logic. This has as consequence…
These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…
Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In my master's thesis, I introduce sequent-type calculi for a variant of default logic employing \Lukasiewicz's…
We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…
This document comprises Level Theory, parts 1-3. PART 1. The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets…
In a recent paper, Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic. THEOREM: The first-order theories of Peano arithmetic and ZF with the axiom of infinity negated are…
In the 1980s B\"ocherer formulated a conjecture relating the central values of the imaginary quadratic twists of the spin L-function attached to a Siegel modular form $F$ to the Fourier coefficients of $F$. This conjecture has been proved…
This paper presents the development of a software tool that enables the translation of first-order predicate logic with at most three variables into relation algebra. The tool was developed using the Z3 theorem prover, leveraging its…
As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms $x=y\setminus z$, $x \neq y\setminus z$, and $z =\{x\}$, where $x,y,z$ stand for variables ranging over the von…
We present an Hilbert space formulation for a set of implied volatility models introduced in \cite{BraceGoldys01} in which the authors studied conditions for a family of European call options, varying the maturing time and the strike price…
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…
In this paper a knowledge representation model are proposed, FP5, which combine the ideas from fuzzy sets and penta-valued logic. FP5 represents imprecise properties whose accomplished degree is undefined, contradictory or indeterminate for…
Reinforcement learning improves LLM reasoning, yet sparse delayed reward over long sequences makes token-level credit assignment the key bottleneck. We study the verifiable-reward setting, where the final answer is checkable and multiple…
We detail some ways in which the study of three-valued logics of indicative conditionals can be extended by further adding a new truth-value. Our approach heavily relies on twist constructions, which have been already used in the literature…
This paper introduces a novel method for compact representation of sets of n-dimensional binary sequences in a form of compact triplets structures (CTS), supposing both logic and arithmetic interpretations of data. Suitable illustration of…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…
In this paper, we characterize the vanishing of twisted central $L$-values attached to newforms of square-free level in terms of so-called local polynomials and the action of finitely many Hecke operators thereon. Such polynomials are the…