Related papers: Slanted canonicity of analytic inductive inequalit…
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…
A relation between semi-direct sums of Lie algebras and integrable couplings of lattice equations is established, and a practicable way to construct integrable couplings is further proposed. An application of the resulting general theory to…
We present an approach to the canonical quantization of systems with equations of motion that are historically called non-Lagrangian equations. Our viewpoint of this problem is the following: despite the fact that a set of differential…
The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…
We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…
In this Master's thesis, we consider the problem of classifying, up to conjugation by linear symplectomorphisms, linear canonical relations (lagrangian correspondences) from a finite-dimensional symplectic vector space to itself. We give an…
We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.
On the ground of a general theorem concerning the admissibility of the structural rules in sequent calculi with additional atomic rules, we develop a proof theoretic analysis for several extensions of the ${\bf G3[mic]}$ sequent calculi…
Given a logarithmic $1$-form on the snc locus of a log canonical surface pair $(X, D)$ over a perfect field of characteristic $p \ge 7$, we show that it extends with at worst logarithmic poles to any resolution of singularities. We also…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…
We prove the finiteness of $B$-representations of generalised log canonical pairs. As a consequence, we prove that, the (relative) abundance for a generalised semi-log canonical pair is implied by the abundance for its normalisation.…
Recently, description logic LE-ALC was introduced for reasoning in the semantic environment of enriched formal contexts, and a polynomial-time tableaux algorithm was developed to check the consistency of knowledge bases with acyclic TBoxes.…
The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such…
Noncommutative lattices have been recently used as finite topological approximations in quantum physical models. As a first step in the construction of bundles and characteristic classes over such noncommutative spaces, we shall study their…
We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…
We introduce a class of first order G-structures, each of which has an underlying almost conformally symplectic structure. There is one such structure for each real simple Lie algebra which is not of type $C_n$ and admits a contact grading.…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
We prove a sharpened version of a conjecture of Dong-Mason about lattice subalgebras of a strongly regular vertex operator algebra $V$, and give some applications. These include the existence of a canonical conformal subVOA $W\otimes…
We define when a ternary term $m$ of an algebraic language $\mathcal{L}$ is called a \textit{distributive nearlattice term} (DN-term) of a sentential logic $\mathcal{S}$. Distributive nearlattices are ternary algebras generalising Tarski…