Get it on Google Play
New! Download Unionpedia on your Android™ device!
Faster access than browser!
And Ads-free!

Robinson arithmetic

In mathematics, Robinson arithmetic, or Q, is a finitely axiomatized fragment of Peano arithmetic (PA), first set out in R. M. Robinson (1950). [1]

55 relations: Addition, Alfred Tarski, Andrzej Mostowski, Axiom, Axiom of adjunction, Axiom schema, Binary operation, Cardinality, Complete theory, Computable function, Concatenation, Converse (logic), Domain of a function, Empty set, Equality (mathematics), Existential quantification, Extensionality, First-order logic, Gödel numbering, Gödel's incompleteness theorems, General set theory, Gentzen's consistency proof, George Boolos, Infinite set, Injective function, Interpretation (logic), John Lucas (philosopher), John P. Burgess, List of first-order theories, Mathematical induction, Mathematics, Multiplication, Natural number, Non-standard model of arithmetic, Operation (mathematics), Peano axioms, Polish notation, Raphael M. Robinson, Raymond Smullyan, Recursive definition, Richard Jeffrey, Second-order arithmetic, Set (mathematics), Set theory, Set-theoretic definition of natural numbers, Springer Science+Business Media, Successor function, Tennenbaum's theorem, Total order, Unary operation, ..., Universal quantification, Variable (mathematics), Wolfgang Rautenberg, Zermelo set theory, 0 (number). Expand index (5 more) »


Addition (often signified by the plus symbol "+") is one of the four elementary, mathematical operations of arithmetic, with the others being subtraction, multiplication and division.

New!!: Robinson arithmetic and Addition · See more »

Alfred Tarski

Alfred Tarski (January 14, 1901 – October 26, 1983) was a Polish logician, mathematician and philosopher.

New!!: Robinson arithmetic and Alfred Tarski · See more »

Andrzej Mostowski

Andrzej Mostowski (1 November 1913 – 22 August 1975) was a Polish mathematician.

New!!: Robinson arithmetic and Andrzej Mostowski · See more »


An axiom or postulate is a premise or starting point of reasoning.

New!!: Robinson arithmetic and Axiom · See more »

Axiom of adjunction

In mathematical set theory, the axiom of adjunction states that for any two sets x, y there is a set w.

New!!: Robinson arithmetic and Axiom of adjunction · See more »

Axiom schema

In mathematical logic, an axiom schema (plural: axiom schemata) generalizes the notion of axiom.

New!!: Robinson arithmetic and Axiom schema · See more »

Binary operation

In mathematics, a binary operation on a set is a calculation that combines two elements of the set (called operands) to produce another element of the set (more formally, an operation whose arity is two, and whose two domains and one codomain are (subsets of) the same set).

New!!: Robinson arithmetic and Binary operation · See more »


In mathematics, the cardinality of a set is a measure of the "number of elements of the set".

New!!: Robinson arithmetic and Cardinality · See more »

Complete theory

In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent.

New!!: Robinson arithmetic and Complete theory · See more »

Computable function

Computable functions are the basic objects of study in computability theory.

New!!: Robinson arithmetic and Computable function · See more »


In formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end.

New!!: Robinson arithmetic and Concatenation · See more »

Converse (logic)

In logic, the converse of a categorical or implicational statement is the result of reversing its two parts.

New!!: Robinson arithmetic and Converse (logic) · See more »

Domain of a function

In mathematics, and more specifically in naive set theory, the domain of definition (or simply the domain) of a function is the set of "input" or argument values for which the function is defined.

New!!: Robinson arithmetic and Domain of a function · See more »

Empty set

In mathematics, and more specifically set theory, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero.

New!!: Robinson arithmetic and Empty set · See more »

Equality (mathematics)

In mathematics, equality is a relationship between two quantities or, more generally two mathematical expressions, asserting that the quantities have the same value or that the expressions represent the same mathematical object.

New!!: Robinson arithmetic and Equality (mathematics) · See more »

Existential quantification

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some".

New!!: Robinson arithmetic and Existential quantification · See more »


In logic, extensionality, or extensional equality, refers to principles that judge objects to be equal if they have the same external properties.

New!!: Robinson arithmetic and Extensionality · See more »

First-order logic

First-order logic is a formal system used in mathematics, philosophy, linguistics, and computer science.

New!!: Robinson arithmetic and First-order logic · See more »

Gödel numbering

In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well-formed formula of some formal language a unique natural number, called its Gödel number.

New!!: Robinson arithmetic and Gödel numbering · See more »

Gödel's incompleteness theorems

Gödel's incompleteness theorems are two theorems of mathematical logic that establish inherent limitations of all but the most trivial axiomatic systems capable of doing arithmetic.

New!!: Robinson arithmetic and Gödel's incompleteness theorems · See more »

General set theory

General set theory (GST) is George Boolos's (1998) name for a fragment of the axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano axioms.

New!!: Robinson arithmetic and General set theory · See more »

Gentzen's consistency proof

Gentzen's consistency proof is a result of proof theory in mathematical logic.

New!!: Robinson arithmetic and Gentzen's consistency proof · See more »

George Boolos

George Stephen Boolos (September 4, 1940 – May 27, 1996) was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology.

New!!: Robinson arithmetic and George Boolos · See more »

Infinite set

In set theory, an infinite set is a set that is not a finite set.

New!!: Robinson arithmetic and Infinite set · See more »

Injective function

In mathematics, an injective function or injection or one-to-one function is a function that preserves distinctness: it never maps distinct elements of its domain to the same element of its codomain.

New!!: Robinson arithmetic and Injective function · See more »

Interpretation (logic)

An interpretation is an assignment of meaning to the symbols of a formal language.

New!!: Robinson arithmetic and Interpretation (logic) · See more »

