Related papers: The Conrad Program: From l-groups to algebras of l…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using…
Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…
The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…
We consider the Clifford algebra and the Clifford group associated with any quadratic module, degenerate or not, over an arbitrary commutative ring with 1. We determine some of the important subalgebras of the Clifford algebra under some…
A logic program is an executable specification. For example, merge sort in pure Prolog is a logical formula, yet shows creditable performance on long linked lists. But such executable specifications are a compromise: the logic is distorted…
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…
The purpose of this paper is to present a fresh idea on how symbolic learning might be realized via analogical reasoning. For this, we introduce directed analogical proportions between logic programs of the form "$P$ transforms into $Q$ as…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
We investigate an enriched-categorical approach to a field of discrete mathematics. The main result is a duality theorem between a class of enriched categories (called $\overline{\mathbb{Z}}$- or $\overline{\mathbb{R}}$-categories) and that…
In this paper we introduce the convex fragment of {\L}ukasiewicz Logic and discuss its possible applications in different learning schemes. Indeed, the provided theoretical results are highly general, because they can be exploited in any…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
The notion of concept has been studied for centuries, by philosophers, linguists, cognitive scientists, and researchers in artificial intelligence (Margolis & Laurence, 1999). There is a large literature on formal, mathematical models of…
Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…
Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We…
Generalization remains a significant challenge in visual classification tasks, particularly in handling unknown classes in real-world applications. Existing research focuses on the class discovery paradigm, which tends to favor known…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE algebras). We work in the purely algebraic setting of…
Logicians study and apply a multiplicity of various logical systems. Consequently, there is necessity to build foundations and common grounds for all these systems. This is done in metalogic. Like metamathematics studies formalized…
Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition…