Konsep Himpunan dalam Matematika Diskrit

Authors

  • Olivia Lisna Wati Universitas Muhammadiyah Jambi
  • Nayla Desviona Universitas Muhammadiyah Jambi
  • Novi Permasari Universitas Muhammadiyah Jambi
  • M. David Alfikri Universitas Muhammadiyah Jambi
  • Raja Abdul Rahman Shah Universitas Muhammadiyah Jambi

DOI:

https://doi.org/10.62383/algoritma.v4i1.922

Keywords:

Data Structures, Discrete Mathematics, Formal Logic, Set Operations, Set Theory

Abstract

Set theory is one of the fundamental concepts underlying the structure of discrete mathematics and computer science and plays a crucial role in understanding various advanced topics, such as relations, functions, mathematical logic, and other discrete structures. This concept serves as the foundation for developing a systematic and structured mathematical mindset. This paper aims to explain the fundamental concepts of set theory, review its significance in discrete mathematics, and outline how to present sets and basic operations on sets, such as union, intersection, complement, and difference. The method used in this paper is a literature study by reviewing, collecting, reading, and analyzing data from various relevant written sources, both textbooks and scientific articles. Through this study, students are expected to be able to understand set theory more comprehensively. Thus, it can be concluded that set theory is not merely an introductory topic, but rather a formal framework that defines the validity of logic and structure in modern discrete systems.

 

Downloads

Download data is not yet available.

References

Epp, S. S. (2011). Discrete mathematics with applications (4th ed.). Cengage Learning.

Fitrah, M., & Fathurrahman. (2022). Matematika diskrit berbasis hasil penelitian pada ilmu komputer. Deepublish.

Grimaldi, R. P. (2014). Discrete and combinatorial mathematics: An applied introduction (5th ed.). Pearson Education.

Jabnabillah, F., Astiati, S. D., & Ilham, I. (2021). Matematika diskrit. Penerbit Widina.

Johnsonbaugh, R. (2017). Discrete mathematics (8th ed.). Pearson Education.

Kolman, B., Busby, R. C., & Ross, S. (2018). Discrete mathematical structures (6th ed.). Pearson.

Levin, O. (2016). Discrete mathematics: An open introduction. CreateSpace Independent Publishing.

Maskhuliah, P., Rumaf, D. M., & Hayoto, F. N. (2025). Konsep himpunan dalam matematika: Definisi, penyajian, jenis, dan sifat operasi. Aljabar: Jurnal Ilmuan Pendidikan, Matematika dan Kebumian, 5(1), 1–10.

Munir, R. (2016). Matematika diskrit. Informatika Bandung.

Nasution, M. K. M. (2018). Pengantar matematika diskrit. USU Press.

Rosen, K. H. (2019). Discrete mathematics and its applications (8th ed.). McGraw-Hill Education.

Siang, J. J. (2014). Matematika diskrit dan aplikasinya pada ilmu komputer. Andi Offset.

Sitorus, Z. (2020). Matematika diskrit: Konsep dan implementasi dalam komputer. Penerbit Informatika.

Suryanto, A. (2015). Matematika diskrit. Graha Ilmu.

Susilo, A., & Widodo, S. (2017). Logika matematika dan matematika diskrit. Andi Offset.

Downloads

Published

2026-01-22

How to Cite

Olivia Lisna Wati, Nayla Desviona, Novi Permasari, M. David Alfikri, & Raja Abdul Rahman Shah. (2026). Konsep Himpunan dalam Matematika Diskrit. Algoritma : Jurnal Matematika, Ilmu Pengetahuan Alam, Kebumian Dan Angkasa, 4(1), 44–51. https://doi.org/10.62383/algoritma.v4i1.922

Similar Articles

<< < 1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.