Overview
Current research
Necessarily non-analytic induction proofs
Collaborating with Eric Johannesson.
Most of this is very outdated. Some manuscripts contain errors that I have
corrected in manuscripts not yet made public. Updates expected in April
May June 2022 2023 sometime in the future. (In the meantime,
anyone interested may contact me for unfinished manuscripts.)
For the latest technical results see the summary. For a more conceptual discussion see the Stockholm Logic Seminar presentation. For slides, the JAF 38 presentation is more or less a condensed version of the FLoV Logic Seminar presentation (also, the linked blog post addresses some problems in the slides).
- Summary of results
- version 2020-01-22:
- all versions
- A note reflecting on terminology
-
JAF 38 presentation (2019)
- extended abstract (pdf)
- slides (pdf)
- blog post adressing some feedback
- The FLoV Logic Seminar
presentation (2019)
- slides (pdf)
- blog post adressing some feedback
- Stockholm Logic Seminar presentation (2017)
- MathOverflow: When must one strengthen one’s induction hypothesis? (2017)
- old material
- all files
Ellipsis usage in mathematics
Collaborating with Stefan Buijsman.
- Stockholm PhD student seminar in theoretical philosophy
presentation (2018)
manuscript: - more material forthcoming
Past research
A Coq formalization of partial combinatory algebras and realizability
- GitHub repository:
https://github.com/anderslundstedt/pca-realizability - Realizability in Coq (2015)
MSc thesis in mathematics - A way to handle substitutions in first-order logic (2016)
A note describing and motivating the formulation of first-order logic used
pdf
My BA thesis in philosophy
- Euklides princip och oändliga mängders storlek (2015)
[English: Euclid’s principle and the sizes of infinite sets]
pdf