# A propositional fragment of Le'sniewski's Ontology and its formulation by the tableau method

Studia Logica 41 (2/3):181-195 (1982)

 Abstract The propositional fragment L₁ of Leśniewski's ontology is the smallest class (of formulas) containing besides all the instances of tautology the formulas of the forms: $\epsilon (a,b)\supset \epsilon (a,a),\epsilon (a,b)\wedge \epsilon (b,).\supset \epsilon (a,c)$ and $\epsilon (a,b)\wedge \epsilon (b,c).\supset \epsilon (b,a)$ being closed under detachment. The purpose of this paper is to furnish another more constructive proof than that given earlier by one of us for: Theorem A is provable in L₁ iff TA is a thesis of first-order predicate logic with equality, where T is a translation of the formulas of L₁ into those of first-order predicate logic with equality such that $T\epsilon (a,b)=F_{b}\imath xF_{a}x$ (Russellian-type definite description), $TA\vee B=TA\vee TB,T\sim A=\sim TA$ , etc. For the proof of this theorem use is made of a tableau method based upon the following reduction rules: $\frac{G[A\vee B_{-}]}{G[A\vee B_{-}]\vee \sim A|G[A\vee B_{-}]\vee \sim B},\frac{G[\epsilon (a,b)_{-}]}{G[\epsilon (a,b)_{-}]\vee \sim \epsilon (a,a)},\frac{G[\epsilon (a,b)_{-},\epsilon (b,c)_{-}]}{G[\epsilon (a,b)_{-},\epsilon (b,c)_{-}]\vee \sim \epsilon (a,c),}\frac{G[\epsilon (a,b)_{-},\epsilon (b,c)_{-}]}{G[\epsilon (a,b)_{-},\epsilon (b,c)_{-}]\vee \sim \epsilon (b,a),}$ , where $F[A_{+}](G[A_{-}])$ means that A occurs in $F[A_{+}](G[A_{-}])$ as its positive (negative) part in accordance with the definition given by Schütte Keywords No keywords specified (fix it) Categories Logic and Philosophy of Logic (categorize this paper) DOI 10.1007/BF00370344 Options Edit this record Mark as duplicate Export citation  Find it on Scholar Request removal from index Revision history

## Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 41,553
External links

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

No references found.

## Citations of this work BETA

Lesniewski and Russell's Paradox: Some Problems.Rafal Urbaniak - 2008 - History and Philosophy of Logic 29 (2):115-146.
Syntactical Proof of Translation and Separation Theorems on Subsystems of Elementary Ontology.Mitio Takano - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (9-12):129-138.

## Analytics

Added to PP index
2010-08-17

Total views
3 ( #1,154,475 of 2,248,942 )

Recent downloads (6 months)
1 ( #1,031,267 of 2,248,942 )

How can I increase my downloads?

Downloads