Related papers: The higher dimensional propositional calculus
Infinitesimal conformal transformations of $R^n$ are always polynomial and finitely generated when $n>2$. Here we prove that the Lie algebra of infinitesimal conformal polynomial transformations over $R^n$, $n>1$, is maximal in the Lie…
We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then…
In this paper, we introduce and investigate monadic NM-algebras: a variety of NM-algebras equipped with universal quantifiers. Also, we obtain some conditions under which monadic NM-algebras become monadic Boolean algebras. Besides, we show…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
In the present paper, we introduce a multi-type calculus for the logic of measurable Kleene algebras, for which we prove soundness, completeness, conservativity, cut elimination and subformula property. Our proposal imports ideas and…
We study infinite-dimensional analogues of nilpotent and solvable Lie algebras, focusing on the classes of pro-nilpotent, residually nilpotent, pro-solvable and residually solvable Lie algebras. We extend classical triangularization results…
We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms,…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…
Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…
The structure of a complete lattice formed by closed linear subspaces of a Hilbert space (i.e., a Hilbert lattice) entails some unreasonable consequences from the physical point of view. Specifically, this structure seems to contradict to…
Presented, in this monograph, are the results of the U. S. Naval Academy Mathematical Logic Course Project. The propositional and predicate calculus is presented in a unique manner. All aspects are rigorously established using the the…
A Lie algebra $L$ of dimension $n \ge1 $ may be classified, looking for restrictions of the size on its second integral homology Lie algebra $H_2(L,\mathbb{Z})$, denoted by $M(L)$ and often called Schur multiplier of $L$. In case $L$ is…
In this note we contribute to the recently developing study of "almost Boolean" quantum logics (i.e. to the study of orthomodular partially ordered sets that are naturally endowed with a symmetric difference). We call them enriched quantum…
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…
In this paper, we introduce a $\{\lambda_{1\to n-1}\}$-bracket and a distribution notion of an $n$-Lie conformal algebra. For any $n$-Lie conformal algebra $R$, there exists a series of associated infinite-dimensional linearly compact…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.
Associated to a symmetric space there is a canonical connection with zero torsion and parallel curvature. This connection acts as a binary operator on the vector space of smooth sections of the tangent bundle, and it is linear with respect…