TY  - GENERIC
DO  - 
UR  - http://dx.doi.org/
TI  - On Sets ${\mathcal X} \subseteq$ $\mathbb N$ Whose Finiteness Implies That We Know an Algorithm Which for Every $n \in \mathbb N$ Decides the Inequality $\max(\mathcal X)<n$
T2  - Preprints
AU  - Tyszka, Apoloniusz
PY  - 2019
DA  - 2019/04/09
PB  - Preprints