John Lucas (philosopher)

John Randolph Lucas FBA (born 18 June 1929) is a British philosopher.

New!!: Robinson arithmetic and John Lucas (philosopher) · See more »

John P. Burgess

John Patton Burgess (born 5 June 1948) is a John N. Woodhull Professor of Philosophy at Princeton University.

New!!: Robinson arithmetic and John P. Burgess · See more »

List of first-order theories

In mathematical logic, a first-order theory is given by a set of axioms in some language.

New!!: Robinson arithmetic and List of first-order theories · See more »

Mathematical induction

Mathematical induction is a method of mathematical proof typically used to establish a given statement for all natural numbers.

New!!: Robinson arithmetic and Mathematical induction · See more »


Mathematics (from Greek μάθημα máthēma, “knowledge, study, learning”) is the study of topics such as quantity (numbers), structure, space, and change.

New!!: Robinson arithmetic and Mathematics · See more »


Multiplication (often denoted by the cross symbol "×", by a point "·" or by the absence of symbol) is one of the four elementary, mathematical operations of arithmetic; with the others being addition, subtraction and division.

New!!: Robinson arithmetic and Multiplication · See more »

Natural number

In mathematics, the natural numbers (sometimes called the whole numbers): "whole number An integer, though sometimes it is taken to mean only non-negative integers, or just the positive integers." give definitions of "whole number" under several headwords: INTEGER … Syn. whole number.

New!!: Robinson arithmetic and Natural number · See more »

Non-standard model of arithmetic

In mathematical logic, a non-standard model of arithmetic is a model of (first-order) Peano arithmetic that contains non-standard numbers.

New!!: Robinson arithmetic and Non-standard model of arithmetic · See more »

Operation (mathematics)

The general operation as explained on this page should not be confused with the more specific operators on vector spaces.

New!!: Robinson arithmetic and Operation (mathematics) · See more »

Peano axioms

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 presented by the 19th century Italian mathematician Giuseppe Peano.

New!!: Robinson arithmetic and Peano axioms · See more »

Polish notation

Polish notation, also known as Polish prefix notation or simply prefix notation, is a form of notation for logic, arithmetic, and algebra.

New!!: Robinson arithmetic and Polish notation · See more »

Raphael M. Robinson

Raphael Mitchel Robinson (November 2, 1911 – January 27, 1995) was an American mathematician.

New!!: Robinson arithmetic and Raphael M. Robinson · See more »

Raymond Smullyan

Raymond Merrill Smullyan (born May 25, 1919) is an American mathematician, concert pianist, logician, Taoist philosopher, and magician.

New!!: Robinson arithmetic and Raymond Smullyan · See more »

Recursive definition

A recursive definition (or inductive definition) in mathematical logic and computer science is used to define the elements in a set in terms of other elements in the set (Aczel 1978:740ff).

New!!: Robinson arithmetic and Recursive definition · See more »

Richard Jeffrey

Richard C. Jeffrey (August 5, 1926 – November 9, 2002) was an American philosopher, logician, and probability theorist.

New!!: Robinson arithmetic and Richard Jeffrey · See more »

Second-order arithmetic

In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets.

New!!: Robinson arithmetic and Second-order arithmetic · See more »

Set (mathematics)

In mathematics, a set is a collection of distinct objects, considered as an object in its own right.

New!!: Robinson arithmetic and Set (mathematics) · See more »

Set theory

Set theory is the branch of mathematical logic that studies sets, which informally are collections of objects.

New!!: Robinson arithmetic and Set theory · See more »

Set-theoretic definition of natural numbers

Several ways have been proposed to define the natural numbers using set theory.

New!!: Robinson arithmetic and Set-theoretic definition of natural numbers · See more »

Springer Science+Business Media

Springer Science+Business Media or Springer is a global publishing company that publishes books, e-books and peer-reviewed journals in science, technical and medical (STM) publishing.

New!!: Robinson arithmetic and Springer Science+Business Media · See more »

Successor function

In mathematics, the successor function or successor operation is a primitive recursive function S such that S(n).

New!!: Robinson arithmetic and Successor function · See more »

Tennenbaum's theorem

Tennenbaum's theorem, named for Stanley Tennenbaum who presented the theorem in 1959, is a result in mathematical logic that states that no countable nonstandard model of Peano arithmetic (PA) can be recursive.

New!!: Robinson arithmetic and Tennenbaum's theorem · See more »

Total order

In mathematics, a linear order, total order, simple order, or (non-strict) ordering is a binary relation (here denoted by infix ≤) on some set X which is transitive, antisymmetric, and total.

New!!: Robinson arithmetic and Total order · See more »

Unary operation

In mathematics, a unary operation is an operation with only one operand, i.e. a single input.

New!!: Robinson arithmetic and Unary operation · See more »

Universal quantification

In predicate logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all".

New!!: Robinson arithmetic and Universal quantification · See more »

Variable (mathematics)

In elementary mathematics, a variable is an alphabetic character representing a number, called the value of the variable, which is either arbitrary or not fully specified or unknown.

New!!: Robinson arithmetic and Variable (mathematics) · See more »

Wolfgang Rautenberg

Wolfgang Rautenberg (1936 − September 4, 2011) was a German mathematician and logician whose areas of research were model theory, non-classical logic, modal logic, temporal logic and self reference.

New!!: Robinson arithmetic and Wolfgang Rautenberg · See more »

Zermelo set theory

Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern set theory.

New!!: Robinson arithmetic and Zermelo set theory · See more »

0 (number)

0 (zero; BrE: or AmE) is both a number and the numerical digit used to represent that number in numerals.

New!!: Robinson arithmetic and 0 (number) · See more »


[1] https://en.wikipedia.org/wiki/Robinson_arithmetic

Hey! We are on Facebook now! »