Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorKorbmacher, Johannes
dc.contributor.authorSwaanen, Bram
dc.date.accessioned2025-08-21T00:05:20Z
dc.date.available2025-08-21T00:05:20Z
dc.date.issued2025
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/49881
dc.description.abstractWe investigate the possibility of formalizing the proof of the conservativity of TB in Halbach [1, p. 55f], in the interactive theorem prover Lean. Lean is based on dependent type theory, which has a natural connection to the Brouwer-Heyting-Kolmogorov (BHK) interpretation of intuitionistic logic via the Curry-Howard correspondence, effectively reducing checking for proof correctness to type-correctness. The theorem prover already features an extensive library of undergraduate math, called mathlib, but so far little work in Axiomatic Theories of Truth has been formalized. Hence, we present our conceptual work of explicitizing implicit steps in Halbach's proof as well as their translation to Lean's type theory, focusing on lessons to be drawn for the future work in the formalization in this area of research. [1] Volker Halbach. Axiomatic Theories of Truth. Cambridge University Press, 1 edition, 2011.
dc.description.sponsorshipUtrecht University
dc.language.isoEN
dc.subjectFormalizing Axiomatic Theories of Truth
dc.titleFormalizing Axiomatic Theories of Truth
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsAxiomatic Theories of Truth; Formalization; Lean Theorem Prover; Dependent Type Theory; Conservativity of TB over PA
dc.subject.courseuuArtificial Intelligence
dc.thesis.id52014


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record