MoL-2024-13: Van Santvliet, Hannah (2024) Parameterizing the Notion of Automatability in Proof Complexity. [Report]
![[thumbnail of MoL-2024-13.text.pdf]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text
MoL-2024-13.text.pdf - Published Version Download (803kB) |
Abstract
In the thesis, we extend the proof-theoretic notion of automatability to a parameterized version called fpt-automatability. Automatability gives an indication whether for a proof system automated theorem search is feasible. We develop parameterized automatability results that enrich the theory of automatability with a collection of graph parameters for the proof systems Extended Frege and resolution. We use methods such as interpolation and polynomial simulation for bounded arithmetic formulas, and we exploit properties for intersection graphs. Also, with fpt-dominance, we show relationships between the parameters.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2024-13 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2024 |
| Subjects: | Logic Mathematics |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 22 Oct 2024 12:59 |
| Last Modified: | 22 Oct 2024 13:19 |
| URI: | https://eprints.illc.uva.nl/id/eprint/2331 |
Actions (login required)
 |
View Item |
