Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Ackermann functionAxiomatic systemChurch encodingChurch–Turing thesis

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
First- and Second-Order Models of Recursive Arithmetics
We study a quadruple of interrelated subexponential subsystems of arithmetic WKL$_0^-$, RCA$^-_0$, I$\Delta_0$, and $\Delta$RA$_1… 
2013
2013
Diagonalizing by Fixed-Points
A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and… 
2010
2010
Stochastic Bounds for Censored Markov Chains
Censored Markov chains (CMC) allow to represent the conditional behavior of a system within a subset of observed states. They… 
2009
2009
Ackermannian Lower Bounds for Lengths of Bad Sequences of Monomial Ideals over Polynomial Rings in two Variables
A famous result of Hilbert states that in a polynomial ring in nitely many variables over a eld every ascending chain of ideals… 
2008
2008
Radix enumeration of rational languages is almost co-sequential.
. We define and study here the class of rational functions that are finite union of sequential functions. These functions can be… 
2008
2008
Author ' s personal copy The generative basis of natural number concepts
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… 
2008
2008
A Trivial Solution to the PvNP Problem
We show that Godel has dened an arithmetical relation R(n) which| when treated as a Boolean function|is constructively computable… 
2000
2000
Multi-valued sub-function encoding in functional decomposition based on information relationships measures
Functional decomposition is becoming more and more popular, because it is more general than all other known logic synthesis… 
1996
1996
Combining Algebraic and Set-Theoretic Specifications (Extended Version)
Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a… 
1971
1971
Inductive definitions and computability
. Sets inductively defined with respect to Il0, Sx, (nonmonotonic) II t and S2 predicates are characterized in terms of the four…