Primitive Recursive Function | Primitive Recursive Function, Primitive Recursive Arithmetic, Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number

Lambert M. Surhone (u. a.)

ISBN 10: 6130341997 / ISBN 13: 9786130341992

Published by OmniScriptum, 2026

About this Item

Primitive Recursive Function | Primitive Recursive Function, Primitive Recursive Arithmetic, Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130341992 | 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 # 101373077

Bibliographic Details

• Title: Primitive Recursive Function | Primitive Recursive Function, Primitive Recursive Arithmetic, Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6130341997
• ISBN 13: 9786130341992
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 7D millimeters 220 millimeters width by 150 millimeters height by 7 millimeters depth
• Weight: 185 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. The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions. The term was coined by Rózsa Péter. In computability theory, primitive recursive functions are a class of functions which form an important building block on the way to a full formalization of computability. These functions are also important in proof theory. Most of the functions normally studied in number theory are primitive recursive. For example: addition, division, factorial, exponential and the nth prime are all primitive recursive. So are many approximations to real-valued functions. In fact, it is difficult to devise a function that is not primitive recursive, although some are known. The set of primitive recursive functions is known as PR in complexity theory. Every primitive recursive function is a general recursive function.