We introduce a concept of implication groupoid which is an essential generalization of the implication reduct of intuitionistic logic, i.e. a Hilbert algebra. We prove several connections among ideals, deductive systems and congruence kernels which even coincide whenever our implication groupoid is distributive.
In 2015, a new class of fuzzy implications, called ordinal sum implications, was proposed by Su et al. They then discussed the distributivity of such ordinal sum implications with respect to t-norms and t-conorms. In this paper, we continue the study of distributivity of such ordinal sum implications over two newly-born classes of aggregation operators, namely overlap and grouping functions, respectively. The main results of this paper are characterizations of the overlap and/or grouping function...
This paper deals with implications defined from disjunctive uninorms by the expression where is a strong negation. The main goal is to solve the functional equation derived from the distributivity condition of these implications over conjunctive and disjunctive uninorms. Special cases are considered when the conjunctive and disjunctive uninorm are a -norm or a -conorm respectively. The obtained results show a lot of new solutions generalyzing those obtained in previous works when the implications...
In this paper we extend the concept of measuring difference between two fuzzy subsets defined on a finite universe. The first main section is devoted to the local divergence measures. We propose a divergence measure based on the scalar cardinalities of fuzzy sets with respect to the basic axioms. In the next step we introduce the divergence based on the generating function and the appropriate distances. The other approach to the divergence measure is motivated by class of the rational similarity...
It is shown that divisible effect algebras are in one-to-one correspondence with unit intervals in partially ordered rational vector spaces.
In this article, we formalize the definition of divisible ℤ-module and its properties in the Mizar system [3]. We formally prove that any non-trivial divisible ℤ-modules are not finitely-generated.We introduce a divisible ℤ-module, equivalent to a vector space of a torsion-free ℤ-module with a coefficient ring ℚ. ℤ-modules are important for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm [15], cryptographic systems with lattices [16] and coding theory [8].
In some economic or social division problems, we may encounter uncertainty of claims, that is, a certain amount of estate has to be divided among some claimants who have individual claims on the estate, and the corresponding claim of each claimant can vary within a closed interval or fuzzy interval. In this paper, we classify the division problems under uncertainty of claims into three subclasses and present several division schemes from the perspective of axiomatizations, which are consistent with...
Gli insiemi parziali sono coppie di sottoinsiemi di , dove . Gli insiemi parziali su costituiscono una DMF-algebra, ossia un'algebra di De Morgan in cui la negazione ha un solo punto fisso. Dimostriamo che ogni DMF-algebra è isomorfa a un campo di insiemi parziali. Utilizzando gli insiemi parziali su come aperti, introduciamo il concetto di spazio topologico parziale su . Infine associamo ad ogni DMF-algebra uno spazio topologico parziale i cui clopen compatti costituiscono un campo d'insiemi...
The basic framework of domain -calculus was formulated in [39] more than ten years ago. This paper provides an improved formulation of a fragment of the -calculus without function space or powerdomain constructions, and studies some open problems related to this -calculus such as decidability and expressive power. A class of language equations is introduced for encoding -formulas in order to derive results related to decidability and expressive power of non-trivial fragments of the domain -calculus....
The basic framework of domain μ-calculus was formulated in [39] more than ten years ago. This paper provides an improved formulation of a fragment of the μ-calculus without function space or powerdomain constructions, and studies some open problems related to this μ-calculus such as decidability and expressive power. A class of language equations is introduced for encoding μ-formulas in order to derive results related to decidability and expressive power of non-trivial fragments of the domain...
We introduce a domain-free λµ-calculus of call-by-value as a short-hand for the second order Church-style. Our motivation comes from the observation that in Curry-style polymorphic calculi, control operators such as callcc-operators cannot, in general, handle correctly the terms placed on the control operator's left, so that the Curry-style system can fail to prove the subject reduction property. Following the continuation semantics, we also discuss the notion of values in classical system,...
Let A be an analytic family of sequences of sets of integers. We show that either A is dominated or it contains a continuum of almost disjoint sequences. From this we obtain a theorem by Shelah that a Suslin c.c.c. forcing adds a Cohen real if it adds an unbounded real.