Master project in logic
The project is in proof theory where we investigate incompleteness phenomena - given a formal framework built over a datastructure there will be properties which can be expressed in the language and are true - but cannot shown to be true in the formal framework. The project can be extended to a ph.d.-project.
Using binary trees
I have developed an ordering of finite trees which can be used to calibrate formal frameworks and which shows the incompleteness phenomena in a perspicuous way. The detailed development of this has never been done.
| Type: | 60 ECTS |
| Veileder(e): | Herman Ruge Jervell |
| Tilknyttet forskningsgruppe(r): | LNS |