| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 431372 | The Journal of Logic and Algebraic Programming | 2010 | 9 Pages |
Abstract
We prove in a uniform way that the following lattices have no computable presentations: the lattice of all computable order theoretic automorphisms of the rational numbers; the lattice of the computable functions from the rational numbers to the rational numbers having continuous extensions to functions on the real numbers; and the lattice of the monotonic functions on the natural numbers. Nevertheless, we prove that the lattice of all computable mappings from the rational numbers to the rational numbers has a computable presentation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
