On computable presentations of some functional lattices (Q1044671)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5650089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computable presentations of some functional lattices |
scientific article; zbMATH DE number 5650089 |
Statements
On computable presentations of some functional lattices (English)
0 references
18 December 2009
0 references
In the paper under review the author describes several lattices which have no computable presentations. They are the lattice of all computable order-theoretic automorphisms of the rational numbers, the lattice of the monotonic functions on the natural numbers etc. It is also proved that the lattice of all computable mappings defined on the rational numbers has a computable presentation.
0 references
recursive model
0 references
computable presentation
0 references
computable automorphisms
0 references
lattice-ordered group
0 references
functional lattice
0 references
computable model
0 references
0.7742345333099365
0 references
0.750366747379303
0 references
0.7303724884986877
0 references
0.7226232886314392
0 references
0.7194092273712158
0 references
