Related papers: Twist-Valued Models for Three-valued Paraconsisten…
There has been substantial progress in the inference of formal behavioural specifications from sample trajectories, for example, using Linear Temporal Logic (LTL). However, these techniques cannot handle specifications that correctly…
We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…
Soft set theory, introduced by Molodtsov [Molodtsov, D. (1999). Soft set theory-first results. Comput. Math. Appl., 37(4-5), 19-31], provides a flexible framework for managing uncertainty and vagueness, addressing limitations in traditional…
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…
We introduce a class of projected entangled pair states (PEPS) which is based on a group symmetry twisted by a 3-cocycle of the group. This twisted symmetry gives rise to a new standard form for PEPS from which we construct a family of…
In this paper, we present an abstract framework of many-valued modal logic with the interpretation of atomic propositions and modal operators as predicate lifting over coalgebras for an endofunctor on the category of sets. It generalizes…
This contribution is mainly based on joint papers with Lepowsky and Milas, and some parts of these papers are reproduced here. These papers further extended works by Lepowsky and by Milas. Following our joint papers, I explain the general…
Looped Transformers offer a promising alternative to purely feed-forward computation by iteratively refining latent representations, improving language modeling and reasoning. Yet recurrent architectures remain unstable to train, costly to…
In a recent work, the author has constructed two families of algebraic cycles in Bloch cycle algebra over the prjective line minus 3 points that are expected to correspond to multiple polylogarithms in one variable and have a good…
We deal with monotone inclusion problems of the form $0\in Ax+Dx+N_C(x)$ in real Hilbert spaces, where $A$ is a maximally monotone operator, $D$ a cocoercive operator and $C$ the nonempty set of zeros of another cocoercive operator. We…
Kac and Wakimoto introduced the admissible highest weight representations as a conjectural classification of all modular-invariant representations of the affine Kac--Moody algebras. For the affine Kac--Moody algebra $A_1^{(1)}$ their…
We study a class of integrable nonhomogeneous Lotka-Volterra systems whose quadratic terms are defined by an antisymmetric matrix and whose linear terms consist of three blocks. We provide the Poisson algebra of their Darboux polynomials,…
In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…
This paper introduces the logic $QLET_{F}$, a quantified extension of the logic of evidence and truth $LET_{F}$, together with a corresponding sound and complete first-order non-deterministic valuation semantics. $LET_{F}$ is a…
The study of twisted representations of graded vertex algebras is important for understanding orbifold models in conformal field theory. In this paper we consider the general set-up of a vertex algebra $V$, graded by $\G/\Z$ for some…
Large language models (LLMs) generalize smoothly across continuous semantic spaces, yet strict logical reasoning demands the formation of discrete decision boundaries. Prevailing theories relying on linear isometric projections fail to…
Recently, arXiv:2312.16035 showed that all logics based on Boolean Normal monotonic three-valued schemes coincide with classical logic when defined using a strict-tolerant standard ($\mathbf{st}$). Conversely, they proved that under a…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
We consider lattice Hamiltonian realizations of ($d$+1)-dimensional Dijkgraaf-Witten theory. In (2+1)d, it is well-known that the Hamiltonian yields point-like excitations classified by irreducible representations of the twisted quantum…
Gaisi Takeuti introduced Boolean valued analysis around 1974 to provide systematic applications of Boolean valued models of set theory to analysis. Later, his methods were further developed by his followers, leading to solving several open…