Sibma, Lisanne (2025) Bounded countermodels for fragments of FLec. Master's Thesis / Essay, Mathematics.
|
Text
mMATH2025SibmaLI.pdf Download (626kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf Restricted to Registered users only Download (154kB) |
Abstract
The bounded finite model property refers to the following problem: given an input formula that is not provable in the logic, is there a finite countermodel that invalidates the formula, and if so, can we give a bound on the size of the model in terms of the size of the input formula. We have investigated this question in the substructural logic FLec, in particular its fragments for the logical connectives of FLec. FLec algebras are constructed using a closure operator and are shown to form valid FLec algebras that do not validate unprovable formulas. The proof of finiteness of these countermodels gives us a tool to bound these countermodels. We have found bounds for the full fragments for the connectives fusion, conjunction and disjunction and for the non-nested fragment for implication. These bounds are all based on the size of the input formula and use the properties of the rules of the logical connectives.
| Item Type: | Thesis (Master's Thesis / Essay) |
|---|---|
| Supervisor name: | Frumin, D. and Ramanayake, D.R.S. and Top, J. |
| Degree programme: | Mathematics |
| Thesis type: | Master's Thesis / Essay |
| Language: | English |
| Date Deposited: | 05 Aug 2025 08:11 |
| Last Modified: | 05 Aug 2025 08:11 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/36671 |
Actions (login required)
 |
View Item |