IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-31317-7_28.html
   My bibliography  Save this book chapter

Basic Tools, Increasing Functions, and Closure Operations in Generalized Ordered Sets

In: Contributions in Mathematics and Engineering

Author

Listed:
  • Árpád Száz

    (University of Debrecen, Institute of Mathematics)

Abstract

Having in mind Galois connections, we establish several consequences of the following definitions.An ordered pair X( ≤ ) = (X, ≤ ) consisting of a set X and a relation ≤ on X is called a goset (generalized ordered set).For any x ∈ X and $$A \subseteq X$$ , we write x ∈ ub X (A) if a ≤ x for all a ∈ A, and $$x \in \mathop{\mathrm{int}}\nolimits _{X}(A)$$ if $$\mathop{\mathrm{ub}}\nolimits _{X}(x) \subseteq A$$ , where $$\mathop{\mathrm{ub}}\nolimits _{X}(x) =\mathop{ \mathrm{ub}}\nolimits _{X}{\bigl (\{x\}\bigr )}$$ .Moreover, for any $$A \subseteq X$$ , we also write $$A \in \mathcal{U}_{X}$$ if $$A \subseteq \mathop{\mathrm{ub}}\nolimits _{X}(A)$$ , and $$A \in \mathcal{T}_{X}$$ if $$A \subseteq \mathop{\mathrm{int}}\nolimits _{X}(A)$$ . And in particular, $$A \in \mathcal{E}_{X}$$ if $$\mathop{\mathrm{int}}\nolimits _{X}(A)\neq \emptyset$$ .A function f of one goset X to another Y is called increasing if u ≤ v implies f(u) ≤ f(v) for all u, v ∈ X.In particular, an increasing function $$\varphi$$ of X to itself is called a closure operation if $$x \leq \varphi (x)$$ and $$\varphi {\bigl (\varphi (x)\bigr )} \leq \varphi (x)$$ for all x ∈ X.The results obtained extend and supplement some former results on increasing functions and can be generalized to relator spaces.

Suggested Citation

  • Árpád Száz, 2016. "Basic Tools, Increasing Functions, and Closure Operations in Generalized Ordered Sets," Springer Books, in: Panos M. Pardalos & Themistocles M. Rassias (ed.), Contributions in Mathematics and Engineering, pages 551-616, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-31317-7_28
    DOI: 10.1007/978-3-319-31317-7_28
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-31317-7_28. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.