Lantinga, Scott (2025) An Interactive Tool for Exploring Rule Permutations in Structural Proof Theory. Bachelor's Thesis, Computing Science.
|
Text
bCS2025LantingaS.pdf Download (1MB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf Restricted to Registered users only Download (175kB) |
Abstract
In Structural Proof Theory, rules of inference are the cornerstone of sequent calculus, as every proof system is determined by a collection of these. In this field, the study of them is a central theme, and exploring possibilities in the permutation of such rules is, therefore, a common sight. Currently, most of this work is still done manually, which takes away valuable time that could be spent on the theory itself. In this paper, our aim is to develop a software tool that takes care of the structurally repetitive patterns that appear when working on rule permutations, which can be described as alternative orders in which these rules are applied in a proof. The tool should actively assist scientists in their proving process, reducing the number of potential errors and enforcing the valid traversal of proofs, which should subsequently lead to increased productivity and a better focus on the actual subject matter.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Ramanayake, D.R.S. and Rodrigues Greati, V. |
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 18 Jul 2025 06:42 |
| Last Modified: | 18 Jul 2025 06:42 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/36385 |
Actions (login required)
 |
View Item |