Javascript must be enabled for the correct page display

Underlying mathematical structures in Aristotelian Diagrams

Nijhof, Corine (2018) Underlying mathematical structures in Aristotelian Diagrams. Bachelor's Thesis, Mathematics.

[img]
Preview
Text
bMATH_2018_NijhofC.pdf

Download (386kB) | Preview
[img] Text
toestemming.pdf
Restricted to Registered users only

Download (119kB)

Abstract

In a recent paper, Lorenz Demey presents an algorithm to compute the maximal Boolean complexity of a family of Aristotelian diagrams. However, the underlying mathematical notions, involving partial orders extended with an involutive negation function, are hardly worked out. The purpose of this thesis is to provide a critical analysis of Demey’s paper and related work from a mathematical viewpoint. In a clear and understandable way, the theory of Aristotelian diagrams is connected to the mathematical notions of Hasse diagrams and Boolean algebras. Demey’s algorithm is rewritten and applied in several examples of Aristotelian families.

Item Type: Thesis (Bachelor's Thesis)
Supervisor:
Supervisor nameSupervisor E mail
Renardel de Lavalette, G.R.G.R.Renardel.de.Lavalette@rug.nl
Top, J.J.Top@rug.nl
Degree programme: Mathematics
Thesis type: Bachelor's Thesis
Language: English
Date Deposited: 15 Nov 2018
Last Modified: 19 Nov 2018 13:13
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/18820

Actions (login required)

View Item View Item