Hostname: page-component-68c7f8b79f-mk7jb Total loading time: 0 Render date: 2025-12-16T01:22:14.874Z Has data issue: false hasContentIssue false

Constructivisation through Induction and Conservation

Published online by Cambridge University Press:  15 December 2025

Giulio Fellin*
Affiliation:
University of Helsinki, University of Trento, University of Verona. 2022.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The topic of this thesis lies in the intersection between proof theory and algebraic logic. The main object of discussion, constructive reasoning, was introduced at the beginning of the twentieth century by Brouwer, who followed Kant’s explanation of human intuition of spacial forms and time points: these are constructed step by step in a finite process by certain rules, mimicking constructions with straightedge and compass and the construction of natural numbers, respectively.

The aim of the present thesis is to show how classical reasoning, which admits some forms of indirect reasoning, can be made more constructive. The central tool that we are using are induction principles, methods that capture infinite collections of objects by considering their process of generation instead of the whole class. We start by studying the interplay between certain structures that satisfy induction and the calculi for some non-classical logics. We then use inductive methods to prove a few conservation theorems, which contribute to answering the question of which parts of classical logic and mathematics can be made constructive.

Abstract prepared by Giulio Fellin

E-mail: giulio.fellin@univr.it

URL: https://researchportal.helsinki.fi/en/publications/constructivisation-through-induction-and-conservation

Information

Type
Thesis Abstract
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Footnotes

Supervised by Sara Negri, Peter Schuster, and Annika Kanckos