Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Multisets in Mathematics and Software Engineering, Slides of Mathematical logic

Multisets, a non-Cantorian set concept where elements can repeat, and discusses their cardinality. The document also covers multiset representations and provides examples of finding prime factors and their multiplicities, as well as the application of multisets in software engineering with a programming example.

Typology: Slides

2022/2023

Uploaded on 09/27/2022

DuongKut
DuongKut 🇻🇳

3 documents

1 / 7

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Session 2:
Mutilsets
pf3
pf4
pf5

Partial preview of the text

Download Multisets in Mathematics and Software Engineering and more Slides Mathematical logic in PDF only on Docsity!

Session 2:

Mutilsets

Introduction to Multiset

A multiset (mset, for short) is an unordered collection of

objects (called the elements) in which, unlike a standard

(Cantorian) set, elements are allowed to repeat. In other

words, an mset is a set to which elements may belong more

than once, and hence it is a non-Cantorian set.

The number of distinct elements in an mset M (which need

not be finite) and their multiplicities jointly determine its

cardinality, denoted by C(M). In other words, the cardinality

of an mset is the sum of multiplicities of all its elements.

Linear form

Linear form

THẢO LUẬN NHÓM

Present the application of set and multiset in software

engineering? Give specific programming example

7