相关论文: Session Types in Abelian Logic

Two major areas of interest in the era of Large Language Models regard questions of what do LLMs know, and if and how they may be able to reason (or rather, approximately reason). Since to date these lines of work progressed largely in…

The purpose of this note is to establish convergence of random walks on the moduli space of Abelian differentials on compact Riemann surfaces in two different modes: convergence of the $n$-step distributions from almost every starting point…

Combinatorial gauge symmetry is a principle that allows us to construct lattice gauge theories with two key and distinguishing properties: a) only one- and two-body interactions are needed; and b) the symmetry is exact rather than emergent…

Word embeddings are ubiquitous in NLP and information retrieval, but it is unclear what they represent when the word is polysemous. Here it is shown that multiple word senses reside in linear superposition within the word embedding and…

Many large language models (LLMs) use reasoning to generate responses but do not reveal their full reasoning traces (a.k.a. chains of thought), instead outputting only final answers and brief reasoning summaries. To demonstrate that hiding…

Much of the controversy about methods for automated decision making has focused on specific calculi for combining beliefs or propagating uncertainty. We broaden the debate by (1) exploring the constellation of secondary tasks surrounding…

The abelian sandpile model is a simple combinatorial model for critical behaviour which has the "abelian property" that the order in which we make moves does not change the final outcome of the game. This might seem to restrict the model's…

The aim of the paper is to discuss the relations between the three kinds of objects named in the title. In a sense, this is a survey of such relations; however, some new directions are also considered. This relates, especially, to sections…

We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…

In this paper we present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any cases. This approach allows to give a notion of divisibility…

The paper has a form of a survey and consists of three parts. It is focused on the relationship between the many-sorted theory, which leads to logical geometry and one-sorted theory, which is based on the important model-theoretic concepts.…

Despite a growing body of work at the intersection of deep learning and formal languages, there has been relatively little systematic exploration of transformer models for reasoning about typed lambda calculi. This is an interesting area of…

We introduce quantum walks on Cayley graphs of non-Abelian groups. We focus on the easiest case of virtually Abelian groups, and introduce a technique to reduce the quantum walk to an equivalent one on an Abelian group with coin system…

Appel and McAllester's "step-indexed" logical relations have proven to be a simple and effective technique for reasoning about programs in languages with semantically interesting types, such as general recursive types and general reference…

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Large language models (LLMs) have shown an impressive ability to perform tasks believed to require thought processes. When the model does not document an explicit thought process, it becomes difficult to understand the processes occurring…

In the work we investigate some groupoids which are the Abelian algebras and the Hamiltonian algebras. An algebra is Abelian if for every polynomial operation and for all elements $a,b,\bar c,\bar d$ the implication $t(a,\bar c)=t(a,\bar…

To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…