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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Epistemic Planning has been used to achieve ontic and epis- temic control in multi-agent situations. We extend the for-malism to… 
2010
2010
Censored Markov chains (CMC) allow to represent the conditional behavior of a system within a subset of observed states. They… 
2008
2008
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… 
1996
1996
Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a… 
1994
1994
It is fairly easy, if somewhat tedious, to prove that our rules preserve satisfiability. Completeness, however, is a much tougher… 
1989
1989
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these… 
1971
1971
. Sets inductively defined with respect to Il0, Sx, (nonmonotonic) II t and S2 predicates are characterized in terms of the four…