Formalization of functionally complete propositional calculus with the functor of implication as the only primitive term
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jonathan Jenkins Ichikawa
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 48 (4):479 - 494 (1989)
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.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Jan Łukasiewicz (1970). Selected Works. Amsterdam,North-Holland Pub. Co..
Czesław Lejewski (1958). On Lesniewski's Ontology. Ratio 1 (2):150-176.
Czesław Lejewski (1958). On Implicational Definitions. Studia Logica 8 (1):189 - 211.
Citations of this work BETA
No citations found.
Similar books and articles
Hector-Neri Castañeda (1990). Leibniz's Complete Propositional Logic. Topoi 9 (1):15-28.
Maria Luisa Bonet & Samuel R. Buss (1993). The Deduction Rule and Linear and Near-Linear Proof Simulations. Journal of Symbolic Logic 58 (2):688-709.
Marek Nowak & Daniel Vanderveken (1995). A Complete Minimal Logic of the Propositional Contents of Thought. Studia Logica 54 (3):391 - 410.
Bolesław Sobociński (1978). Note About Ł Ukasiewicz's Theorem Concerning the System of Axioms of the Implicational Propositional Calculus. Notre Dame Journal of Formal Logic 19 (3):457-460.
Igor Walukiewicz (1996). A Note on the Completeness of Kozen's Axiomatisation of the Propositional Μ-Calculus. Bulletin of Symbolic Logic 2 (3):349-366.
K. Hałkowska (1967). A Note on the System of Propositional Calculus with Primitive Rule of Extensionality. Studia Logica 20 (1):150-150.
T. Thacher Robinson (1968). Independence of Two Nice Sets of Axioms for the Propositional Calculus. Journal of Symbolic Logic 33 (2):265-270.
Philip Kremer (1997). Defining Relevant Implication in a Propositionally Quantified S. Journal of Symbolic Logic 62 (4):1057-1069.
Melvin Fitting (1999). A Simple Propositional S5 Tableau System. Annals of Pure and Applied Logic 96 (1-3):107-115.
Added to index2009-01-28
Total downloads20 ( #231,573 of 1,902,539 )
Recent downloads (6 months)1 ( #452,252 of 1,902,539 )
How can I increase my downloads?