On Ontological Functors of Lesniewski's Elementary Ontology

Rafał Urbaniak · Ghent University Academic Bibliography (Ghent University) · 2006

We present an algorithm which allows to define any possible sentence-formative functor of Leśniewski’s Elementary Ontology (LEO), arguments of which belong to the category of names. Other results are: a recursive method of listing possible functors, a method of indicating the number of possible n-place ontological functors, and a sketch of a proof that LEO is functionally complete with respect to {∧,¬, ∀, ε}.

Read the paper · More papers on PaperTik