Some unsolved problems about the classifying topos for Boolean algebras, as well as about the axiomatic arithmetic of finite combinatorial toposes, are closely connected with some simple distinctions between finite automata.
Keywords: Automata, measurable cardinals, Aufhebung, finite topos, axiomatic arithmetic
2000 MSC: 05C35, 11B39, 11U10, 18B20, 18B25
Theory and Applications of Categories,
Vol. 13, 2004,
No. 10, pp 164-168.
http://www.tac.mta.ca/tac/volumes/13/10/13-10.dvi
http://www.tac.mta.ca/tac/volumes/13/10/13-10.ps
http://www.tac.mta.ca/tac/volumes/13/10/13-10.pdf
ftp://ftp.tac.mta.ca/pub/tac/html/volumes/13/10/13-10.dvi
ftp://ftp.tac.mta.ca/pub/tac/html/volumes/13/10/13-10.ps
Revised 2008-12-17. Original version at
http://www.tac.mta.ca/tac/volumes/13/10/13-10a.dvi