October 2018 - Categories - categories.org.au

Mathematics for sentence composition?
by Bob Coecke 30 Oct '18

30 Oct '18

Hi all, This is a request for information from those with knowledge of computational linguistics and related things. Sentence structure is a long-established field, most notably with major contributions by Lambek, and concerns how words compose within a sentence. How much ( is known / has been done ) in mathematical terms on composing sentences in order to form stories? Im am working on something, don’t want to re-invent the wheel, and also want to use/credit what has been done before. Cheers, Bob. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

3 2

ETAPS 2019 2nd joint call for papers
by Tarmo Uustalu 28 Oct '18

28 Oct '18

JOINT CALL FOR PAPERS 22nd European Joint Conferences on Theory And Practice of Software ETAPS 2019 Prague, Czech Republic, 6-11 April 2019 http://www.etaps.org/2019 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2019 is the twenty-second event in the series. -- MAIN CONFERENCES (8-11 April) -- * ESOP: European Symposium on Programming (PC chair Luís Caires, Universidade Nova de Lisboa, Portugal) * FASE: Fundamental Approaches to Software Engineering (PC chairs Reiner Hähnle, Technische Univ Darmstadt, Germany, and Wil van der Aalst, RWTH Aachen University, Germany) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs Mikolaj Bojanczyk, University of Warsaw, Poland, and Alex Simpson, University of Ljubljana, Slovenia) * POST: Principles of Security and Trust (PC chairs Flemming Nielson, Danmarks Tekniske Univ, Denmark, and David Sands, Chalmers Tekniska Högskola, Sweden) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Tomás Vojnar, Brno Univ of Technology, Czech Rep, and Lijun Zhang, Chinese Academy of Sciences, China) TACAS '19 hosts the 8th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Marscha Chechik (University of Toronto, Canada) Kathleen Fisher (Tufts University, USA) * FoSSaCS invited speaker: Thomas Colcombet (IRIF, France) * TACAS invited speaker: Cormac Flanagan (University of California at Santa Cruz, USA) -- IMPORTANT DATES * Abstracts due: 9 November 2018 23:59 AoE * Papers due: 16 November 2018 23:59 AoE * Rebuttal (ESOP, FoSSaCS, POST): 11 January 00:01 AoE - 14 January 2019 23:59 AoE * Notification: 25 January 2019 * Camera-ready versions due: 15 February 2019 -- SUBMISSION INSTRUCTIONS -- ETAPS conferences solicit contributions of two types: research papers and tool demonstration papers. ESOP and FoSSaCS accept only research papers. FASE, POST and TACAS have multiple types of research papers, see below. All accepted papers will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere (this does not apply to abstracts). In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. Submissions must follow the formatting guidelines of Springer's Lecture Notes in Computer Science and be submitted electronically in pdf through the EasyChair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. FASE and POST use double-blind review. Like ETAPS 2018, the proceedings of ETAPS 2019 will be published in *gold open access*. The copyright of the papers will remain with the authors. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. The publisher's charges for gold open access will be paid by the conference (funded with the participation fees of all participants). There will be no added cost for authors specifically. - Research papers FASE, FoSSaCS and TACAS have a page limit of 15 pp (excluding bibliography) for research papers, whereas POST allows at most 20 pp (excluding bibliography) and ESOP 25 pp (excluding bibliography). Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also *case study papers* (with the same page limit as for regular research papers). POST solicits also *systematization of knowledge papers* (with the same page limit as for regular research papers) and *position papers* (max 10 pp, excluding bibliography). Both TACAS and FASE solicit also *regular tool papers* (at most 15 pp, excluding bibliography). - Tool demonstration papers Tool demo papers have a page limit of 6 pp. The individual conferences FASE, POST, TACAS have additional specific requirements on tool demo papers. ESOP and FoSSaCS do not consider tool demonstration papers. -- SATELLITE EVENTS (6-7 April) -- A number of satellite workshops will take place before the main conferences: BEHAPI, CREST, DICE-FOPARA, GaLoP, HCVS, HSB, InterAVT, LiVe, MeTRiD, PERR, PLACES, QAPL, SPIoT, SynCoP, VerifyThis. -- HOST INSTITUTION -- ETAPS 2019 is hosted by the School of Computer Science of the Charles University in Prague, the beautiful capital of the Czech Republic. -- ORGANIZERS Jan Kofron and Jan Vitek (general chairs), Barbora Buhnova, Milan Ceska, Ryan Culpepper, Vojtech Horky, Paley Li, Petr Maj, Artem Pelenitsyn, David Safranek -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at jan.kofron(a)d3s.mff.cuni.cz and j.vitek(a)neu.edu. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

