Related papers: Slanted canonicity of analytic inductive inequalit…
The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies…
In this note we analyse the Lie algebras of physical states stemming from lattice constructions on general even, self-dual lattices Gamma^{p,q} with p greater or equal to q. It is known that if the lattice is at most Lorentzian, the…
Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the…
We report on the utility of using Shannons Sampling theorem to solve Quantum Mechanical systems. We show that by extending the logic of Shannons interpolation theorem we can define a Universal Lattice Basis, which has superior interpolating…
We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…
If one proposes to use the theory of Eisenstein cohomology to prove algebraicity results for the special values of automorphic L-functions as in my work with Harder for Rankin-Selberg L-functions, or its generalizations as in my work with…
For a locally compact second countable group G and a lattice subgroup Gamma, we give an explicit quantitative solution of the lattice point counting problem in general domains in G, provided that i) G has finite upper local dimension, and…
We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…
We show that the algebraic aspects of Lie symmetries and generalized symmetries in nonrelativistic and relativistic quantum mechanics can be preserved in linear lattice theories. The mathematical tool for symmetry preserving discretizations…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…
We introduce a proper display calculus for (non-distributive) Lattice Logic which is sound, complete, conservative, and enjoys cut-elimination and sub-formula property. Properness (i.e. closure under uniform substitution of all parametric…
We prove that, under mild assumptions, a lattice in a product of semi-simple Lie group and a totally disconnected locally compact group is, in a certain sense, arithmetic. We do not assume the lattice to be finitely generated or the ambient…
This paper develops a general theory of canonical bases, and how they arise naturally in the context of categorification. As an application, we show that Lusztig's canonical basis in the whole quantized universal enveloping algebra is given…
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…
We introduce a new approach to the description of multi-sorted clones (sets of $k$-tuples of operations of the same arity, closed under coordinatewise composition and containing all projection tuples) on a two-element domain. Leveraging the…
Recently, the description logic LE-ALC was introduced for reasoning in the semantic environment of the enriched formal contexts, and a tableaux algorithm was developed for checking the consistency of ABoxes in this logic. In this paper, we…
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…