Related papers: Twist-Valued Models for Three-valued Paraconsisten…
In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…
In the present paper we study the central values of additive twists of Maa{\ss} forms $L$-series. In the case of the modular group, we show that the additive twists (when averaged over denominators) are asymptotically normally distributed.…
Motivated by super Poisson-Lie (PL) symmetry of the Wess-Zumino-Witten (WZW) model based on the $(C^3+A)$ Lie supergroup of our previous work [A. Eghbali {\it et al.} JHEP 07 (2013) 134], we first obtain and classify all Drinfeld…
The paper proposes a derivation system for a logic of presuppositions as introduced by P. F. Strawson. It is based on truth-relevant logic described by M. Richard Diaz in 1981. In another paper I outlined a derivation system for t-relevant…
Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…
We introduce probabilistic language tries (PLTs), a unified representation that makes explicit the prefix structure implicitly defined by any generative model over sequences. By assigning to each outgoing edge the conditional probability of…
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…
The post-training phase of large language models is essential for enhancing capabilities such as instruction-following, reasoning, and alignment with human preferences. However, it demands extensive high-quality data and poses risks like…
We introduce a new model of teaching named "preference-based teaching" and a corresponding complexity parameter---the preference-based teaching dimension (PBTD)---representing the worst-case number of examples needed to teach any concept in…
In 1981, Takeuti introduced quantum set theory as the quantum counterpart of Boolean valued models of set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed subspaces in a Hilbert space…
Determining the validity of a quantified Boolean formula (QBF) is a PSPACE-complete problem with rich expressive power. Despite interest in efficient solvers, there is, compared to problems in NP, a lack of positive theoretical results, and…
Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic…
We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists simply in adding a " flipping coin " boolean closed atomic expression. This language can be understood as a major generalization of Scott's PCF…
Logarithmic perturbation theory (LPT) is developed and applied to quasinormal modes (QNMs) in open systems. QNMs often do not form a complete set, so LPT is especially convenient because summation over a complete set of unperturbed states…
In this article, we give a concise summary of $L_\infty$-algebras viewed in terms of Chevalley-Eilenberg algebras, Weil algebras and invariant polynomials and their use in defining connections in higher gauge theory. Using this, we discuss…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
Not all logical systems can be captured using algebras. We see this in classical logic (formalized by Boolean algebras) and many-valued logics (like Lukasiewicz logic with MV-algebras). Even quantum mechanics, initially formalized with…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
The dimension of any module over an algebra of affiliated operators ${\mathcal U}$ of a finite von Neumann algebra ${\mathcal A}$ is defined using a trace on ${\mathcal A}.$ All zero-dimensional ${\mathcal U}$-modules constitute the torsion…
In this paper, we develop twisted $K$-theory for stacks, where the twisted class is given by an $S^1$-gerbe over the stack. General properties, including the Mayer-Vietoris property, Bott periodicity, and the product structure $K^i_\alpha…