Related papers: The higher dimensional propositional calculus
We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
A fundamental result by L. Solomon in algebraic combinatorics and representation theory states that Mackey formulas for products of characters of a symmetric group, or equivalently the computation of tensor products of representations…
The fundamental algebraic concepts of quantum mechanics, as expressed by many authors, are reviewed and translated into the framework of the relatively new non-distributive system of Boolean fractions (also called conditional events or…
A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…
Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…
The class of quasi-N4-lattices (QN4-lattices) was introduced as a common generalization of quasi-Nelson algebras and N4-lattices, in such a way that N4-lattices are precisely the QN4-lattices satisfying the double negation law (~~x = x) and…
This paper outlines new paradigms for real analysis and computability theory in the recently proposed non-Aristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts…
A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…
We have recently shown that pseudo-bosonic operators realize concrete examples of finite dimensional nilpotent Lie algebras over the complex field. It has been the first time that such operators were analyzed in terms of nilpotent Lie…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…
Quantum versions of the hydrogen atom and the harmonic oscillator are studied on non Euclidean spaces of dimension N. 2N-1 integrals, of arbitrary order, are constructed via a multi-dimensional version of the factorization method, thus…
Local Completeness Logic (LCL) has been put forward as a program logic for proving both the correctness and incorrectness of program specifications. LCL is an abstract logic, parameterized by an abstract domain that allows combining over-…
This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…
In this paper, we introduce the notion of an omni $n$-Lie algebra and show that they are linearization of higher analogues of standard Courant algebroids. We also introduce the notion of a nonabelian omni $n$-Lie algebra and show that they…
The principal aim of this article is to introduce and study n-valued quandles and n-corack bialgebras. We elaborate the basic methods of this theory, reproduce the coset construction known in the theory of n-valued groups. We also consider…
The four-valued semantics of Belnap--Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several non-classical logics depending on which feature of propositions we wish to preserve: truth, non-falsity,…
A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively,…
A classical logic exhibits a threefold inner structure comprising an algebra of propositions `A', a space of ``truth values'' `V', and a distinguished family of mappings `phi' from propositions to truth values. Classically A is a Boolean…