"Ultracategories" by Lurie
by David Roberts 26 Oct '18

26 Oct '18

Dear all, people on this list may be interested in the following new paper by Jacob Lurie: http://www.math.harvard.edu/~lurie/papers/Conceptual.pdf An extract: "In [9], Makkai proved a stronger form of Gödel’s completeness theorem, which provides a complete recipe for reconstructing the syntax of a first-order theory T (up to an appropriate notion of equivalence) from its semantics. The goal of this paper is to give a new proof of Makkai’s theorem and a reasonably self-contained exposition of the mathematics that surrounds it." Regards, David David Roberts http://ncatlab.org/nlab/show/David+Roberts http://thehighergeometer.wordpress.com/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

TAA volume in honour of Ales Pultr
by Jorge Picado 25 Oct '18

25 Oct '18

TOPOLOGY AND ITS APPLICATIONS will publish a special volume in honour of Ale?? Pultr, on the occasion of his 80th birthday. The guest editors are Bernhard Banaschewski, Maria Manuel Clementino and Jorge Picado. How to submit: Send a pdf file of your manuscript to Jorge Picado (picado(a)mat.uc.pt) possibly suggesting one of the Guest Editors to be assigned to the paper. All submissions should be within the scope of the Journal and will be carefully refereed following the standards of Topology and its Applications. Deadline for submissions: November 30, 2018 (please let us know of your intention to submit a paper until the end of October). -- Jorge Picado ::www.mat.uc.pt/~picado [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: characterization of flp endofucntors on Set?
by Thomas Streicher 24 Oct '18

24 Oct '18

Dear Andr'e, I think we can't do better than exhibiting Hom(L,-) as the directed colimit of the Set(X,-) indexed by f : L -> X. > I have a question regarding certain finite limit preserving functors Set-->Set. > > If L is a locale, then the functor Hom(L,-):Set-->Set preserves finite limits, > where Hom(L,X) denotes the set of morphisms of locales L-->X for a discrete locale X. > Is there is a simple characterization of these flp functors? I think I should reveil the background of my question. Look at p.7 of my https://www2.mathematik.tu-darmstadt.de/~streicher/FIBR/UniGround.pdf for formulations of my conditions Tr1-Tr3. I think Hom(L,-) validates (Tr1) and (Tr2) but presumably not (Tr3) (for EE = SS =Set). I am looking for a functor F : Set->Set validating all 3 conditions but not being equivalent to Id_Set. Butmaybe there is none? Best, Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Octoberfest 2018 - last announcement.
by Funk, Jonathon 24 Oct '18

24 Oct '18

Further information for Octoberfest 2018: https://ct-octoberfest.github.io/ 304 Shepard Hall City College of CUNY 160 Convent Ave New York, NY 10031 Directions to City College: https://www.ccny.cuny.edu/about/directions Campus map: https://www.ccny.cuny.edu/about/campusmap We suggest that participants print the conference webpage in order to present to building security. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Summer School on Higher Topos Theory and Univalent Foundations
by Nicola Gambino 24 Oct '18

24 Oct '18

*** Summer School on Higher Topos Theory and Univalent Foundations *** University of Leeds, UK *** Monday 24th June to Friday 28th June, 2019 Dear friends and colleagues, I am writing to let you know that a summer school on Higher Topos Theory and Univalent Foundations will take place at the University of Leeds from Monday 24th June to Friday 28th June, 2019. The goal of the school is to help PhD students and young researchers to obtain entry points into the areas of Higher Topos Theory and Univalent Foundations and, perhaps most importantly, learn about connections between them. This would help future developments in both subjects, e.g. in the development of elementary higher topos theory. The school will consist of the following activities. Mini-courses: - Peter LeFanu Lumsdaine (Stockholm University), Univalent Foundations - Charles Rezk (University of Illinois at Urbana-Champaign), Higher topos theory Invited lectures: - Benedikt Ahrens (University of Birmingham) - André Joyal (Université du Québec à Montréal) - Emily Riehl (Johns Hopkins University) Tutorials: - Paige North (Ohio State University) - Nima Rasekh (Max Planck Institute for Mathematics) - Karol Szumilo (University of Leeds) The website of the summer school (currently under construction) can be found at: https://conferences.leeds.ac.uk/httuf/ Information about registration and other practical matters will be available in due course. In the meantime, please do not hesitate to contact us if you have any queries. With best regards, The organizers (Nicola Gambino, Nima Rasekh, Karol Szumilo) Dr Nicola Gambino School of Mathematics, University of Leeds Web: http://www1.maths.leeds.ac.uk/~pmtng/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: characterization of flp endofucntors on Set?
by Thomas Streicher 24 Oct '18

24 Oct '18

Dear Richard, thanks for your answer. Offline I have received a reply by Jonas Frey which answers my question satisfactorily. Let U be a Groth. universe then Lex(U,Set) consists of filtered/directed colimits of representables. Accordingly, Lex(U,U) is equivalent to the full subcat of Set^U on U-small directed colimits of representables. But that sounds related to what Blass says, isn't it. Best, Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1

Re: characterization of flp endofucntors on Set?
by Richard Garner 23 Oct '18

23 Oct '18

To be clear: by "subdirect product" I mean "reduced product by a filter" and in this case all the sets are the same so I suppose I should really say "reduced power". On Tue, Oct 23, 2018, at 10:58 AM, Richard Garner wrote: > Dear Thomas, > > I don't know a complete answer to your question - I think there is > probably not an entirely elementary characterisation. The partial > answers I am aware of (which probably you are aware of too) have a lot > to do with filters.> > - Trnkova classifies in "On descriptive classification of set-functors > I" different kinds of limit-preserving endofunctor of Set. In > particular, she shows that an endofunctor of set preserves finite > limits if and only if it preserves finite products and is not the > reflector of Set into 0<=1.> > - Blass in "Exact functors and measurable cardinals" shows that any > finite-limit preserving endofunctor of Set is a directed union of > subdirect products. Of course, this is not so far away from the "for- > free" characterisation of the flp endofunctors of Set as ind-objects > in Set^op.> > - Rather trivially, an flp and finitary endofunctor of Set must be of > the form FA = { continuous maps X ---> disc(A) of finite support } > for some Stone space X, because flp finitary endofunctors of Set are > the same as flp functors Set_f-->Set, and these are all of the form > Stone(X,-):Set_f-->Set. I don't how to extend this even to > endofunctors of rank aleph_1.> > My knowledge of the literature in this area is patchy, so I am also > interested to see what other answers you might receive!> > Richard > > [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: characterization of flp endofucntors on Set?
by Richard Garner 23 Oct '18

23 Oct '18

Dear Thomas, I don't know a complete answer to your question - I think there is probably not an entirely elementary characterisation. The partial answers I am aware of (which probably you are aware of too) have a lot to do with filters. - Trnkova classifies in "On descriptive classification of set-functors I" different kinds of limit-preserving endofunctor of Set. In particular, she shows that an endofunctor of set preserves finite limits if and only if it preserves finite products and is not the reflector of Set into 0<=1. - Blass in "Exact functors and measurable cardinals" shows that any finite-limit preserving endofunctor of Set is a directed union of subdirect products. Of course, this is not so far away from the "for- free" characterisation of the flp endofunctors of Set as ind-objects in Set^op. - Rather trivially, an flp and finitary endofunctor of Set must be of the form FA = { continuous maps X ---> disc(A) of finite support } for some Stone space X, because flp finitary endofunctors of Set are the same as flp functors Set_f-->Set, and these are all of the form Stone(X,-):Set_f-- >Set. I don't how to extend this even to endofunctors of rank aleph_1. My knowledge of the literature in this area is patchy, so I am also interested to see what other answers you might receive! Richard On Mon, Oct 22, 2018, at 10:14 PM, Thomas Streicher wrote: > One easily shows that up to isomorphism the functors from Set to Set > which preserves small limits are up to iso of the form (-)^I for some> set I. > Is there known a similarly elementary characterization of FINITE limit> preserving functors from Set to Set? > > Thomas > [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0