This HTML5 document contains 143 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-kohttp://ko.dbpedia.org/resource/
n18https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-svhttp://sv.dbpedia.org/resource/
freebasehttp://rdf.freebase.com/ns/
dbpedia-pthttp://pt.dbpedia.org/resource/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-vihttp://vi.dbpedia.org/resource/
dbpedia-frhttp://fr.dbpedia.org/resource/
dbpedia-zhhttp://zh.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
dbpedia-jahttp://ja.dbpedia.org/resource/

Statements

Subject Item
dbr:Proof_sketch_for_Gödel's_first_incompleteness_theorem
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:List_of_first-order_theories
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Monus
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Path_ordering_(term_rewriting)
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Hyperoperation
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Peano_axioms
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Richard_Dedekind
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Increment_and_decrement_operators
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Induction_variable
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Initial_algebra
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Intuitionistic_type_theory
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:List_of_paradoxes
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Proofs_involving_the_addition_of_natural_numbers
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:+1
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Mathematical_logic
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Rewriting
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Church–Turing_thesis
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Function_(mathematics)
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Constructive_set_theory
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Equivalent_definitions_of_mathematical_structures
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Arity
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Succession
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Zeration
dbo:wikiPageWikiLink
dbr:Successor_function
dbo:wikiPageRedirects
dbr:Successor_function
Subject Item
dbr:Functional_programming
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Successor
dbo:wikiPageWikiLink
dbr:Successor_function
dbo:wikiPageDisambiguates
dbr:Successor_function
Subject Item
dbr:Successor_function
rdfs:label
後繼函數 Função sucessora Successor function Successor 다음수 함수 Fonction successeur 後者関数
rdfs:comment
Em matemática, a função sucessora ou operação sucessora é uma Função recursiva primitiva tal que para cada número natural .Por exemplo, e . Operações sucessoras são também conhecidas como zeração no contexto de zeroth hiperoperação: . In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by S, so S(n) = n + 1. For example, S(1) = 2 and S(2) = 3. The successor function is one of the basic components used to build a primitive recursive function. Successor operations are also known as zeration in the context of a zeroth hyperoperation: H0(a, b) = 1 + b. In this context, the extension of zeration is addition, which is defined as repeated succession. En mathématiques, la fonction successeur est une fonction récursive primitive S telle que S(n) = n+1 pour tout entier naturel n. Par exemple, S(1) = 2 et S(2) = 3. La fonction successeur apparaît dans les axiomes de Peano qui définissent les entiers naturels. Elle n'y est pas définie à partir de l'opération d'addition, mais est une opération primitive qui sert à définir les entiers naturels à partir de 0, mais aussi les autres opérations sur les entiers naturels, dont l'addition. Par exemple, 1 est S(0), et l'addition sur les entiers est définie récursivement par: 数学の分野における後者関数（こうしゃかんすう、後続者関数、英: successor function）、もしくは後者演算 (successor operation)は原始再帰関数のひとつである。後者関数 S は任意の自然数 n にその後者（後継、後続者）n + 1 を割り当てる: S(n) ≔ n + 1 (∀n)。例えばS(1) = 2 であり S(2) = 3 である。0-番目のハイパー演算 H0(a, b) ≔ 1 + b としての後者演算は「ゼレーション」("zer­ation") とも呼ばれる。 Successor (synonym efterföljare), begrepp inom logik. Successorn till ett naturligt tal är det minsta tal som är större än . Annorlunda uttryckt är successorn till a dess omedelbara efterföljare, därav namnet. 在 数学、 後繼函數 或 後繼運算 是一个 原始递归函数 S 使得 S(n)= n+1，n 為自然数。例如， S(1)=2和 S(2)=3。后继函數在西方国家也称为zeration，因為它是第零类超運算：H0(a, b)=1+ b。 수학에서 다음수 함수(영어: successor function)또는 다음수 연산(영어: successor operation)은 자연수 n에 대해서 S(n) = n+1인 원시 재귀 함수 S이다.예를 들어, S(1) = 2이고 S(2) = 3이다. 다음수 연산은 또한 0차 하이퍼 연산의 맥락으로 제레이션(영어: zeration)으로 알려져 있다: H0(a, b) = 1 + b.
dcterms:subject
dbc:Arithmetic dbc:Mathematical_logic dbc:Logic_in_computer_science
dbo:wikiPageID
325637
dbo:wikiPageRevisionID
1037249340
dbo:wikiPageWikiLink
dbr:Hyperoperation dbr:Computable_function dbr:Closure_(mathematics) dbr:Addition dbr:Computability dbr:Mathematics dbr:John_von_Neumann dbr:Grzegorczyk_hierarchy dbr:Successor_cardinal dbr:Successor_ordinal dbc:Arithmetic dbr:Tetration dbr:Sequence dbr:Axiom_of_infinity dbr:Exponentiation dbr:Empty_set dbr:Formal_language dbc:Mathematical_logic dbr:Natural_number dbr:Multiplication dbr:Increment_and_decrement_operators dbr:Primitive_recursive_function dbr:Peano_axioms dbr:Set-theoretic_definition_of_natural_numbers dbc:Logic_in_computer_science
owl:sameAs
dbpedia-fa:تابع_پسین dbpedia-ko:다음수_함수 freebase:m.0jwr5c6 dbpedia-vi:Hàm_successor dbpedia-pt:Função_sucessora n18:4vYG5 dbpedia-fr:Fonction_successeur dbpedia-ja:後者関数 dbpedia-sv:Successor dbpedia-zh:後繼函數 wikidata:Q7632653
dbp:wikiPageUsesTemplate
dbt:Mathlogic-stub dbt:Short_description dbt:Cite_book dbt:Space dbt:Hyperoperations dbt:Reflist dbt:Other_uses
dbo:abstract
Em matemática, a função sucessora ou operação sucessora é uma Função recursiva primitiva tal que para cada número natural .Por exemplo, e . Operações sucessoras são também conhecidas como zeração no contexto de zeroth hiperoperação: . In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by S, so S(n) = n + 1. For example, S(1) = 2 and S(2) = 3. The successor function is one of the basic components used to build a primitive recursive function. Successor operations are also known as zeration in the context of a zeroth hyperoperation: H0(a, b) = 1 + b. In this context, the extension of zeration is addition, which is defined as repeated succession. 在 数学、 後繼函數 或 後繼運算 是一个 原始递归函数 S 使得 S(n)= n+1，n 為自然数。例如， S(1)=2和 S(2)=3。后继函數在西方国家也称为zeration，因為它是第零类超運算：H0(a, b)=1+ b。 数学の分野における後者関数（こうしゃかんすう、後続者関数、英: successor function）、もしくは後者演算 (successor operation)は原始再帰関数のひとつである。後者関数 S は任意の自然数 n にその後者（後継、後続者）n + 1 を割り当てる: S(n) ≔ n + 1 (∀n)。例えばS(1) = 2 であり S(2) = 3 である。0-番目のハイパー演算 H0(a, b) ≔ 1 + b としての後者演算は「ゼレーション」("zer­ation") とも呼ばれる。 Successor (synonym efterföljare), begrepp inom logik. Successorn till ett naturligt tal är det minsta tal som är större än . Annorlunda uttryckt är successorn till a dess omedelbara efterföljare, därav namnet. En mathématiques, la fonction successeur est une fonction récursive primitive S telle que S(n) = n+1 pour tout entier naturel n. Par exemple, S(1) = 2 et S(2) = 3. La fonction successeur apparaît dans les axiomes de Peano qui définissent les entiers naturels. Elle n'y est pas définie à partir de l'opération d'addition, mais est une opération primitive qui sert à définir les entiers naturels à partir de 0, mais aussi les autres opérations sur les entiers naturels, dont l'addition. Par exemple, 1 est S(0), et l'addition sur les entiers est définie récursivement par: Par exemple. 5 + 2 = 5 + S(1) = S(5) + 1 = 6 + 1 = 6 + S(0) = S(6) + 0 = 7 + 0 = 7 Pour construire les nombres entiers en théorie des ensembles, une approche classique consiste à définir le nombre 0 par l'ensemble vide {}, et le successeur S(x) par x ∪ { x }. L'axiome de l'infini garantit alors l'existence d'un ensemble ℕ qui contient 0 et qui est clos par successeur, pris comme définition de l'ensemble des nombres entiers naturels. La fonction successeur est le niveau 0 de la hiérarchie infinie des hyperopérations (utilisées pour construire l'addition, la multiplication, l'exponentiation, etc.). 수학에서 다음수 함수(영어: successor function)또는 다음수 연산(영어: successor operation)은 자연수 n에 대해서 S(n) = n+1인 원시 재귀 함수 S이다.예를 들어, S(1) = 2이고 S(2) = 3이다. 다음수 연산은 또한 0차 하이퍼 연산의 맥락으로 제레이션(영어: zeration)으로 알려져 있다: H0(a, b) = 1 + b.
gold:hypernym
dbr:S
prov:wasDerivedFrom
wikipedia-en:Successor_function?oldid=1037249340&ns=0
dbo:wikiPageLength
3077
foaf:isPrimaryTopicOf
wikipedia-en:Successor_function
Subject Item
dbr:Typographical_Number_Theory
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Mathematics,_Form_and_Function
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:1
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Transitive_relation
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Robinson_arithmetic
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Addition
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Agda_(programming_language)
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Four_fours
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Parity_of_zero
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Carleman_matrix
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Church_encoding
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Foundations_of_mathematics
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Knuth's_up-arrow_notation
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Primitive_notion
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Serial_relation
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Tetration
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Arithmetic
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Axiom
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Axiomatic_system
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Grzegorczyk_hierarchy
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Inductive_type
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Natural_number
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Natural_numbers_object
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Origin_of_language
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Search_problem
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Second-order_arithmetic
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Unary_function
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Finitism
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:ST_type_theory
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Scott–Potter_set_theory
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Set-theoretic_definition_of_natural_numbers
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Ultrafinitism
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Outline_of_algebraic_structures
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Outline_of_discrete_mathematics
dbo:wikiPageWikiLink
dbr:Successor_function
Subject Item
dbr:Hyper-0
dbo:wikiPageWikiLink
dbr:Successor_function
dbo:wikiPageRedirects
dbr:Successor_function
Subject Item
dbr:Hyper0
dbo:wikiPageWikiLink
dbr:Successor_function
dbo:wikiPageRedirects
dbr:Successor_function
Subject Item
dbr:0-ation
dbo:wikiPageWikiLink
dbr:Successor_function
dbo:wikiPageRedirects
dbr:Successor_function
Subject Item
dbr:Successor_map
dbo:wikiPageWikiLink
dbr:Successor_function
dbo:wikiPageRedirects
dbr:Successor_function
Subject Item
wikipedia-en:Successor_function
foaf:primaryTopic
dbr:Successor_function