Finite Sets and Counting
Chris Preston
Abstract
Open-access reader
Chris Preston
Abstract
Open-access reader
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is then applied to prove results about structures which, like the natural numbers, satisfy the principle of mathematical induction, but do not necessarily satisfy the remaining Peano axioms.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is then applied to prove results about structures which, like the natural numbers, satisfy the principle of mathematical induction, but do not necessarily satisfy the remaining Peano axioms.
Key concepts: Mathematics, Computer science