Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,791,945 papers from all fields of science
Search
Sign In
Create Free Account
Successor function
Known as:
Successor
, Zeration
In mathematics, the successor function or successor operation is a primitive recursive function S such that S(n) = n+1 for each natural number n.For…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Ackermann function
Axiomatic system
Church encoding
Church–Turing thesis
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Diagonalizing by Fixed-Points
A. Karimi
,
Saeed Salehi
arXiv.org
2013
Corpus ID: 1710646
A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and…
Expand
2010
2010
Stochastic Bounds for Censored Markov Chains
Ana Bušić
,
Hilal Djafri
,
J. Fourneau
2010
Corpus ID: 9718806
Censored Markov chains (CMC) allow to represent the conditional behavior of a system within a subset of observed states. They…
Expand
2009
2009
Ackermannian Lower Bounds for Lengths of Bad Sequences of Monomial Ideals over Polynomial Rings in two Variables
Florian Pelupessy
,
A. Weiermann
2009
Corpus ID: 124936115
A famous result of Hilbert states that in a polynomial ring in nitely many variables over a eld every ascending chain of ideals…
Expand
2008
2008
Radix enumeration of rational languages is almost co-sequential.
Pierre-Yves Angrand
,
J. Sakarovitch
2008
Corpus ID: 260632849
. We define and study here the class of rational functions that are finite union of sequential functions. These functions can be…
Expand
2008
2008
Author ' s personal copy The generative basis of natural number concepts
A. Leslie
,
R. Gelman
,
C. Gallistel
2008
Corpus ID: 14692929
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or…
Expand
2008
2008
A Trivial Solution to the PvNP Problem
B. Anand
International Conference on Foundations of…
2008
Corpus ID: 1374965
We show that Godel has dened an arithmetical relation R(n) which| when treated as a Boolean function|is constructively computable…
Expand
2005
2005
Die Speicherungsnephrosen
T. Fahr
Klinische Wochenschrift
2005
Corpus ID: 8311703
Bei der Gruppe yon Nephrosen, die ich Ilnter der Bezeichnung Speicherungsnephrosen zusammengefaBt babe, sehen w~r als gemeinsames…
Expand
2000
2000
Multi-valued sub-function encoding in functional decomposition based on information relationships measures
A. Chojnacki
,
L. Józwiak
IEEE International Symposium on Multiple-Valued…
2000
Corpus ID: 17965630
Functional decomposition is becoming more and more popular, because it is more general than all other known logic synthesis…
Expand
1996
1996
Combining Algebraic and Set-Theoretic Specifications (Extended Version)
Claus Hintermeier
,
H. Kirchner
,
Peter D. Mosses
1996
Corpus ID: 5704197
Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a…
Expand
1971
1971
Inductive definitions and computability
T. Grilliot
1971
Corpus ID: 119494013
. Sets inductively defined with respect to Il0, Sx, (nonmonotonic) II t and S2 predicates are characterized in terms of the four…
Expand