3 citations · 4 across the 4 of their papers we have counts for
4 papers
The axiomatic power of Kolmogorov complexity
Laurent Bienvenu, Andrei Romashchenko, Alexander Shen +2
The famous Gödel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements wo…
Embeddings into the countable atomless Boolean algebra
Stijn Vermeeren
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of . Along the way, we discuss all re…
A combinatorial solution to LIMO 2010 question 10
Stijn Vermeeren
Problem 10 of the Landelijke Interuniversitaire Mathematische Olympiade 2010 asks for a proof that all matrices in a certain family are nilpotent. Both model solutions prove this u…
Sequences and nets in topology
Stijn Vermeeren
In a metric space, such as the real numbers with their standard metric, a set A is open if and only if no sequence with terms outside of A has a limit inside A. Moreover, a metric…