Related papers: Lindenbaum Method
In 20th century mathematics, the field of topology, which concerns the properties of geometric objects under continuous transformation, has proved surprisingly useful in application to the study of discrete mathematics, such as…
A system $\boldsymbol\lambda_{\theta}$ is developed that combines modal logic and simply-typed lambda calculus, and that generalizes the system studied by Montague and Gallin. Whereas Montague and Gallin worked with Church's simple theory…
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
A number of research articles have established the significant role of lattice-ordered groups (l-groups) in logic. The purpose of the present article is to lay the groundwork for, and provide significant initial contributions to, the…
We provide a generalization of the Phragm\'en-Lindel\"of principal of Rademacher with the aim of correcting, or at least provide a pathway to correcting, several errors appearing in the literature.
In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to…
This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…
A new view on the Kowalevski top and the Kowalevski integration procedure is presented. For more than a century, the Kowalevski 1889 case, attracts full attention of a wide community as the highlight of the classical theory of integrable…
The algebraic structures known as {\it Leavitt path algebras} were initially developed in 2004 by Ara, Moreno and Pardo, and almost simultaneously (using a different approach) by the author and Aranda Pino. During the intervening decade,…
Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…
In order to design and engineer ethical and legal reasoners and responsible systems, Benzm\"{u}ller, Parent and van der Torre introduced the LogiKEy methodology, based on the semantical embedding of deontic logics into classic higher-order…
Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…
Jacobi is one of the most famous mathematicians of his century. His name is attached to many results in various fields of mathematics and his complete works in seven volumes have been available since the end of the XIXth century and are…
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…
In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…
In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…
In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…
The Binomial Theorem has long been essential in mathematics. In one form or another it was known to the ancients and, in the hands of Leibniz, Newton, Euler, Galois, and others, it became an essential tool in both algebra and analysis.…
Since Leibniz algebras were introduced by Loday as a generalization of Lie algebras, there has been a lot of interest in which results of the latter extend to the former. Cyclic algebras, those generated by one element, are a useful tool…