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
A White-headed langurs impulsive state feedback control model with sparse effect and continuous delay
2015
2015
Cooperative Epistemic Multi-Agent Planning With Implicit Coordination
Epistemic Planning has been used to achieve ontic and epis- temic control in multi-agent situations. We extend the for-malism to… 
2011
2011
The search for a reduction in combinatory logic equivalent to λβ-reduction
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… 
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… 
2007
2007
An efficient variable partitioning approach for functional decomposition of circuits
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… 
1994
1994
Improving Temporal Logic Tableaux Using Integer Constraints
It is fairly easy, if somewhat tedious, to prove that our rules preserve satisfiability. Completeness, however, is a much tougher… 
1989
1989
A Generalization of the Offline Parsable Grammars
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these… 
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)