English
Related papers

Related papers: Implication in finite posets with pseudocomplement…

200 papers

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

Representation Theory · Mathematics 2024-12-02 Riju Bindua , Thomas Brüstle , Luis Scoccola

The aim of this article is to extend the notions of strongly hollow and completely strongly hollow ideals of commutative rings to multiplicative lattices. We investigate their basic structural properties and prove several characterizations…

Rings and Algebras · Mathematics 2025-08-22 Amartya Goswami , Joseph Zelezniak

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

Combinatorics · Mathematics 2026-02-05 Gi-Sang Cheon , Hong Joon Choi , Gukwon Kwon , Hojoon Lee , Yaling Wang

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro

The form and justification of inductive inference rules depend strongly on the representation of uncertainty. This paper examines one generic representation, namely, incomplete information. The notion can be formalized by presuming that the…

Artificial Intelligence · Computer Science 2013-04-15 Norman C. Dalkey

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

Logic · Mathematics 2024-11-20 Richard A. Shore , Bjørn Kjos-Hanssen

Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…

Combinatorics · Mathematics 2019-05-14 C. Ganesa Moorthy , SG. Karpagavalli

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

Representation Theory · Mathematics 2019-12-17 Ralf Schiffler , Robinson-Julian Serna

We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…

Logic · Mathematics 2023-06-02 Nick Galatos , Sara Ugolini

A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…

Group Theory · Mathematics 2025-07-15 Miaomiao Ren , Xianzhong Zhao , Mikhail V. Volkov

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…

General Mathematics · Mathematics 2007-05-23 Vinod Kumar. P. B , K. Babu Joseph

In this article we prove that the co-compactness of the arithmetic lattices in a connected semisimple real Lie group is preserved if the lattices under consideration are representation equivalent. This is in the spirit of the question posed…

Representation Theory · Mathematics 2015-09-16 Chandrasheel Bhagwat , Supriya Pisolkar

We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…

Discrete Mathematics · Computer Science 2013-06-04 Jens Gerlach

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

Rings and Algebras · Mathematics 2024-07-08 Amartya Goswami

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…

Logic · Mathematics 2025-08-29 Wesley H. Holliday

We study the so-called closed and splitting subsemimodules and submodules of a given semimodule or module, respectively. We describe lattices of subsemimodules and of closed subsemimodules and posets of splitting subsemimodules and…

Rings and Algebras · Mathematics 2019-07-16 Ivan Chajda , Helmut Länger

In a recent work we have shown how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. Here we analyze the connection of such an algebra with the set algebra of subsets of the possibility…

Logic in Computer Science · Computer Science 2021-05-28 Juerg Kohlas , Arianna Casanova , Marco Zaffalon