A Tableaux System in Modal Logic
A theorem on implication functions defined from triangular norms.
Several transformation which enable implication functions in multivalued logics to be generated from conjunctions have been proposed in the literature. It is proved that for a rather general class of conjunctions modeled by triangular norms, the generation process is closed, thus shedding some light on the relationships between seemingly independent classes of implication functions.
A theoretical comparison of disco and CADIAG-II-like systems for medical diagnoses
In this paper a fuzzy relation-based framework is shown to be suitable to describe not only knowledge-based medical systems, explicitly using fuzzy approaches, but other ways of knowledge representation and processing. A particular example, the practically tested medical expert system Disco, is investigated from this point of view. The system is described in the fuzzy relation-based framework and compared with CADIAG-II-like systems that are a “pattern” for computer-assisted diagnosis systems based...
A theory of refinement structure of hedge algebras and its applications to fuzzy logic
In [13], an algebraic approach to the natural structure of domains of linguistic variables was introduced. In this approach, every linguistic domain can be interpreted as an algebraic structure called a hedge algebra. In this paper, a refinement structure of hedge algebras based on free distributive lattices generated by linguistic hedge operations will be examined in order to model structure of linguistic domains more properly. In solving this question, we restrict our consideration to the specific...
A Theory Of Variable Types.
A topological duality for the -chains associated with the logic
In this paper we present a topological duality for a certain subclass of the -structures defined by M. M. Fidel, which conform to a non-standard semantics for the paraconsistent N. C. A. da Costa logic . Actually, the duality introduced here is focused on -structures whose supports are chains. For our purposes, we characterize every -chain by means of a new structure that we will call down-covered chain (DCC) here. This characterization will allow us to prove the dual equivalence between the...
A T-partial order obtained from T-norms
A partial order on a bounded lattice is called t-order if it is defined by means of the t-norm on . It is obtained that for a t-norm on a bounded lattice the relation iff for some is a partial order. The goal of the paper is to determine some conditions such that the new partial order induces a bounded lattice on the subset of all idempotent elements of and a complete lattice on the subset of all elements of which are the supremum of a subset of atoms.
About the equivalence of nullnorms on bounded lattice
In this paper, an equivalence on the class of nullnorms on a bounded lattice based on the equality of the orders induced by nullnorms is introduced. The set of all incomparable elements w.r.t. the order induced by nullnorms is investigated. Finally, the recently posed open problems have been solved.
About the sixth Hilbert's problem
Absence of the interpolation property in the calculi and .
Abstract linear dependence.
"Abstract logics" and "Classical abstract logics" [Book]
Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
Aggregation of fuzzy vector spaces
This paper contributes to the ongoing investigation of aggregating algebraic structures, with a particular focus on the aggregation of fuzzy vector spaces. The article is structured into three distinct parts, each addressing a specific aspect of the aggregation process. The first part of the paper explores the self-aggregation of fuzzy vector subspaces. It delves into the intricacies of combining and consolidating fuzzy vector subspaces to obtain a coherent and comprehensive outcome. The second...
Aggregation operators from the ancient NC and EM point of view
This paper deals with the satisfaction of the well-known Non-Contradiction (NC) and Excluded-Middle (EM) principles within the framework of aggregation operators. Both principles are interpreted in a non-standard way, based on self-contradiction (as in Ancient Logic) instead of falsity (as in Modern Logic). The logical negation is represented by means of strong negation functions, and conditions are given both for those aggregation operators that satisfy NC/EM with respect to (w.r.t.) some given...
Algebra of Polynomially Bounded Sequences and Negligible Functions
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation between polynomially...
Algebraic analysis of LPC+Ch calculus
Algebraic and relational semantics for tense logics
Algebraic Approach to Algorithmic Logic
We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra structure...
Algebraic axiomatization of tense intuitionistic logic
We introduce two unary operators G and H on a relatively pseudocomplemented lattice which form an algebraic axiomatization of the tense quantifiers “it is always going to be the case that” and “it has always been the case that”. Their axiomatization is an extended version for the classical logic and it is in accordance with these operators on many-valued Łukasiewicz logic. Finally, we get a general construction of these tense operators on complete relatively pseudocomplemented lattice which is a...