相关论文: Dedekind-MacNeille and related completions: subfit…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
We present a systematic study of join-extensions and join-completions of ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from…
We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (e.g., $\{0\})$ that are closed under the natural metric, but has no prime ideals closed under that metric; hence closed…
Contrary to widespread perception, there is ever since 1994 a unified, general type independent theory for the existence of solutions for very large classes of nonlinear systems of PDEs. This solution method is based on the Dedekind order…
While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
We work in the setting of Zermelo-Fraenkel set theory without assuming the Axiom of Choice. We consider sets with the Boolean operations together with the additional structure of comparing cardinality (in the Cantorian sense of injections).…
The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…
The context of this work is that of partial frames; these are meet-semilattices where not all subsets need have joins. A selection function, S, specifies, for all meet-semilattices, certain subsets under consideration, which we call the…
Alternating sign matrices (ASMs) arise as the Dedekind-MacNeille completion of the Bruhat order on the symmetric group. They enjoy fruitful combinatorial and geometric properties, with a particularly rich history on enumerations and…
While computer programs and logical theories begin by declaring the concepts of interest, be it as data types or as predicates, network computation does not allow such global declarations, and requires *concept mining* and *concept…
We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere…
Given a Dedekind incomplete ordered field, a pair of convergent nets of gaps which are respectively increasing or decreasing to the same point is used to obtain a further equivalent criterion for Dedekind completeness of ordered fields:…
We utilize the Bruns-Lakser completion to introduce Bruns-Lakser towers of a meet-semilattice. This machinery enables us to develop various hierarchies inside the class of bounded distributive lattices, which measure $\kappa$-degrees of…
We provide a thorough algebraic analysis of three known completions having a central role in the exact completions of Lawvere's doctrines: the one adding comprehensive diagonals (i.e. forcing equality on terms to coincide with the equality…
We investigate (quasi)varieties of lattices with complementation, i.e., complemented lattices equipped with a fixed complementation as a unary operation. We focus on subclasses satisfying additional conditions, such as the quasi-identity…
The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…
In this work, we deal with Delone sets and their rectifiability under different classes of regularity. By pursuing techniques developed by Rivi\`ere and Ye, and Aliste-Prieto, Coronel and Gambaudo, we give sufficient conditions for a…