9786139301065 (3 results)

ISBN

Refine your search

  • Books (3)

  • New (3)

to

Custom price range (US$)

to

    • Published by Omniscriptum

      6139301068 / 9786139301065

      • Softcover
      • Print on Demand

      Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

      5-star seller
      Contact seller

      Condition: New

      US$ 64.89

      US$ 70.96 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, recursively inseparable sets are pairs of sets of natural numbers that cannot be 'se

    • Published by OmniScriptum, 2026

      6139301068 / 9786139301065

      • Softcover
      • Print on Demand

      Seller: preigu, Osnabrück, Germanypreigu

      5-star seller
      Contact seller

      Condition: New

      US$ 203.87

      US$ 80.70 shipping 
      Ships from Germany to U.S.A.

      Quantity: 5 available

      Taschenbuch. Condition: Neu. Recursively Inseparable Sets | Computability theory, Recursive set, Gödel's incompleteness theorems | Dagda Tanner Mattheus | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786139301065 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]p

    • Published by Omniscriptum Jun 2026, 2026

      6139301068 / 9786139301065

      • Softcover
      • Print on Demand

      Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

      5-star seller
      Contact seller

      Condition: New

      US$ 256.48

      US$ 69.17 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware OmniScriptum SRL, Str. Armeneasca 28/1, office 1, 2012 Chisinau 196 pp. Englisch.