English
Related papers

Related papers: Procedures of Leibnizian infinitesimal calculus: A…

200 papers

In \cite{LC, LCMF}, it was introduced a logic (called \Six ) associated to a class of algebraic structures known as {\em involutive Stone algebras}. This class of algebras, denoted by \Sto , was considered by the first time in \cite{CS1} as…

Logic · Mathematics 2023-04-25 Liliana M. Cantú , Martín Figallo

Solvability of the rational quantum integrable systems related to exceptional root spaces $G_2, F_4$ is re-examined and for $E_{6,7,8}$ is established in the framework of a unified approach. It is shown the Hamiltonians take algebraic form…

High Energy Physics - Theory · Physics 2009-11-10 Konstantin G. Boreskov , Alexander V. Turbiner , Juan C. Lopez Vieyra

We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite…

Optimization and Control · Mathematics 2017-02-22 Peyman Mohajerin Esfahani , Tobias Sutter , Daniel Kuhn , John Lygeros

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

The coalgebra approach to the construction of classical integrable systems from Poisson coalgebras is reviewed, and the essential role played by symplectic realizations in this framework is emphasized. Many examples of Hamiltonians with…

Mathematical Physics · Physics 2009-07-22 Angel Ballesteros , Alfonso Blasco , Francisco J. Herranz , Fabio Musso , Orlando Ragnisco

The article is devoted to the representation theory of locally compact infinite-dimensional group $\mathbb{GLB}$ of almost upper-triangular infinite matrices over the finite field with $q$ elements. This group was defined by S.K., A.V., and…

Representation Theory · Mathematics 2014-04-08 Vadim Gorin , Sergei Kerov , Anatoly Vershik

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

Logic in Computer Science · Computer Science 2025-05-27 Viviana del Barco , Gustavo Infanti , Exequiel Rivas , Paul Schwahn

In this paper we give a complete classification of two-step nilpotent Leibniz algebras in terms of Kronecker modules associated with pairs of bilinear forms. In particular, we describe the complex and the real case of the indecomposable…

Rings and Algebras · Mathematics 2023-06-07 Manuel Mancini , Gianmarco La Rosa

In the present paper we describe Leibniz algebras with three-dimensional Euclidean Lie algebra $\mathfrak{e}(2)$ as its liezation. Moreover, it is assumed that the ideal generated by the squares of elements of an algebra (denoted by $I$) as…

Representation Theory · Mathematics 2016-07-19 J. Q. Adashev , B. A. Omirov , S. Uguz

In this paper we identify the structure of complex finite-dimensional Leibniz algebras with associated Lie algebras $sl_2^1\oplus sl_2^2\oplus \dots \oplus sl_2^s\oplus R,$ where $R$ is a solvable radical. The classifications of such…

Rings and Algebras · Mathematics 2014-09-15 L. M. Camacho , S. Gómez-Vidal , B. A. Omirov , I. A. Karimjanov

Exponential parallelism, a defining principle of advanced computational systems, holds promise for transformative impacts across several scientific and industrial domains. This feature paper provides a comparative overview of Quantum…

General Physics · Physics 2025-11-18 Laszlo B. Kish

A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…

Logic · Mathematics 2019-11-22 R. Jansana , T. Moraschini

Newton-type methods are typically analyzed under Lipschitz continuity of the Hessian, an assumption that can fail for objectives with higher-order or polynomial growth. We introduce a class of nonlinearly preconditioned Newton methods that…

Optimization and Control · Mathematics 2026-05-14 Alexander Bodard , Panagiotis Patrinos

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

Computational Complexity · Computer Science 2025-05-16 Victor Lagerkvist , Mohamed Maizia , Johannes Schmidt

A wide variety of integral inequalities (IIs) have been developed and studied for the stability analysis of distributed parameter systems using the Lyapunov functional approach. However, no unified mathematical framework has been proposed…

Optimization and Control · Mathematics 2024-04-09 Qian Feng , Alexandre Seuret , Sing Kiong Nguang , Feng Xiao

Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…

Logic in Computer Science · Computer Science 2017-03-10 Steffen Lewitzka

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

Logic in Computer Science · Computer Science 2021-10-04 Florian Chudigiewitsch

In this note we present a more detailed and explicit exposition of the definition of a conformal representation of a Leibniz algebra. Recall (arXiv:math/0611501v3) that Leibniz algebras are exactly Lie dialgebras. The idea is based on the…

Rings and Algebras · Mathematics 2012-08-14 Pavel Kolesnikov
‹ Prev 1 8 9 10 Next ›