Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/375937
Title: Formalizing Finite Set Combinatorics in Type Theory
Researcher: Abhishek Kr Singh
Guide(s): N Raja
Keywords: Engineering and Technology
Computer Science
Computer Science Information Systems
University: Tata Institute of Fundamental Research
Completed Date: 2020
Abstract: newline
Pagination: 
URI: http://hdl.handle.net/10603/375937
Appears in Departments:School of Technology and Computer Science (STCS)

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File108.62 kBAdobe PDFView/Open
02_declaration.pdf46.29 kBAdobe PDFView/Open
03_contents.pdf138.27 kBAdobe PDFView/Open
04_chapter 1.pdf300.32 kBAdobe PDFView/Open
05_chapter 2.pdf288.88 kBAdobe PDFView/Open
06_chapter 3.pdf240.46 kBAdobe PDFView/Open
07_chapter 4.pdf322.41 kBAdobe PDFView/Open
08_chapter 5.pdf80.18 kBAdobe PDFView/Open
09_bibliography.pdf96.68 kBAdobe PDFView/Open
80_recommendation.pdf301.19 kBAdobe PDFView/Open
a_acknowledgement.pdf1.57 MBAdobe PDFView/Open
b_preface.pdf47.24 kBAdobe PDFView/Open
c_list of tables and figures.pdf122.82 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: