相关论文: A Gr\"atzer-Schmidt theorem for the Lindenbaum-Tar…

We prove a reciprocity formula between Gauss sums that is used in the computation of certain quantum invariants of 3-manifolds. Our proof uses the discriminant construction applied to the tensor product of lattices.

We extend the main result of (G. Badia and G. Olkhovikov. A Lindstr\"om theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to the first-order intuitionistic logic (with and without…

The aim of this article is to give an elementary proof of the fact that the Schwarz-Pick Lemma follows from the Ahlfors-Schwarz-Pick Lemma.

A flexible unified framework for both classical and quantum Schubert calculus is proposed. It is based on a natural combinatorial approach relying on the Hasse-Schmidt extension of a certain family of pairwise commuting endomorphisms of an…

In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…

In this paper an algebraic proof of Christoph's theorem is provided. This theorem from algebraic-geometry is about the existence of a finite automaton for computing coefficient of a series for an algebraic function.

This paper establishes and proves representation theorems for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. Cumulative logics are famously given by System C. For propositional…

This paper focuses on the $GL_n$ tensor product algebra, which encapsulates the decomposition of tensor products of arbitrary finite dimensional irreducible representations of $GL_n$. We will describe an explicit basis for this algebra.…

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…

This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…

We prove the uniform interpolation theorem in modal provability logics GL and Grz by a proof-theoretical method, using analytical and terminating sequent calculi for the logics. The calculus for G\"odel-L\"ob's logic GL is a variant of the…

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

In this article, we continue the study of tense symmetric Heyting algebras (or TSH-algebras). These algebras constitute a generalization of tense algebras. In particular, we describe a discrete duality for TSHalgebras bearing in mind the…

We prove an abstract linking theorem that can be used to show existence of solutions to various types of variational elliptic equations, including Schr\"{o}dinger--Poisson--Slater type equations.

The Landsberg-Schaar relation is a classical identity between quadratic Gauss sums, normally used as a stepping stone to prove quadratic reciprocity. The Landsberg-Schaar relation itself is usually proved by carefully taking a limit in the…

We prove an explicit degree formula for certain unitary Deligne-Lusztig varieties. Combining with an alternative degree formula in terms of Schubert calculus, we deduce several algebraic combinatorial identities which may be of independent…

We present a general conjecture on the divisibility of a certain expression in terms of Kostka numbers and their close variants. This conjecture is closely related to a variant of the period-index problem of noncommutative algebra, with…

We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…

We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…

In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…