Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1709.04832

Monadic NM-algebras

Jun Tao Wang·Xiao Long Xin·Peng Fei He
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 that the variety of monadic NM-algebras faithfully the axioms on quantifiers in monadic predicate NM logic. Furthermore, we discuss relations between monadic NM-algebras and some related structures, likeness modal NM-algebras and rough approximation spaces. In addition, we investigate monadic filters in monadic NM-algebras. In particular, we characterize simple and subdirectly irreducible monadic NM-algebras and obtain a representation theorem for monadic NM-algebras. Finally, we present monadic NM-logic and prove the (chain) completeness of monadic NM-logic based on monadic NM-algebras. These results constitute a crucial first step for providing a solid algebraic foundation for the monadic predicate NM logic.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Jun Tao Wang, Xiao Long Xin, Peng Fei He. 2017-09-14. Monadic NM-algebras. https://arxiv.org/abs/1709.04832

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