Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 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.
2017
2017
A White-headed langurs impulsive state feedback control model with sparse effect and continuous delay
Shidong Chen
,
Weijian Xu
,
Lansun Chen
,
Zhonghao Huang
Communications in nonlinear science & numerical…
2017
Corpus ID: 126292401
2015
2015
Cooperative Epistemic Multi-Agent Planning With Implicit Coordination
Thorsten Engesser
,
Thomas Bolander
,
Robert Mattmüller
,
Bernhard Nebel
2015
Corpus ID: 260506466
Epistemic Planning has been used to achieve ontic and epis- temic control in multi-agent situations. We extend the for-malism to…
Expand
2011
2011
The search for a reduction in combinatory logic equivalent to λβ-reduction
J. Seldin
Theoretical Computer Science
2011
Corpus ID: 26764818
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
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
2007
2007
An efficient variable partitioning approach for functional decomposition of circuits
V. Muthukumar
,
R. Bignall
,
H. Selvaraj
Journal of systems architecture
2007
Corpus ID: 32345225
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
1994
1994
Improving Temporal Logic Tableaux Using Integer Constraints
Reiner Hähnle
,
Ortrun Ibens
International Conference on Temporal Logic
1994
Corpus ID: 34108486
It is fairly easy, if somewhat tedious, to prove that our rules preserve satisfiability. Completeness, however, is a much tougher…
Expand
1989
1989
A Generalization of the Offline Parsable Grammars
A. Haas
Annual Meeting of the Association for…
1989
Corpus ID: 6050262
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these…
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
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)
ACCEPT & CONTINUE