December 2011 - Categories - categories.org.au

Partial functor
by David Leduc 16 Mar '15

16 Mar '15

Hi, A partial functor from C to D is given by a subcategory S of C and a functor from S to D. What is the appropriate notion of natural transformation between partial functors that would allow to turn small categories, partial functors and those "natural transformations" into a bicategory? The difficulty is that two partial functors from C to D might not have the same definition domain. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

7 6

Research positions
by Maria Manuel Clementino 26 Feb '14

26 Feb '14

5-YEAR RESEARCH POSITIONS The Centre for Mathematics of the University of Coimbra (CMUC) invites applications for five 5-year research positions in all areas of Mathematics. Applicants should have a PhD in Mathematics and at least three years of post-doctoral experience, with an international-level publication record and demonstrated ability to perform independent research. Preference will be given to candidates working in one of the areas in which the members of CMUC are currently active. A very good command of English is required. The appointments will be made for three years, renewable for two more. Successful applicants are expected to develop research within the areas of interest of CMUC. They should also contribute to graduate studies, supervising students from the Department of Mathematics. The basic salary is equivalent to the index 195 of the Portuguese research career (in the order of 42 500 euros a year), in accordance with the Ciência 2008 guidelines http://alfa.fct.mctes.pt/apoios/contratacaodoutorados/edital2008 Benefits include private health insurance and social security. Applicants should send • cover sheet (available from www.mat.uc.pt/cmuc/coversheet.pdf) including names and contact information of three persons who can provide a letter of recommendation • curriculum vitae (publication list included) • a 5-year research proposal (2 pages max), emphasizing their own research goals as pdf files to cmuc(a)mat.uc.pt. The subject of the e-mail message must include the job reference C2008 FCTUC CMUC v15-v19. The deadline for applications is *September 10, 2008.* ------------------------------ More information can be found at www.mat.uc.pt

1 1

separable locale
by Thomas Streicher 17 May '13

17 May '13

Recently rereading Fourman's "Continuous Truth" I came across the term "separable locale" but could nowhere find an explanation. Does it mean a cHa A for which there exists a countable subset B such that ever a in A is the supremum of those b in B with b leq a. This would be the point free account of "second countable", i.e. having a countable basis. Of course, second countable T_) spaces are separable, i.e. have a countable dense set. Is this reading the "usual" one? Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

5 4

Final Call For Papers RTA 2012
by Georg Moser 29 Dec '11

29 Dec '11

