DuckCorp Dico

Found one definition

1.                 From The Free On-line Dictionary of Computing (19 January 2023):
                   
   
   
                   
                     
   bounded
      <theory> In domain theory, a subset S of a cpo X is
      bounded if there exists x in X such that for all s in S, s <=
      x.  In other words, there is some element above all of S.  If
      every bounded subset of X has a least upper bound then X is
      boundedly complete.
      ("<=" is written in LaTeX as \subseteq).
      (1995-02-03)