
	Where results make sense

Topic: Peano arithmetic

	Peano
		Peano's first work on logic (1888) showed that the calculus of classes and the propositional calculus were, up to notation, the same.
		Peano skipped over any attempt to define the natural numbers in logic, thus bypassing certain philosophical issues that mathematicians tend to view as being incapable of precise formulation, and concentrated on the manipulation of symbols, something mathematicians find most agreeable.
		Peano's response was that the ability to give brief and precise form to mathematical theorems would make the importance of his work clear.
	www.math.uwaterloo.ca /~snburris/htdocs/scav/peano/peano.html (650 words)

	Guiseppe Peano
		Peano is well-known for his work Formulario Mathematico in which he formulated the set of nonnegative integers on the basis of three undefined terms: 0 (zero), number and successor.
		Peano devised a postulate system from which the entire arithmetic of the natural numbers can be derived.
		The various arithmetic operations can then be defined with reference to these new type of numbers, and the validity of all arithmetical laws governing these operations can be proved by using Peano's postulates and the definitions of the various arithmetical concepts involved.
	www.engr.iupui.edu /~orr/webpages/cpt120/mathbios/gepeano.htm (1053 words)

	PlanetMath: Peano arithmetic
		Peano's axioms are a definition of the set of natural numbers, denoted
		Peano arithmetic consists of statements derived via these axioms.
		This is version 5 of Peano arithmetic, born on 2002-03-10, modified 2004-02-25.
	planetmath.org /encyclopedia/PeanoArithmetic.html (148 words)

	From Frege To Godel: von Heijenoort (Site not responding. Last check: 2007-11-03)
		The Peano axioms are introduced, in a symbolic notation closer to that used today (e.g., epsilon is used for class membership, and inverted C for implication).
		Peano (1906a) rejected Richard's paradox as a paradox of linguistics, not mathematics.
		Peano left descriptions unexplained for nonunit classes; Frege considered the operator to return the set of all objects satisfying the condition [semantically this is the identity function on such classes] for nonunit classes; Whitehead and Russell use a device to avoid Peano's incompleteness and Frege's arbitrariness when dealing with such cases.
	www.andrew.cmu.edu /~cebrown/notes/vonHeijenoort.html (8419 words)

	PlanetMath: PA
		Peano Arithmetic (PA) is the restriction of Peano's axioms to a first order theory of arithmetic.
		The only change is that the induction axiom is replaced by induction restricted to arithmetic formulas:
		Cross-references: identity, additive, one-to-one, function, successor, source, axioms, countably infinite, axiom of induction, second-order, arithmetic formulas, restricted, induction, induction axiom, first order theory, Peano's axioms, restriction
	planetmath.org /encyclopedia/PeanoArithmeticFirstOrder.html (141 words)

	Second-order arithmetic - Wikipedia, the free encyclopedia
		Second-order arithmetic can also be thought of as a weaker version of set theory in which all the sets are either natural numbers or sets of natural numbers.
		If second-order arithmetic is formalized using first-order logic then any model includes a domain for the set variables to range over, and this domain may be a proper subset of the full powerset of the number variables.
		Although some have argued that second-order arithmetic should be studied with full second-order semantics, the vast majority of current research treats second-order arithmetic in first-order predicate calculus.
	en.wikipedia.org /wiki/Second-order_arithmetic (1907 words)

	Axiomatic Theories of Truth (Stanford Encyclopedia of Philosophy)
		According to Gödel's incompleteness theorems, the statement that Peano Arithmetic (PA) is consistent, in its guise as a number-theoretic statement (given the technique of Gödel numbering), cannot be derived in PA itself.
		Peano arithmetic has proved to be a versatile theory of objects to which truth is applied, mainly because adding truth-theoretic axioms to Peano arithmetic yields interesting systems and because Peano arithmetic is equivalent to many straightforward theories of syntax and even theories of propositions.
		Since the language of arithmetic does not contain a function symbol representing the function that sends sentences to their negations, appropriate paraphrases involving predicates must be given.
	plato.stanford.edu /entries/truth-axiomatic (6010 words)

	WHAT ARE WEAK ARITHMETICS?
		The Weak Arithmetics scientist is not a professional mathematician who studies numbers (using such tools as algebraic methods, complex analysis and algebraic geometry) but is often (or always in some areas) in contact with Number Theory.
		Arithmetical definability is closely related to Number Theory and, in a sense, sheds new light on its classical results.
		Arithmetics, and to algorithmic and Spectra problems which concern the set of cardinalities of the finite models of a given first-order formula.
	www.univ-paris12.fr /lacl/jaf/wa/wa.html (4310 words)

	Java com.orcmid.LLC.pa Peano Arithmetic
		It is a peculiar characteristic of PA that it is the term use for the logical theory in which numbers and logical aspects of arithmetic are formalized.
		Peano Numbers are in some sense what PA (the theory) speaks of as theoretical entities, and Peano Numerals are (usually formal) manifestations of them.
		We manifest Peano Numbers in a subordinate section, just in case there is need for more-abstracted and theoretical framework at an intervening level.
	orcmid.com /com.orcmid/LLC/pa (222 words)

	LUCAS AGAINST MECHANISM (Site not responding. Last check: 2007-11-03)
		Although Lucas has good reason to believe that all theorems of Lucas arithmetic are true, it does not yet follow that his potential output is the whole of Lucas arithmetic.
		He can certainly go beyond Peano arithmetic, and he is perfectly justified in claiming the right to do so.
		But he can go beyond Peano's arithmetic and still be a machine, provided that some sort of limitations on his ability to verify theoremhood eventually leave him unable to recognise some theorem of Lucas arithmetic, and hence unwarranted in producing it as true.
	www.units.it /~dipfilo/etica_e_politica/2003_1/7_monographica.htm (960 words)

	ABO Papers
		Proving Peano's Axioms (10 Dec 2001, Sept 2000) A continuation of Dedekind's Proof, this proves the Peano Axioms from the axioms of A Foundation of Elementary Arithmetic.
		The Existence of Numbers (Or: What is the Status of Arithmetic?) (3 June 2002) A discussion of arithmetical ontology and its implications for the status of arithmetic.
		Arithmetic without the Successor Axiom (10 Feb 2006) A book-length self-contained exposition of Arithmetic without the Successor Axiom.
	www.andrewboucher.com /papers (577 words)

	Springer Online Reference Works
		Peano's axioms make it possible to develop number theory; in particular, to introduce the usual arithmetic functions and to establish their properties.
		Sometimes one understands by Peano arithmetic the system in the first-order language with the function symbols
		The system of Peano arithmetic mentioned at the end of the article above is no longer categorical (cf.
	eom.springer.de /P/p071880.htm (208 words)

	Provability Logic (Stanford Encyclopedia of Philosophy)
		In the same paper, Löb formulated three conditions on the provability predicate of Peano Arithmetic, that form a useful modification of the complicated conditions that Hilbert and Bernays introduced in 1939 for their proof of Gödel's second incompleteness theorem.
		If this is read arithmetically, the direction from left to right is just the formalized version of Gödel's second incompleteness theorem: if a sufficiently strong formal theory T like Peano Arithmetic does not prove a contradiction, then it is not provable in T that T does not prove a contradiction.
		Unaware of the arithmetical significance of GL, K. Segerberg proved in 1971 that GL is indeed complete with respect to transitive conversely well-founded frames; D. de Jongh and S. Kripke independently proved this result as well.
	plato.stanford.edu /entries/logic-provability (5006 words)

	Peano from FOLDOC
		In Arithmetices principia nova methodo exposita (The principles of arithmetic, presented by a new method) (1889) Peano showed how to derive all of arithmetic from the principles of logic, together with a set of nine postulates about numbers: 1 is a number.
		Any property that is: (a) true of 0, and (b) if true of any number is true of its successor, must be true of all numbers.
		This foundation for mathematical induction was an important step toward the twentieth-century logicization of arithmetic.
	lgxserver.uniba.it /lei/foldop/foldoc.cgi?Peano (297 words)

	[No title] (Site not responding. Last check: 2007-11-03)
		On a recent visit of Wiles to our campus last month I asked him the same question, and he simply said that he does not know whether PA can prove FLT, and I suspect the question struck him (as it seems to strike many non-logicians) as one which is of limited interest.
		Although most mathematicians know of the so-called Peano's axioms, they know of it as what logicians refer to as a "second order theory", i.e., one which is couched in a formal language allowing not only quantification over elements of the domain of discourse, but also subsets of the domain of discourse.
		The definitive text on the subject is "Subsystems of Second Order Arithmetic", by Stephen Simpson of Pennsylvania State University, which is scheduled to be appear in 1998 (by Springer-Verlag).
	www.math.niu.edu /Papers/Rusin/known-math/98/peano_arith (310 words)

	PA is instantiationally complete, but algorithmically incomplete: an alternative interpretation of Gödelian ...
		We then postulate a Provability Thesis that links Peano Arithmetic and effective algorithmic computability - just as Church's Thesis links Recursive Arithmetic and effective instantiational computability - under which PA is arithmetically complete.
		An issue that, sooner or later, seems to obfuscate every philosophical discussion on the relationship between formal logic and computability, and one which seems to lie also at the root of most foundational ambiguities, is the equivocal, semantic, interpretation of universal quantification (i.e., of unqualified generalisation).
		We have shown that Church’s Thesis implies that a first-order Peano Arithmetic is instantiationally complete, in the sense that it completely formalises Dedekind’s Peano Postulates with respect to Tarskian-truth.
	alixcomsi.com /PA_is_instantiationally_complete.htm (3085 words)

	Gödel's Theorem
		One of the first modern axiomatic systems was a formalization of simple arithmetic (adding and multiplying whole numbers) by the great logician Giuseppe Peano, called Peano arithmetic.
		Nobody knows what the Gödel sentences for Peano arithmetic are, though people have their suspicions about Goldbach's conjecture (every even number is the sum of two prime numbers).
		Goodstein's Theorem is a result about natural numbers which is undecidable within Peano arithmetic, but provable within stronger set-theoretic systems.
	cscs.umich.edu /~crshalizi/notebooks/godels-theorem.html (1269 words)

	[No title] (Site not responding. Last check: 2007-11-03)
		Arithmetic (PA) is by convention the name of the widely used system of
		Peano arithmetic is essentially weaker than the second order axiom
		Peano arithmetic constitutes a fundamental formalism for arithmetic,
	mathforum.org /kb/plaintext.jspa?messageID=4161255 (421 words)

	PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.), Vol. 47(61), pp. 13--23, 1990 (Site not responding. Last check: 2007-11-03)
		Abstract: First-order Heyting arithmetic is embedded by various modal translations in modal extensions of first-order Peano arithmetic which are included in Peano S4.
		Peano arithmetic is embedded by analogous modal translations in an S5-like extension of Heyting arithmetic.
		This last system is included in the modal extension of Heyting arithmetic where the necessity operator is equivalent to double negation and where Peano arithmetic can be embedded by a modal translation which amounts to a usual double-negation translation.
	www.univie.ac.at /EMIS/journals/PIMB/061/3.html (114 words)

	Peano axioms - Wikipedia, the free encyclopedia
		Peano's original axioms (1889) are preceded with the definitions:
		The lambda calculus gives another construction of the natural numbers that satisfies the Peano axioms.
		On the other hand, the last axiom listed above, the mathematical induction axiom, is not itself expressible in the first order language of arithmetic.
	en.wikipedia.org /wiki/Peano_axioms (2339 words)

	Provability logic Summary
		Unaware of the arithmetical relevance of PRL, Krister Segerberg proved in 1971 that it is sound and complete with respect to finite irreflexive transitive frames, and even with respect to finite trees.
		In recent years, logicians have investigated many other systems of arithmetic that are weaker than Peano arithmetic.
		The point is to capture the notion of a proof predicate of a reasonably rich formal theory, such as Peano arithmetic.
	www.bookrags.com /Provability_logic (1731 words)

	Enayat's Homepage
		My research is principally focused on models of set theory and arithmetic, but I have an interest in many areas of mathematical logic, especially those dealing with foundational issues.
		T (such as Peano arithmetic, second order arithmetic, and certain extensions of set theory with large cardinals) are characterized by the behavior of the automorphisms of models of
		Logic in Tehran, Proceedings of the Logic, Algebra, and Arithmetic conference held in Tehran during October 2003, to appear as volume 26 in the Lecture Notes in Logic Series, published by the Association for Symbolic Logic, edited by A. Enayat, I. Kalantari, and M. Moniri.
	academic2.american.edu /~enayat (530 words)

	Constructing Recursive Data Structures
		Peano numbers allow the modellization of natural numbers in a simple, homogeneous way, without actually defining different symbols for the digits.
		...Peano numbers can very easily be defined using terms, as every Peano number is, directly, a first-order term.
		It is interesting to note that this definition is, actually, very similar to the second one given in Section 3.3.
	clip.dia.fi.upm.es /~vocal/public_info/seminar_notes/node36.html (590 words)

	COS 598g, Spring 2000: What's New
		All general concepts were exemplified throughout the lecture by three major languages designed to argue about some particular structure/ class of structures: the language of Peano Arithmetic (to argue about integers), the group language (to argue about arbitrary groups), and the language of Boolean algebras (to argue in particular about the two-element Boolean algebra).
		Next we introduced the language of bounded arithmetic, bounded quantifiers, the hierarchy of bounded formulas and the core system of bounded arithmetic, $S_2^1$.
		We stated the main theorem of bounded arithmetic: the set of functions/predicates that are $\Sigma_1^b$-definable in $S_2^1$ coincides with the set of poly-time computable functions/predicates.
	www.cs.princeton.edu /courses/archive/spring00/cs598g/whats-new.html (1004 words)

	Ghilbert (Site not responding. Last check: 2007-11-03)
		A question for the experts: It is well known that exponentiation can be represented in first-order Peano arithmetic with addition and multiplication.
		However, the proof that this function encodes finite sequences seems to rely on primitives not available in pure Peano arithmetic, especially factorial.
		It's likely that this construction, which is based on the standard efficient algorithm for exponentiation in binary, can be adapted to a proof which checks in the Peano axioms.
	ghilbert.org (727 words)

Try your search on: Qwika (all wikis)