[Date Prev][Date Next]
Re: [mizar] A general question on writing recursive functions in mizar
- To: email@example.com
- Subject: Re: [mizar] A general question on writing recursive functions in mizar
- From: trybulec <firstname.lastname@example.org>
- Date: Sun, 04 May 2008 13:10:07 +0200
- Delivered-to: email@example.com
- Delivered-to: firstname.lastname@example.org
- In-reply-to: <B97B2420A93BA344915FAF6DFC08773F13C489@CEBREN.net.ttu.edu>
- References: <B97B2420A93BA344915FAF6DFC08773F13C489@CEBREN.net.ttu.edu>
- User-agent: Mozilla/5.0 (Windows; U; Win98; en-US; rv:1.7) Gecko/20040616
Ozyavas, Adem wrote:
provides info on Hi:
1) the distinction between mizar functors and functions,
the distinction is not specific for Mizar.
We use two different names for formula constructor (predicate) and the
similar set theoretic object (relation). Unfortunately there is no such
commonly accepted distinction in the case of functions. Usually we use
'function' for a set theoretic object and 'lingual function' for the
term constructor. The name 'functor' for the term constructor was
borrowed from Rasiowa&Sikorski "Mathematics of Metamathematics". A
little bit better that 'function'. Still, it should be not confused with
'functor' in category theory, that is a (specific) function.
The distinction is important, beacuse mixing two concepts may lead to
the inconsistency. E.g. we may define ther
union of two sets (a functor):
A \/ B
but there is no corresponding function (the domain cannot be the
Cartesian square of the set of all sets, because there is no such thing).
In concrete mathematics the distinction is not so important, but there
are stll technical issues described by Adam.