@article{201811.0301,
	doi = {},
	url = {https://doi.org/},
	year = 2019,
	month = {April},
	publisher = {Preprints},
	author = {Apoloniusz Tyszka},
	title = {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$},
	journal = {Preprints}
}