From: "F. William Lawvere" <wlawvere@hotmail.com>
To: <pt11@paultaylor.eu>, categories <categories@mta.ca>
Subject: RE: Subobject Classifier Algorithm
Date: Tue, 1 Mar 2011 11:52:25 -0500 [thread overview]
Message-ID: <E1PuaK7-0005Ou-O4@mlist.mta.ca> (raw)
In-Reply-To: <alpine.DEB.1.00.1102251044030.6114@turing>
Of course the initial responses given by Fred and me were notthemselves algorithmic, but why can they not be a prelude to such?Fred recalled the sequence of UMPs that defines Omega and I recalled what results in the case of a finite site. The hope is that experts in Maple and the like will be able to solve the sort of problem needed to generate displays. That is, given a finite presentation of a category C,find a presentation of the resulting Heyting algebra with the action ofC on it. Of course as stated this includes the Burnside problem , the Post problem etc . Hence the need for recognizing solvable subproblems.Even for the class of graphic monoids, where the structure is finite, it growsexponentially , which has been used in the past by other computer scientists as an excuse not to consider it. But if we are given a few fixed finite C, we can consider the class of categories discretely fiberedover them (equivalent to objects of the toposes) and try to see whetherOmega is computable in the above sense for them.
I said contravariant 2-valued functors and of course these factor through the poset reflection. Calculating that poset reflection is a search problem wrt
the underlying graph, but actually wrt composition as well since we have todo it for the slice categories C/A.Bill> Date: Fri, 25 Feb 2011 11:20:36 +0000
> From: pt11@PaulTaylor.EU
> To: categories@mta.ca
> Subject: categories: Subobject Classifier Algorithm
>
> Ellis Cooper asked,
>
>> What are the general rules for calculating the sub-object classifier
>> of a topos? Or, for what class of toposes is there an algorithm for
>> calculating the sub-object classifier of its members?
>
> Thanks to Bill and Fred for describing the constructions.
>
> I would suggest, however, that it is rather stretching the meaning
> of the word "algorithm" to describe them as such. What kind of
> machine might be able to perform these operations?
>
> A propos of this question, it is well known both to new students
> of category theory and to those who like to use the subject to
> discuss Life, The Universe And Everything, that:
>
> (1) a topos is a cartesian closed category with
> (2) an internal Heyting algebra Omega,
>
...
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
next prev parent reply other threads:[~2011-03-01 16:52 UTC|newest]
Thread overview: 10+ messages / expand[flat|nested] mbox.gz Atom feed top
2011-02-23 15:16 Ellis D. Cooper
2011-02-24 17:11 ` F. William Lawvere
2011-02-25 11:20 ` Paul Taylor
2011-03-01 16:52 ` F. William Lawvere [this message]
2011-03-02 10:35 ` Paul Taylor
2011-02-24 22:14 Fred E.J. Linton
2011-03-03 15:17 Ellis D. Cooper
2011-03-04 13:44 ` Eduardo J. Dubuc
2013-10-20 8:25 Subobject classifier algorithm Venkata Rayudu Posina
2013-10-23 9:52 ` Prof. Peter Johnstone
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=E1PuaK7-0005Ou-O4@mlist.mta.ca \
--to=wlawvere@hotmail.com \
--cc=categories@mta.ca \
--cc=pt11@paultaylor.eu \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).