![[HARLEQUIN]](../Graphics/Harlequin-Small.gif)
![[Common Lisp HyperSpec (TM)]](../Graphics/HyperSpec-Small.gif)
![[Previous]](../Graphics/Prev.gif)
![[Up]](../Graphics/Up.gif)
![[Next]](../Graphics/Next.gif)
Lists are sometimes viewed as sets by considering their elements unordered and by assuming there is no duplication of elements.
adjoin nset-difference set-difference union intersection nset-exclusive-or set-exclusive-or nintersection nunion subsetp
Figure 14-5. Some defined names related to sets.
![[Starting Points]](../Graphics/Starting-Points.gif)
![[Contents]](../Graphics/Contents.gif)
![[Index]](../Graphics/Index.gif)
![[Symbols]](../Graphics/Symbols.gif)
![[Glossary]](../Graphics/Glossary.gif)
![[Issues]](../Graphics/Issues.gif)