Maximal set | Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism

Frederic P. Miller (u. a.)

ISBN 10: 6132630872 / ISBN 13: 9786132630872

Published by OmniScriptum, 2026

About this Item

Maximal set | Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786132630872 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 134693790

Bibliographic Details

• Title: Maximal set | Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6132630872
• ISBN 13: 9786132630872
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 137 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In recursion theory, the mathematical theory of computability, a maximal set is a coinfinite recursively enumerable subset A of the natural numbers such that for every further recursively enumerable subset B of the natural numbers, either B is cofinite or B is a finite variant of A or B is not a superset of A. This gives an easy definition within the lattice of the recursively enumerable sets.