相关论文: Generating Compatibility Conditions in Mathematica…

Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper we address the…

This paper addresses the current lack of a unified formal framework in machine learning theory, as well as the absence of robust theoretical foundations for interpretability and ethical safety assurance. We first construct a formal…

Code generation refers to the automatic generation of source code based on a given programming specification, which has garnered significant attention particularly with the advancement of large language models (LLMs). However, due to the…

If quantum mechanics were to be applicable to macroscopic objects, classical mechanics would have to be a limiting case of quantum mechanics. Then the category Set that packages classical mechanics has to be in some sense a 'limiting case'…

When multiple LLM-based code agents independently implement parts of the same class, they must agree on shared internal representations, even when the specification leaves those choices implicit. We study this coordination problem across 51…

We present a general analytical framework for quasi-static quantum Stirling engines operating across ground-state level crossings (GLC). In the low-temperature regime, we derive the Primarch Formula, an exact universal expression linking…

We introduce the first generative model trained on the JetClass dataset. Our model generates jets at the constituent level, and it is a permutation-equivariant continuous normalizing flow (CNF) trained with the flow matching technique. It…

In this article we note that in a number of situations the operator product and the classical action satisfy a natural compatibility condition. We consider the interest of this condition to be twofold: First, the naturality (functoriality)…

Let $\Gamma(S)$ be the pure mapping class group of a connected orientable surface $S$ of negative Euler characteristic. For ${\mathscr C}$ a class of finite groups, let $\hat{\pi}_1(S)^{\mathscr C}$ be the pro-${\mathscr C}$ completion of…

Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more…

Formal Concept Analysis (FCA) is an approach to creating a conceptual hierarchy in which a \textit{concept lattice} is generated from a \textit{formal context}. That is, a triple consisting of a set of objects, $G$, a set of attributes,…

When ${\cal{D}}:\xi \rightarrow \eta$ is a linear differential operator, a "direct problem " is to find the generating compatibility conditions (CC) in the form of an operator ${\cal{D}}_1:\eta \rightarrow \zeta$ such that…

Requirements over strings, commonly represented using natural language (NL), are particularly relevant for software systems due to their heavy reliance on string data manipulation. While individual requirements can usually be analyzed…

Precise rules are developed in order to formalize the reasoning processes involved in standard non-relativistic quantum mechanics, with the help of analogies from classical physics. A classical or quantum description of a mechanical system…

For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic…

Architectural imperatives due to the slowing of Moore's Law, the broad acceptance of relaxed semantics and the O(n!) worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness.…

In this paper we give some sufficient conditions of analyticity and univalence for functions defined by an integral operator. Next, we refine the result to a quasiconformal extension criterion with the help of the Becker's method. Further,…

We will examine a particular mathematical derivation in a paper by P. Falkensteiner and H. Grosse (F&G) [1]. In [1] a quantity "delta(A)" is defined. This quantity is generated when the normal ordered generalized charge operator undergoes a…

Based on the Gaussian wave packet solution for the harmonic oscillator and the corresponding creation and annihilation operators, a generalization is presented that also applies for wave packets with time-dependent width as they occur for…

We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyperproperties. Such properties…