R.S.R. Zijlstra (2014) Calculating the size of the [negation,disjunction] fragment of intuitionistic logic. Bachelor's Thesis, Computing Science.

Text
Project.pdf  Published Version Download (507kB)  Preview 

Text
toestemming.pdf  Other Restricted to Backend only Download (20kB) 
Abstract
The Dedekind Numbers dn, named after the German mathematician Richard Dedekind (October 6, 1831  February 12, 1916), is a sequence of integers which grows very fast. The number dn are the number of monotone subsets of the powerset of a set with n elements. The latest known number in this series is d8 = 56,130,437,228,687,557,907,788. Recently A.T. Zijlstra recreated the method of computing this number with the method of D. Wiedemann. The method was implemented in C++ and parallelized using MPI. This thesis will focus on the calculation of a different sequence. Intuitionistic logic is a logic which differs from classical logic. The number of nonequivalent formulae in this logic is infinite but when we restrict the connectives used in the formulae the number of nonequivalent formulae becomes finite. We will focus only on the negation and disjunction connectives. We will calculate the size of this logic utilizing an extension of Wiedemann's method.
Item Type:  Thesis (Bachelor's Thesis) 

Degree programme:  Computing Science 
Thesis type:  Bachelor's Thesis 
Language:  English 
Date Deposited:  15 Feb 2018 08:01 
Last Modified:  15 Feb 2018 08:01 
URI:  http://fse.studenttheses.ub.rug.nl/id/eprint/12314 
Actions (login required)
View Item 