scholarly journals A common maximal element of condensing mappings

2020 ◽  
Vol 21 (1) ◽  
pp. 125-132
Author(s):  
Liang-Ju Chu ◽  
◽  
Chien-Hao Huang ◽  
Keyword(s):  
1979 ◽  
Vol 28 (1) ◽  
pp. 23-26
Author(s):  
Kung-Fu Ng

AbstractLet K be a nonempty compact set in a Hausdorff locally convex space, and F a nonempty family of upper semicontinuous convex-like functions from K into [–∞, ∞). K is partially ordered by F in a natural manner. It is shown among other things that each isotone, upper semicontinuous and convex-like function g: K → [ – ∞, ∞) attains its K-maximum at some extreme point of K which is also a maximal element of K.Subject classification (Amer. Math. Soc. (MOS) 1970): primary 46 A 40.


2021 ◽  
pp. 1-41
Author(s):  
Atefeh Keshavarzi Zafarghandi ◽  
Rineke Verbrugge ◽  
Bart Verheij

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling argumentation allowing general logical satisfaction conditions and the relevant argument evaluation. Different criteria used to settle the acceptance of arguments are called semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. However, the notion of strongly admissible semantics studied for abstract argumentation frameworks has not yet been introduced for ADFs. In the current work we present the concept of strong admissibility of interpretations for ADFs. Further, we show that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as the maximal element. We also present algorithms to answer the following decision problems: (1) whether a given interpretation is a strongly admissible interpretation of a given ADF, and (2) whether a given argument is strongly acceptable/deniable in a given interpretation of a given ADF. In addition, we show that the strongly admissible semantics of ADFs forms a proper generalization of the strongly admissible semantics of AFs.


1994 ◽  
Vol 59 (2) ◽  
pp. 534-542
Author(s):  
Alan S. Stern ◽  
Stanisław S. Świerczkowski

In 1962 Jan Mycielski proposed a very general notion of interpretability [M1]. This led to the question whether a given theory could be interpreted in the disjoint union of two theories, without being interpretable in any of them. He argued that in such a case it would be presumably simpler to study each of these theories separately, and hence conjectured that this situation can never occur for any of the well-known theories of mathematics. This conjecture has now been verified for the following theories (see [MPS], [P], [S1, 2]): ELO (endless, i.e., without maximal element, linear order), Th(〈ℚ, ≤〉), Th(〈ω, ≤〉) and all sequential theories (those which can code finite sequences of elements of their models). The latter include PA, ZF, GB and Th(〈ω,+,·〉). In view of these confirmations it became ever more plausible that the conjecture is valid also for RCF (real closed fields), i.e., for Th(〈ℝ,≤,+,·,0,1〉). In the present paper we show that Mycielski's conjecture is valid for a class of theories which includes RCF and OF (ordered fields).We consider only theories with equality and without function symbols. Interpretations will be meant local, multidimensional, and with parameters, as defined in [M1], [M2] and surveyed in [MPS] (for a recent definition see also [S2]). We shall write T0 ≪ T1 to say that T0 is interpretable in T1 (or that T1 interprets T0), and this will mean that for every theorem α of T0 there is an interpretation of α in T1.


2014 ◽  
Vol 2014 ◽  
pp. 1-18
Author(s):  
Haishu Lu ◽  
Qingwen Hu ◽  
Yulin Miao

A maximal element theorem is proved in finite weakly convex spaces (FWC-spaces, in short) which have no linear, convex, and topological structure. Using the maximal element theorem, we develop new existence theorems of solutions to variational relation problem, generalized equilibrium problem, equilibrium problem with lower and upper bounds, and minimax problem inFWC-spaces. The results represented in this paper unify and extend some known results in the literature.


2009 ◽  
Vol 81 (1) ◽  
pp. 47-57 ◽  
Author(s):  
HONGBO HUA

AbstractLet G be a simple undirected graph. The energy E(G) of G is the sum of the absolute values of the eigenvalues of the adjacent matrix of G, and the Hosoya index Z(G) of G is the total number of matchings in G. A tree is called a nonconjugated tree if it contains no perfect matching. Recently, Ou [‘Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching’, Appl. Math. Lett.19 (2006), 652–656] determined the unique element which is maximal with respect to Z(G) among the family of nonconjugated n-vertex trees in the case of even n. In this paper, we provide a counterexample to Ou’s results. Then we determine the unique maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated n-vertex trees for the case when n is even. As corollaries, we determine the maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated chemical trees on n vertices, when n is even.


1973 ◽  
Vol 13 (4) ◽  
pp. 349-350
Author(s):  
L. F. Kosvintsev

Sign in / Sign up

Export Citation Format

Share Document