Higman's lemma and its computational content

Helmut Schwichtenberg, Monika Seisenberger and Franziskus Wiesnet
Advances in proof theory. Birkhäuser, Cham, 2016. 353-375.

Introduction to Minlog

Franziskus Wiesnet
Proof and Computation, pages 233-288. World Scientific, 2018.

An algorithmic approach to the existence of ideal objects in commutative algebra

Thomas Powell, Peter Schuster and Franziskus Wiesnet
Proceedings of WoLLIC '19, LNCS 11541: 533–549, 2019

Logic for exact real arithmetic

Helmut Schwichtenberg and Franziskus Wiesnet
Logical Methods in Computer Science, Volume 17, Issue 2, 2021

Preprints

Limits of real numbers in the binary signed digit representation

Franziskus Wiesnet and Nils Köpp
Submitted

A universal algorithm for Krull's theorem

Thomas Powell, Peter Schuster and Franziskus Wiesnet
Submitted

Rates of convergence for asymptotically weakly contractive mappings in normed spaces

Thomas Powell and Franziskus Wiesnet
Submitted

An algorithmic version of Zariski’s lemma

Franziskus Wiesnet
Submitted

Master thesis

Konstrukive Analysis mit exakten reellen Zahlen

Franziskus Wiesnet
Supervised by Helmut Schwichtenberg

Ludwig-Maximilians Universität München