******************************************************** * Final Call For Papers * * RTA 2012 * * Rewriting Techniques and Applications * * 23rd International Conference * * * * May 28 - Jun 2, 2012, Nagoya, Japan * * http://rta2012.trs.cm.is.nagoya-u.ac.jp/ * * * ******************************************************** The 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) is the major forum for the presentation of research on rewriting. IMPORTANT DATES: Abstract: Jan 04, 2012 Paper Submission: Jan 09, 2012 Notification: Mar 02, 2012 Final version: Mar 26, 2012 RTA 2012 seeks original submissions on all aspects of rewriting. Typical areas of interest include (but are not limited to): * Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; * Foundations: equational logic; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; combination; * Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; * Implementation: implementation techniques; parallel execution; rewrite and completion tools; confluence and termination checking; certification of rewriting properties; abstract machines; explicit substitutions; BEST PAPER AWARD: An award is given to the best paper or papers as decided by the program committee. STUDENT SUPPORT: Limited student support will be available and announced in future versions of this call. PROGRAMME COMMITTEE CHAIR: * Ashish Tiwari SRI International, Menlo Park, CA http://www.csl.sri.com/users/tiwari PROGRAMME COMMITTEE: * Andreas Abel Ludwig-Maximilians-University Munich * Zena Ariola University of Oregon * Paolo Baldan Universita degli Studi di Padova * Ahmed Bouajjani University of Paris 7 * Evelyne Contejean LRI Universite Paris-Sud-CNRS * Irene Anne Durand LaBRI Universite of Bordeaux * Joerg Endrullis Vrije Universiteit Amsterdam * Silvio Ghilardi Universita degli Studi di Milano * Guillem Godoy Universidad Politecnica de Cataluna * Nao Hirokawa Japan Advanced Institute of Science and Technology * Deepak Kapur University of New Mexico, Albuquerque, NM * Jordi Levy IIIA - CSIC * Paul-Andre Mellies University of Paris 7 * Pierre-Etienne Moreau Ecole des Mines de Nancy * Joachim Niehren INRIA Lille * Grigore Rosu University of Illinois at Urbana-Champaign * Albert Rubio Universidad Politecnica de Cataluna * Masahiko Sakai Nagoya University * Carolyn Talcott SRI International * Rene Thiemann University of Innsbruck CONFERENCE CHAIR: * Masahiko Sakai Nagoya University INVITED SPEAKERS: * Hirokazu Anai Fujitsu Labs. & Kyushu University * Claude Kirchner INRIA & LORIA * Sebastian Maneth NICTA & Univ. of New South Wales PUBLICATION: RTA proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. STACS, FSTTCS and ICLP proceedings also appear in LIPIcs. See http://www.dagstuhl.de/lipics for more information about LIPIcs. Accepted papers will be considered for publication in a special issue of the journal Logical Methods in Computer Science (LMCS). SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers, applications of rewriting techniques, problem sets, and system descriptions. The page limit for submissions is 10 proceedings pages for system descriptions and 15 proceedings pages for all other categories. Additional material may be provided in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. Submissions are accepted in either Postscript or PDF format. LaTeX template for LIPIcs is available at: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz LaTeX template specialized for RTA 2012 is available at: http://www.csl.sri.com/users/tiwari/lipics-authors-rta2012.tgz Authors can use either one for preparing their submission. Abstracts and papers must be submitted electronically through the EasyChair system at: http://www.easychair.org/conferences/?conf=rta2012 Questions concerning submissions may be addressed to the PC chair, Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Dito Pataraia
by Mamuka Jibladze 23 Dec '11

23 Dec '11

