September 2012 - Categories - categories.org.au

Partial functor
by David Leduc 17 Mar '15

17 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

Sheaves of T-algebras
by Michael Barr 03 Oct '12

03 Oct '12

It must be known that if T is a left exact theory (same as nearly equational theory) and you make a sheaf of T-algebras (meaning the stalks are T-algebras, then the set of global sections is also a T-algebra. Can anyone give me reference? Michael -- The modern conservative is engaged in one of man's oldest exercises in moral philosophy--the search for a superior moral justification for selfishness. --J.K. Galbraith [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

4 6

call for participation: QPL 2012 - Brussels 10-12 October 2012
by Ross Duncan 01 Oct '12

01 Oct '12

========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Université Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== We invite your participation in QPL 2012! The 9th workshop on Quantum Physics and Logic will bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science techniques for the study of physical behaviour in general. There will be full programme of contributed talks, and invited lectures from: - Stefaan Caenepeel (Vrije Universiteit Brussel) - Jens Eisert (Frei Universität Berlin) - Serge Massar (Université Libre de Bruxelles - Paul-André Melliès (Université Paris Diderot - Paris 7) There will be a workshop dinner on Thursday night. The schedule and list of accepted contributions can be found on the webpage, as well as local information and registration details. Best wishes and hope to see you in Brussels. Ross Duncan - QPL 2012 local organiser ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Université Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Professorship in Algebra
by Ieke Moerdijk 29 Sep '12

29 Sep '12

Dear readers of the list, I would like to draw you attention to the fact that we are advertising for a professorship in Algebra, which will be interpreted in a broad sense. You can find the ad under http://www.ru.nl/vacatures/details/details_vacature_0?recid=520674 please feel free to approach Klaas Landsman or me if you have any questions. Ieke Moerdijk. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

An internal definition in a realizability topos
by Andrej Bauer 27 Sep '12

27 Sep '12

Consider a realizability topos RT(A) over some PCA A. There is an embedding Nabla : Set -> RT(A), which takes a set X to the assembly whose underlying set is X and the existence predicate is trivial, i.e., every element of X is realized by every realizer of A. Let [n] = {0, 1, 2, .., n-1} be the set with n elements. I have some interest in the subobject of Nabla([n]) whose underlying set is [n] and the existence predicate is E(0) = { numeral(0) } E(1) = { numeral(0), numeral(1) } ... E(k) = { numeral(k-1), numeral(k) } ... E(n-1) = {numeral(n-2)} In words: there are n elements 0, 1, 2, ..., n-1, where two consequtive elements share a realizer. The question is; is this object definable in the internal language of the topos? Note that Nabla(2) is definable as the object of not-not-stable truth values, and that each Nabla(X) is also definable with a bit more work. With kind regards, Andrej [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 2

Szekeres medal of the Australian Mathematical Society
by Steve Lack 24 Sep '12

24 Sep '12

I am very pleased to be able to announce that this morning Ross Street was awarded the Szekeres Medal of the Australian Mathematical Society. http://www.austms.org.au/The+George+Szekeres+Medal Steve Lack. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Jobs in Computer Science at the IT University of Copenhagen, Denmark
by Rasmus Ejlers Møgelberg 20 Sep '12

20 Sep '12

Associate or Assistant Professorships in Computer Science at the IT University of Copenhagen, Denmark. We are inviting applications for Associate / Assistant Professorships in Computer Science at the IT University of Copenhagen, in particular in the areas of information security, cryptography, programming languages, concurrency, logic and semantics. Application deadline is September 24, 2012 at 23:59 CEST. Please see https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=119314&Departme… for the official annoucement. Best Regards, Rasmus Mogelberg mogel(a)itu.dk [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

LICS 2013 - Call for Papers
by Andrzej Murawski 17 Sep '12

17 Sep '12

CALL FOR PAPERS Twenty-Eighth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2013) June 25-28, 2013, New Orleans, USA http://www2.informatik.hu-berlin.de/lics/lics13/ LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA, from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13 (23-25 June) and CSF13 (28-30 June). The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification. Important Dates: Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. Titles & Short Abstracts Due : January 7, 2013 Extended Abstracts Due : January 14, 2013 Author Notification (approximate) : March 22, 2013 Final Versions Due for Proceedings: April 26, 2013 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://easychair.org/conferences/?conf=lics2013. Submission Instructions: Every extended abstract must be submitted in the IEEE Proceedings 2-column 10pt format and may not be longer than 10 pages, including references. LaTeX style files will be available on the conference website. The extended abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Extended abstracts not conforming to the above requirements will be rejected without further consideration. Papers selection will be merit-based, with no a priori limit on the number of accepted papers. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference. Short Presentations: A session of short presentations, intended for descriptions of student research, works in progress, and other brief communications, is planned. These abstracts will not be published. Dates and guidelines will be posted on the LICS website. Kleene Award for Best Student Paper: An award in honor of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. Special Issues: Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science. Sponsorship: The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing and by ACM SIGACT, in cooperation with the Association for Symbolic Logic and the European Association for Theoretical Computer Science. Program Chair: Orna Kupferman, Hebrew University Program Committee: Parosh A. Abdulla, Uppsala University Amal Ahmed, Northeastern Universtiy Sergei Artemov, City University of New York Andrei Bulatov, Simon Fraser University Yijia Chen, Shanghai Jiao Tong University Veronique Cortier, CNRS, Loria Mariangiola Dezani-Ciancaglini, Univ. di Torino Thomas Ehrhard, CNRS, Universite Paris Diderot Javier Esparza, Technische Universitaet Muenchen Kousha Etessami, University of Edinburgh Maribel Fernandez, King’s College London Santiago Figueira, University of Buenos Aires Simon Gay, University of Glasgow Martin Grohe, Humboldt-Universitaet zu Berlin Martin Hofmann, LMU Munich Petr Jancar, Technical University Ostrava Barbara Jobstmann, CNRS, Verimag and Jasper DA Patricia Johann, University of Strathclyde Bakhadyr Khoussainov, The University of Auckland Antonina Kolokolova, University of Newfoundland Victor Marek, University of Kentucky Angelo Morzenti, Politecnico di Milano Lawrence Moss, Indiana University Madhavan Mukund, Chennai Math. Institute Anca Muscholl, Universite Bordeaux Mogens Nielsen, Aarhus University Catuscia Palamidessi, INRIA, Ecole Polytechnique Luc Segoufin, INRIA, ENS Cachan Natarajan Shankar, SRI International Alexandra Silva, Radboud University Nijmegen Balder ten Cate, UC Santa Cruz Kazushige Terui, Kyoto University Ron van der Meyden, Univ. of New South Wales Jeannette M. Wing, Carnegie Mellon University Nobuko Yoshida, Imperial College London Conference Chair: Mike Mislove, Tulane University Workshop Chair: Patricia Bouyer-Decitre, CNRS, ENS Cachan Publicity Chair: Andrzej Murawski, Univ. of Leicester General Chair: Luke Ong, University of Oxford Organizing Committee: Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame, Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman, Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys, Matt Valeriote Advisory Board: Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller, John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin, Moshe Vardi, Glynn Winskel [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0