A propositional fragment of leśniewski's ontology and its formulation by the tableau method

Studia Logica 41 (2-3):181 - 195 (1982)
The propositional fragment L 1 of Leniewski's ontology is the smallest class (of formulas) containing besides all the instances of tautology the formulas of the forms: (a, b) (a, a), (a, b) (b,). (a, c) and (a, b) (b, c). (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 1 iff TA is a thesis of first-order predicate logic with equality, where T is a translation of the formulas of L 1 into those of first-order predicate logic with equality such that T(a, b) = FblxFax (Russeltian-type definite description), TA B = TA TB, T A = TA, etc.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 14,232
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
Citations of this work BETA
Similar books and articles

Monthly downloads

Added to index


Total downloads

10 ( #215,417 of 1,699,719 )

Recent downloads (6 months)

6 ( #105,649 of 1,699,719 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.