Dear colleagues, It is with great sadness that we announce the passing of Dito Pataraia on December 15, 2011. He was 48. Dito was an indispensable source of inspiration. At seminars he generously shared his uniquely original insights on several important topics in category theory, mathematical logic and algebraic topology, but he was reluctant to publish or pursue a scientific degree. His major achievements remain unpublished and unknown to the general mathematical community. However, his brilliant ability to effortlessly present complex and deep mathematical insights with incredible simplicity and clarity would leave an unforgettable impression on those few who were lucky enough to hear him talk during a seminar. At the same time, Dito's infinite kindness, unfailing humor and sharp, but open and unassuming mind made him the heart of a company, a kind of person that makes one better by simply being around. It is an inconsolable grief that he is no longer with us. It has been a privilege to know him. The brilliant sparkle he managed to light up in our hearts will be cherished forever. The following is a characteristic illustration of his style - one of the very few things that he decided to make publicly available: http://www.emis.de/journals/GMJ/vol4/v4n6-4.pdf [1] There are (maybe too) many approaches to the universal characterization of the fundamental group, in various flavors and degrees of generality. Dito's version is not just another one. It is totally unexpected, completely against the mainstream thought on this topic, and yet ever so natural. Quite probably it opens up a new and absolutely unexplored field of study. Most of Dito's work was only known in fragments to his close friends from many long discussions. Once Mamuka Jibladze returned from one of the PSSLs, where he learned about two interesting open questions. One was whether the Witt fixed point theorem for dcpo's is constructively valid; the second - the question of Andy Pitts - whether any Heyting algebra can occur as the poset of all subobjects of some object in an elementary topos. After three days Dito came to the seminar with positive answers to both of these questions. He never published these results. The proof of the first question is relatively simple, so his talk at another PSSL (in Aarhus) was sufficient for others to reconstruct and reproduce it in the literature (you have probably seen in a paper, book or online the combination Bourbaki-Witt-Pataraia). The proof of the second question is much more complicated. Dito's proof consisted of two parts - the construction, from a Heyting algebra, of some intermediate structure which he called Higher Order Cylindric Heyting Algebra (hocha for short), and then the construction of a topos from any hocha. This second part was more or less similar to several known constructions (a hocha is sort of a (powerset, product) reduct of a topos, so an equalizer completion of a hocha is a topos). That part was more transparent and even partly written down. In fact, after Dito and Mamuka described it to Peter Johnstone, Martin Hyland, and Andy Pitts among others at Cambridge, Peter came up with yet another transparent and elegant construction of this second part based on allegories. However the first part - constructing a hocha from a Heyting algebra - is much more involved. It seems to force one into a completely unexplored territory. The proof that Dito had was stuffed with completely unexpected new ideas and constructions. As Marek Zawadowski put it after listening to Dito in Tbilisi, it was like witnessing a magician pulling rabbit after rabbit out of his hat. However the proof, if written down, would be about forty pages long and did not satisfy Dito at all. The proof that Dito had was truly stuffed with completely unexpected new ideas and constructions - as Marek Zawadowski put it after listening to Dito in Tbilisi, it was like witnessing a magician pulling rabbit after rabbit from a top hat. However the proof, if written down, would be about forty pages long and did not satisfy Dito at all. He spent a week in Utrecht, where Jaap van Oosten kindly followed the exposition every day, and came up with an extremely important simplification (Jaap discovered that the substitution operators may be expressed from the rest of the hocha structure). Still the proof remained too involved for Dito's taste, and he kept returning to it. As we mentioned, he never cared about publishing anything, his only priority was to make things as clear as possible. So Dito just took his time, having occasional opportunities to discuss it with Marek Zawadowski, Silvio Ghilardi and others. Just about a month before his death, some new idea occurred to him, which would help to organize the proof into something much more manageable. Unfortunately, there was not enough time for Dito to write it down in detail, but luckily he did share his new idea at the seminar. Dito worked on many other exciting questions in several fields, ranging from philosophy to arithmetic. Some of you might be aware of Dito's several unpublished works - an analysis-free proof of total disconnectedness of compact Hausdorff Boolean algebras, a description of the PROP of Hopf algebras, and a completely novel approach to Hopf-algebraic knot invariants. It is now our duty to make as much of his work available to the general mathematical community as possible. Dito's Georgian friends and colleagues. Links: ------ [1] http://www.emis.de/journals/GMJ/vol4/v4n6-4.pdf [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Wraith's "Algebraic Theories" Scan
by Ohad Kammar 20 Dec '11

20 Dec '11

Hi, With the kind permission of Professor Gavin Wraith, a scan of his Aarhus University Lecture Notes on Algebraic Theories (1969) can be found here, and freely circulated: http://homepages.inf.ed.ac.uk/s0894694/scans/wraith-algebraic-theories.pdf Yours, Ohad Kammar. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: CT 2011 Proceedings
by George Janelidze 18 Dec '11

18 Dec '11

