Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

35 relations
Arithmetical hierarchyAutomated theorem provingAxiom of reducibilityAxiomatic system

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
BASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES
Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It… 
2010
2010
ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$
Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of… 
2009
2009
TOWARDS A FORMAL METHOD FOR THE TRANSFORMATION OF ONTOLOGY AXIOMS TO APPLICATION DOMAIN RULES
Ontologies in nowadays are widely used in the process of development of modern information systems (IS), since they are suitable… 
Highly Cited
2005
Highly Cited
2005
Implicators based on binary aggregation operators in interval-valued fuzzy set theory
Highly Cited
2001
Highly Cited
2001
Vertex‐labeling algorithms for the Hilbert spacefilling curve
We describe a method, based on vertex‐labeling, to generate algorithms for manipulating the Hilbert spacefilling curve. The… 
Highly Cited
1992
Highly Cited
1992
Reasoning about functional dependencies generalized for semantic data models
We propose a more general form of functional dependency for semantic data models that derives from their common feature in which… 
1992
1992
Arithmetic and truth in L/ukasiewicz''s infinitely valued logic
Peano arithmetic formulated in Lukasiewicz's infinitely valued logic collapses into classical Peano arithmetic. However, not all… 
1992
1992
Peano scanning of arbitrary size images
Discrete space-filling curves are not uniquely defined. In addition to the condition that the curve must pass all the points of… 
Highly Cited
1983
Highly Cited
1983
A short proof of two recently discovered independence results using recursion theoretic methods
Recently L. A. S. Kirby and J. Paris showed that a theorem of R L. Goodstein cannot be proved in Peano's Arithmetic. We give an… 
1978
1978
Toward model theory through recursive saturation
One of the most significant by-products of the study of admissible sets with urelements is the emphasis it has given to… 
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)