Related papers: A Report on Realizability
In this paper, we define and study the classical $R$-matrix for vertex Lie algebra, based on which we propose to construct a new vertex Lie algebra. We give a systematic way to construct the $R$-matrix for affine Kac-Moody vertex Lie…
The work is devoted to Computability Logic (CoL) -- the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth} by computability in its underlying semantics (see…
We consider a class of linear ODEs of second order with variable coefficients and construct its Lie algebra of Lie group of equivalence transformations. Further we find invariants and differential invariants of this Lie algebra and by using…
We relate the representations of the rational Cherednik algebras associated with the complex reflection group G(m,1,n) to sheaves on Nakajima quiver varieties associated with extended Dynkin gaphs via a Z-algebra construction. As the…
Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
In Hayashi and Leigh (2024), the authors formulate classical number realisability for first-order arithmetic and a corresponding axiomatic system based on Krivine's classical realisability interpretation. This paper presents a…
A Hopf algebra object in Loday and Pirashvili's category of linear maps entails an ordinary Hopf algebra and a Yetter-Drinfel'd module. We equip the latter with a structure of a braided Leibniz algebra. This provides a unified framework for…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…
We define topological orthoalgebras (TOAs) and study their properties. While every topological orthomodular lattice is a TOA, the lattice of projections of a Hilbert space is an example of a lattice-ordered TOA that is not a toplogical…
We define the notion of a multi-sorted algebraic theory, which is a generalization of an algebraic theory in which the objects are of different "sorts." We prove a rigidification result for simplicial algebras over these theories, showing…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
Uniform preorders are a class of combinatory representations of Set-indexed preorders that generalize Pieter Hofstra's basic relational objects. An indexed preorder is representable by a uniform preorder if and only if it has as generic…
Recently Krichever proposed a generalization of the amoeba and the Ronkin function of a plane algebraic curve. In our paper higher-dimensional version of this generalization is studied. We translate to the generalized case different…
Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…
The article concerns the geometrical theory of general systems $\Omega$ of partial differential equations in the \emph{absolute sense}, i.e., without any additional structure and subject to arbitrary change of variables in the widest…
The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging to a certain complexity class. We here present a…
The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…