Dear Colleagues, We decided to extend the submission deadline for the CT2011 Proceedings Volume of TAC as follows: DEADLINE FOR INFORMING US ABOUT YOUR INTENTION TO SUBMIT A PAPER: 31 JANUARY 2012 SUBMISSION DEADLINE: 31 MARCH 2012 (Provided you informed us) However, the papers will be published upon acceptance (not waiting for the Volume to be completed). Guest Editors: Marino Gran, George Janelidze, Steve Lack, John MacDonald, Walter Tholen [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 1

NASSLLI 2012 is Open for Registration!
by Valeria de Paiva 18 Dec '11

18 Dec '11

2012 is Open for Registration! The fifth North American Summer School in Logic, Language, and Information, NASSLLI 2012, will be hosted at the University of Texas at Austin, on June 18-22, 2012. http://nasslli2012.com/ NASSLLI is a one-week summer school aimed at graduate students and advanced undergraduates in Philosophy, Computer Science, Mathematics, Linguistics, Psychology and related fields, especially students with interdisciplinary interests or whose research crosses traditional boundaries between these subject areas. The summer school is loosely modeled on the long-running ESSLLI series in Europe and will consist of 5 sessions of 90 minute courses each day during the week of June 18-22, followed by a Turing Symposium on June 23 celebrating the first centenary of Alan Turing's birth, and the 13th Texas Linguistics Society conference on June 23, 24. Courses * Johan van Benthem (University of Amsterdam / Stanford University): Logical Dynamics of Information and Interaction * Craige Roberts (The Ohio State University): Questions in Discourse * Noah Goodman (Stanford University): Stochastic Lambda Calculus and its Applications in Semantics and Cognitive Science * Mark Steedman (University of Edinburgh): Combinatory Categorial Grammar: Theory and Practice * Chris Potts (Stanford University): Extracting Social Meaning and Sentiment * Catherine Legg (University of Waikato): Possible Worlds: A Course in Metaphysics (for Computer Scientists and Linguists) * Adam Lopez (Johns Hopkins University): Statistical Machine Translation * Eric Pacuit (Stanford University): Social Choice Theory for Logicians * Valeria de Paiva (Rearden Commerce) & Ulrik Buchholtz (Stanford University): Introduction to Category Theory * Adam Pease (Rearden Commerce): Ontology Development and Application with Suggested Upper Merged Ontology (SUMO) * Ede Zimmermann (University of Frankfurt): Intensionality * Thomas Icard (Stanford University): Surface Reasoning * Nina Gierasimczuk (University of Groningen): Belief Revision Meets Formal Learning Theory * Robin Cooper (GÃ¶teborg University) & Jonathan Ginzburg (University of Paris): Type Theory with Records for Natural Language Semantics * Jeroen Groenendijk (University of Amsterdam) & Floris Roelofsen (University of Amsterdam): Inquisitive Semantics * Shalom Lappin (King's College London): Alternative Paradigms for Computational Semantics * Tandy Warnow (University of Texas at Austin): Estimating Phylogenetic Trees in Linguistics and Biology * Hans Kamp (University of Stuttgart / University of Texas at Austin) & Mark Sainsbury (University of Texas at Austin): Vagueness and Context * Steve Wechsler (University of Texas at Austin) & Eric McCready (Osaka University): Meaning as Use: Indexicality and Expressives Special Presentations * Pranav Anand (University of California at Santa Cruz) * Nicholas Asher (IRIT, CNRS/UniversitÃ© Paul Sabatier) * Martin Davis (Emeritus NYU) * Robert King (University of Texas at Austin) * Oleg Kiselyov (FNMOC) * Kevin Knight (USC/Information Sciences Institute) * Sarah Murray (Cornell University) * Chung-chieh Shan (Cornell University) * Bonnie Webber (University of Edinburgh) * More to be announced... Events * Turing Symposium: June 23 * Texas Linguistics Society Conference: June 23, 24 * More to be announced... Registration fees: academic discount rate $175; professional rate $400. Student scholarships will be available for 50 students (http://nasslli2012.com/scholarships; application deadline: February 29). Scholarships include registration and may include a further subsidy for travel and accommodation. NASSLLI instructors present both basic and advanced work in their disciplines, so courses appeal not only to graduate students and exceptionally advanced undergraduates, but also to post-docs and researchers in related fields. The summer school provides a unique opportunity for students to learn from prominent scholars and meet others from the active community of interdisciplinary philosophy, computer science, linguistics and psychology researchers in the US and Europe. We expect over 200 participants, and in addition to classes in the daytime, the evenings will have social events and plenary lectures. UT Austin is a large research university in Austin, Texas which is widely agreed to be one of the most exciting cities in the US and is the self-styled "Live Music Capital of the World." We aim to make NASSLLI fun. More information is available at: http://nasslli2012.com/ http://twitter.com/nasslli https://www.facebook.com/events/300928343266509/ https://plus.google.com/113636222825121167810/posts -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/www/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

MSFP 2012 deadline extension
by Paul Levy 17 Dec '11

17 Dec '11

Dear colleagues, The deadline for MSFP 2012 has been extended by one week to FRIDAY 23 DECEMBER. See details below. Best regards, James Chapman and Paul Blain Levy MSFP 2012 co-chairs -- Fourth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 March, Tallinn, Estonia A satellite workshop of ETAPS 2012 http://cs.ioc.ee/msfp/msfp2012/ The fourth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without arrows? Call-by-push-value without adjunctions? Type theory without universes? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. Important Dates: ================ Submission of papers: 23 December 2011 Notification: 25 January 2012 Final versions due: 6 Feburary 2012 Workshop: 25 March 2012 Invited Speakers: ================= Danko Ilik, Goce Delčev University of Štip, Republic of Macedonia Neil Ghani, University of Strathclyde, UK Submission: =========== Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). After the workshop, there might be an opportunity to publish selected papers in a journal special issue. All submissions must be in PDF format and use the EPTCS style files. Submissions can be made through the EasyChair website, at http://www.easychair.org/conferences/?conf=msfp2012 ETAPS: ====== European Joint Conferences on Theory and Practice of Software (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 six main annual conferences (one of them, POST, being new in 2012), accompanied by satellite workshops. ETAPS 2012 is the fifteenth event in the series. http://www.etaps.org/2012 Host City: ========== Tallinn, a city of 412,000 people, is the capital and largest city of Estonia, a small EU member country in Northern Europe, bordering Russia to the East and Latvia to the south. Located in the north of the country, on the southern shores of the Gulf of Finland, opposite Helsinki in Finland, Tallinn is most well known for its picturesque medieval Old Town, a UNESCO World Heritage site. But it also has a vivid cultural scene, outperforming most European centres of similar size. In 2011, Tallinn, along with Turku in Finland, is the Cultural Capital of Europe. Tallinn is easy to travel to. Estonia is part of Schengen and the Eurozone. The Lennart Meri International Airport of Tallinn /TLL) is only 4km from the city centre. Programme Committee: ==================== * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Paul Blain Levy (co-chair), University of Birmingham, UK * Thorsten Altenkirch, University of Nottingham, UK * Robert Atkey, University of Strathclyde, Glasgow, UK * Nils Anders Danielsson, Chalmers University and University of Gothenburg, Sweden * Martin Escardo, University of Birmingham, UK * Ichiro Hasuo, University of Tokyo, Japan * Ralf Hinze, University of Oxford, UK * Neelakantan Krishnaswami, Microsoft Research, Cambridge, UK * Daniel R. Licata, Carnegie Mellon University, Pittsburgh, PA * Ulrich Schoepp, LMU Munich, Germany * Alex Simpson, University of Edinburgh, UK * Matthieu Sozeau, INRIA, Paris, France * Sam Staton, University of Cambridge, UK Further Information: ==================== For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2012/ With any other questions please do not hesitate to contact the co-chairs at msfp2012(a)easychair.org. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Postdoc position in Mathematical Logic at Stockholm University
by Erik Palmgren 16 Dec '11

16 Dec '11

Postdoc position for 2 years in Mathematical Logic at Stockholm University, Department of Mathematics. The research in mathematical logic at the department include such subjects as constructive mathematics, point-free topology and locale theory, semantics and proof theory of type theory and constructive set theory, category-theoretic logic, topos theory and constructive aspects of mathematical logic. The department is now looking for a postdoc interested to work in the areas of the logic group and related subjects. For details, and how to apply, see the advertisement at the department web page: http://www.math.su.se/pub/jsp/polopoly.jsp?d=14714&a=101279 The deadline for application is January 23, 2012. Note that applications should be sent ordinary mail. Erik Palmgren Professor of Mathematical Logic Department of Mathematics Stockholm University SE-10691 Stockholm palmgren(a)math.su.se [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0