@article{8172114,
  abstract     = {{This paper starts with an explanation of how the logicist research program can be approached within the framework of Leśniewski’s systems. One nice feature of the system is that Hume’s Principle is derivable in it from an explicit definition of natural numbers. I generalize this result to show that all predicative abstraction principles corresponding to second-level relations, which are provably equivalence relations, are provable. However, the system fails, despite being much neater than the construction of Principia Mathematica (PM). One of the key reasons is that, just as in the case of the system of PM, without the assumption that infinitely many objects exist, (renderings of) most of the standard axioms of Peano Arithmetic are not derivable in the system. I prove that introducing modal quantifiers meant to capture the intuitions behind potential infinity results in the (renderings of) axioms of Peano Arithmetic (PA) being valid in all relational models (i.e. Kripke-style models, to be defined later on) of the extended language. The second, historical part of the paper contains a user-friendly description of Leśniewski’s own arithmetic and a brief investigation into its properties.}},
  articleno    = {{18}},
  author       = {{Urbaniak, Rafal}},
  issn         = {{2075-1680}},
  journal      = {{AXIOMS}},
  keywords     = {{Lesniewski’s Ontology,neologicism,Leśniewski’s systems,finite models,arithmetic,potential infinity,abstraction principles}},
  language     = {{eng}},
  number       = {{2}},
  pages        = {{20}},
  title        = {{Potential infinity, abstraction principles and arithmetic (Leniewski Style)}},
  url          = {{http://doi.org/10.3390/axioms5020018}},
  volume       = {{5}},
  year         = {{2016}},
}

Altmetric

View in Altmetric