Next Article in Journal / Special Issue
A Logical Analysis of Existential Dependence and Some Other Ontological Concepts—A Comment to Some Ideas of Eugenia Ginsberg-Blaustein
Previous Article in Journal / Special Issue
An Overview of the Fuzzy Axiomatic Systems and Characterizations Proposed at Ghent University
Article Menu

Export Article

Open AccessArticle
Axioms 2016, 5(2), 18; doi:10.3390/axioms5020018

Potential Infinity, Abstraction Principles and Arithmetic (Leśniewski Style)

1
Centre for Logic and Philosophy of Science, University of Ghent, 9000 Ghent, Belgium
2
Institute of Philosophy, Sociology and Journalism, University of Gdańsk, 80-309 Gdańsk, Poland
Academic Editor: Urszula Wybraniec-Skardowska
Received: 19 March 2016 / Revised: 2 June 2016 / Accepted: 2 June 2016 / Published: 15 June 2016
(This article belongs to the Special Issue Lvov—Warsaw School)
View Full-Text   |   Download PDF [284 KB, uploaded 15 June 2016]

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. View Full-Text
Keywords: arithmetic; potential infinity; finite models; Leśniewski’s systems; Leśniewski’s Ontology; neologicism; abstraction principles arithmetic; potential infinity; finite models; Leśniewski’s systems; Leśniewski’s Ontology; neologicism; abstraction principles
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Urbaniak, R. Potential Infinity, Abstraction Principles and Arithmetic (Leśniewski Style). Axioms 2016, 5, 18.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Axioms EISSN 2075-1680 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top