Formalization of functionally complete propositional calculus with the functor of implication as the only primitive term

Studia Logica 48 (4):479 - 494 (1989)
  Copy   BIBTEX

Abstract

The most difficult problem that Leniewski came across in constructing his system of the foundations of mathematics was the problem of defining definitions, as he used to put it. He solved it to his satisfaction only when he had completed the formalization of his protothetic and ontology. By formalization of a deductive system one ought to understand in this context the statement, as precise and unambiguous as possible, of the conditions an expression has to satisfy if it is added to the system as a new thesis. Now, some protothetical theses, and some ontological ones, included in the respective systems, happen to be definitions. In the present essay I employ Leniewski's method of terminological explanations for the purpose of formalizing ukasiewicz's system of implicational calculus of propositions, which system, without having recourse to quantification, I first extended some time ago into a functionally complete system. This I achieved by allowing for a rule of implicational definitions, which enabled me to define any propositionforming functor for any finite number of propositional arguments.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
39 (#398,894)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Selected works.Jan Łukasiewicz - 1970 - Amsterdam,: North-Holland Pub. Co.. Edited by Ludwik Borkowski.
On implicational definitions.Czesław Lejewski - 1958 - Studia Logica 8 (1):189 - 211.

Add more references