Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Peano axioms

Known as: Peano Postulate, Peano's axioms, Peano postulates 
In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are a set of axioms for the natural numbers… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
This paper presents an axiomatic model of decision making which incorporates objective but imprecise information. We axiomatize a… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
  • Baoding Liu
  • Studies in Fuzziness and Soft Computing
  • 2007
  • Corpus ID: 20772669
Uncertainty theory is a branch of mathematics based on normality, monotonicity, self-duality, and countable subadditivity axioms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • Y. Yao
  • Int. J. Approx. Reason.
  • 1996
  • Corpus ID: 14079327
Abstract This paper presents and compares two views of the theory of rough sets. The operator-oriented view interprets rough set… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Preliminaries.- A.- I: Arithmetic as Number Theory, Set Theory and Logic.- II: Fragments and Combinatorics.- B.- III: Self… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
  • R. Kaye
  • Oxford logic guides
  • 1991
  • Corpus ID: 118297305
Preface Background The standard model Discretely ordered rings Godel incompleteness The axioms of Peano arithmetic Some number… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Dependency knowledge of the form “ x is independent of y once z is known” invariably obeys the four graphoid axioms, examples… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Abstract We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’). The system is an extension of ACP… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An extenston of the Knuth-Bendix algorithm for finding complete sets of reductions is described. The extension is intended to… Expand
  • figure 1
  • table I
Is this relevant?
Highly Cited
1973
Highly Cited
1973
This paper proposes a modular ACTOR architecture and definitional method for artificial intelligence that is conceptually based… Expand
Is this relevant?