Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Truth-Table Complete Computably Enumerable Sets Read chapter Read first chapter

2003 | OriginalPaper | Chapter

On Self-Embeddings of Computable Linear Orders

Authors : Steffen Lempp, Andrei S. Morozov, Charles F. D. McCoy, D. Reed Solomon

Published in: Computability and Models

Publisher: Springer US

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

We show the existence of a computable linear order without nontrivial 0′-computable self-embedding.

previous chapter On Primitive Recursive Permutations
next chapter Definable Relations on the Computably Enumerable Degrees
Metadata
Title
On Self-Embeddings of Computable Linear Orders
Authors
Steffen Lempp
Andrei S. Morozov
Charles F. D. McCoy
D. Reed Solomon
Copyright Year
2003
Publisher
Springer US
Book
Computability and Models

Print ISBN: 978-1-4613-5225-9

Electronic ISBN: 978-1-4615-0755-0

Copyright Year: 2003

DOI
https://doi.org/10.1007/978-1-4615-0755-0_11

Premium Partner

    Image Credits