From m.randall.holmes at gmail.com Thu Nov 1 15:41:49 2012 From: m.randall.holmes at gmail.com (Randall Holmes) Date: Thu, 1 Nov 2012 13:41:49 -0600 Subject: [FOM] A potentially embarrassing claim Message-ID: Dear colleagues, At this point I believe that I am in possession of a fairly accurate outline of a proof of the consistency of New Foundations. I'm not ready to release the document yet; it needs serious editing. I will be presenting it to a seminar locally in Boise. I had the basic idea at the NF 75th workshop in March and have been working on it since. NF has the same consistency strength as TST + Infinity, has the same kinds of extensions as NFU in the same ways, has no interesting consequences for the combinatorics of small sets, etc. No surprises, this is a rather boring outcome in my opinion... Details available when ready. Thomas Forster is organizing a conference next spring at Cambridge at which I would certainly be discussing this. -- Sincerely, Randall Holmes Any opinions expressed above are not the official opinions of any person or institution. -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.randall.holmes at gmail.com Fri Nov 2 10:45:21 2012 From: m.randall.holmes at gmail.com (Randall Holmes) Date: Fri, 2 Nov 2012 08:45:21 -0600 Subject: [FOM] projected NF meeting in Cambridge, forwarded from Thomas Forster Message-ID: (to the moderator, Im sending this from Thomas because Thomas cannot convince FOM to accept mail from his smartphone) ---------- Forwarded message ---------- From: tf at dpmms.cam.ac.uk To: "Foundations of Mathematics" Cc: Date: Fri, 2 Nov 2012 13:34:01 +0000 Subject: Re: [FOM] A potentially embarrassing claim I am indeed organising an NF meeting in Cambridge in the spring, current intention is last week of march and first week of april. The idea is that before Randall arrives there will be a warm-up act wherein the background and some preparatory material is set out for people who are not already familiar with it. Thus when Randall arrives we will all be primed and ready to go. The plan for the immediate future is that I will read through Randall's pdf with my Ph.D. students. I am not at this stage soliciting other offers of talks, tho' that may change. If you have something you think I may find irresistible by all means try to twist my arm. And - of course - contact me if you want to come. -- Sincerely, Randall Holmes Any opinions expressed above are not the official opinions of any person or institution. -------------- next part -------------- An HTML attachment was scrubbed... URL: From rgheck at brown.edu Fri Nov 2 15:39:35 2012 From: rgheck at brown.edu (Richard Heck) Date: Fri, 02 Nov 2012 15:39:35 -0400 Subject: [FOM] Call for Survey Articles Message-ID: <50942177.1080602@brown.edu> Philosophia Mathematica seeks to publish half a dozen survey articles on current and emerging areas of interest in philosophy of mathematics written by early-career philosophers. Please submit a 500-word sketch of the area that you propose to survey, along with a CV containing details of your publications, to the editor, Robert Thomas , by one of two deadlines, March 31 and September 30, 2013. At March 31, submissions will be considered and some topics assigned. Until Sept. 30, submissions will be considered as they arrive and may be assigned subject to not duplicating a previous assignment. Inquiries are welcome. Publication will occur individually as articles are ready. Submissions of articles and shorter discussion notes on the subjects of special issues and any other topic in philosophy of mathematics are always welcome. -- ----------------------- Richard G Heck Jr Romeo Elton Professor of Natural Theology Brown University Check out my book Frege's Theorem: http://tinyurl.com/fregestheorem Visit my website: http://frege.brown.edu/heck/ From hmflogic at gmail.com Tue Nov 6 06:59:38 2012 From: hmflogic at gmail.com (Harvey Friedman) Date: Tue, 6 Nov 2012 06:59:38 -0500 Subject: [FOM] 507: Finite Embedded Dominators Message-ID: THIS RESEARCH WAS PARTIALLY SUPPORTED BY THE JOHN TEMPLETON FOUNDATION ***************************************** THIS POSTING CONTINUES FROM http://www.math.osu.edu/~friedman.8/manuscripts.html #72, Embedded Maximal Cliques and Incompleteness, extended abstract, 17 pages, September 26, 2012. ***************************************** This posting supersedes http://www.cs.nyu.edu/pipermail/fom/2012-October/016754.html . That posting is inaccurate and has to be fixed, but I have come around to using estimates in connection with independent dominators. This is an idea that I considered before, but is not present in [1] http://www.math.osu.edu/~friedman.8/manuscripts.html #72, Embedded Maximal Cliques and Incompleteness, extended abstract, 17 pages. Also, I will be updating [1] with some small changes in notation and presentation, and with the direct finite forms presented here. Recall that [1] already has finite forms, of the algorithmic kind. These algorithmic finite forms remain crucially important, as they lead to computer investigations that seem to bring large cardinals into your desktop computer - as explained in [1]. ******************************************* Let G be a graph. We say that S is a dominator in G if and only if every v in V\S is adjacent to some w in S. We say that S is independent in G if and only if no two elements of S are adjacent. Independent dominators are dual to maximal cliques. Every graph has an independent dominator. But there is a conceptual difference that motivates the placement of estimates. Note that the independent dominator concept has a different emphasis than the maximal clique concept. The emphasis is on the positive act of "dominating". It is natural to require that every v outside S be adjacent to some w in S that bears some relation to v. Below we use a numerical relation, and have not begun to explore the use of other kinds of relations. Thus we have the following version of the Embedded Maximal Clique Theorem from [1] and its dual - the Embedded Independent Dominator Theorem. EMCT. Every order invariant graph on Q>=0^k has a LSH[n] embedded maximal clique. EIDT. Every order invariant graph on Q>=0^k has a LSH[n] embedded independent dominator. Here SH[n] +1 on {0,...,n}, and LSH[n] is LSH[n] extended by the identity on Q>n+1. The norm of x in Q>=0^k is the least r such that x can be written with numerators and denominators <= r. Let G be a graph on Q>=0^k. We say that S is an r-dominator if and only if every v in Q>=0^k\S of norm i <= r is adjacent to some w in S of norm <= (8i)^k. Compare this with: S is a dominator if and only if every v in Q>=0^k\S is adjacent to some w in S. FEIDT. Every order invariant graph on Q>=0^k has a finite LSH[k] embedded independent k-dominator. FEIDT. Every order invariant graph on Q>=0^k has a finite LSH[n] embedded independent r-dominator. The above are explicitly Pi02. However, we can obviously exponentially bound the norms of the vectors involved, thereby arriving at explicitly Pi01 statements. THEOREM 1. EMCT, EIDT are provably equivalent to Con(SRP) over WKL_0. FEIDT (both forms) is provably equivalent to Con(SRP) over EFA. The expression (8i)^k is chosen to be crude and safe. It will be revisited in due course, as things settle down. ***************************************** I use http://www.math.ohio-state.edu/~friedman/ for downloadable manuscripts. This is the 507th in a series of self contained numbered postings to FOM covering a wide range of topics in f.o.m. The list of previous numbered postings #1-449 can be found in the FOM archives at http://www.cs.nyu.edu/pipermail/fom/2010-December/015186.html 450: Maximal Sets and Large Cardinals II 12/6/10 12:48PM 451: Rational Graphs and Large Cardinals I 12/18/10 10:56PM 452: Rational Graphs and Large Cardinals II 1/9/11 1:36AM 453: Rational Graphs and Large Cardinals III 1/20/11 2:33AM 454: Three Milestones in Incompleteness 2/7/11 12:05AM 455: The Quantifier "most" 2/22/11 4:47PM 456: The Quantifiers "majority/minority" 2/23/11 9:51AM 457: Maximal Cliques and Large Cardinals 5/3/11 3:40AM 458: Sequential Constructions for Large Cardinals 5/5/11 10:37AM 459: Greedy CLique Constructions in the Integers 5/8/11 1:18PM 460: Greedy Clique Constructions Simplified 5/8/11 7:39PM 461: Reflections on Vienna Meeting 5/12/11 10:41AM 462: Improvements/Pi01 Independence 5/14/11 11:53AM 463: Pi01 independence/comprehensive 5/21/11 11:31PM 464: Order Invariant Split Theorem 5/30/11 11:43AM 465: Patterns in Order Invariant Graphs 6/4/11 5:51PM 466: RETURN TO 463/Dominators 6/13/11 12:15AM 467: Comment on Minimal Dominators 6/14/11 11:58AM 468: Maximal Cliques/Incompleteness 7/26/11 4:11PM 469: Invariant Maximality/Incompleteness 11/13/11 11:47AM 470: Invariant Maximal Square Theorem 11/17/11 6:58PM 471: Shift Invariant Maximal Squares/Incompleteness 11/23/11 11:37PM 472. Shift Invariant Maximal Squares/Incompleteness 11/29/11 9:15PM 473: Invariant Maximal Powers/Incompleteness 1 12/7/11 5:13AMs 474: Invariant Maximal Squares 01/12/12 9:46AM 475: Invariant Functions and Incompleteness 1/16/12 5:57PM 476: Maximality, CHoice, and Incompleteness 1/23/12 11:52AM 477: TYPO 1/23/12 4:36PM 478: Maximality, Choice, and Incompleteness 2/2/12 5:45AM 479: Explicitly Pi01 Incompleteness 2/12/12 9:16AM 480: Order Equivalence and Incompleteness 481: Complementation and Incompleteness 2/15/12 8:40AM 482: Maximality, Choice, and Incompleteness 2 2/19/12 7:43AM 483: Invariance in Q[0,n]^k 2/19/12 7:34AM 484: Finite Choice and Incompleteness 2/20/12 6:37AM__ 485: Large Large Cardinals 2/26/12 5:55AM 486: Naturalness Issues 3/14/12 2:07PM 487: Invariant Maximality/Naturalness 3/21/12 1:43AM 488: Invariant Maximality Program 3/24/12 12:28AM 489: Invariant Maximality Programs 3/24/12 2:31PM 490: Invariant Maximality Program 2 3/24/12 3:19PM 491: Formal Simplicity 3/25/12 11:50PM 492: Invariant Maximality/conjectures 3/31/12 7:31PM 493: Invariant Maximality/conjectures 2 3/31/12 7:32PM 494: Inv Max Templates/Z+up, upper Z+ equiv 4/5/12 4:17PM 495: Invariant Finite Choice 4/5/12 4:18PM 496: Invariant Finite Choice/restatement 4/8/12 2:18AM 497: Invariant Maximality Restated 5/2/12 2:49AM 498: Embedded Maximal Cliques 1 9/18/12 12:43AM 499. Embedded Maximal Cliques 2 9/19/12 2:50AM 500: Embedded Maximal Cliques 3 9/20/12 10:15PM 501: Embedded Maximal Cliques 4 9/23/12 2:16AM 502: Embedded Maximal Cliques 5 9/26/12 1:21AM 503: Proper Classes of Graphs 10/13/12 12:17PM 504. Embedded Maximal Cliques 6 10/14/12 12:49PM 505: Function Transfer Theory 10/21/12 2:15AM 506: Finite Embedded Weakly Maximal Cliques 10/23/12 12:53AM Harvey Friedman From martin at eipye.com Sun Nov 4 20:55:21 2012 From: martin at eipye.com (Olivier Bournez) Date: Sun, 04 Nov 2012 17:55:21 -0800 Subject: [FOM] [ACiE] CFP CiE 2013: The Nature of Computation Message-ID: <50971c4e.6fd2440a.34f9.527b@mx.google.com> ************************************************************************ CALL FOR PAPERS: CiE 2013: The Nature of Computation Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications. CiE 2013 conference topics include, but not exclusively: * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: * Gerard Alberts (Amsterdam) * Lu?s Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzs?bet Csuhaj-Varj? (Budapest) * Anuj Dawar (Cambridge, Co-chair) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * J?r?me Durand-Lose (Orl?ans) * Viv Kendon (Leeds) * Bj?rn Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John?s NF) * Benedikt L?we (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ From martin at eipye.com Sun Nov 4 21:21:45 2012 From: martin at eipye.com (GRLMC) Date: Sun, 04 Nov 2012 18:21:45 -0800 Subject: [FOM] LATA 2013: submission deadline extended Message-ID: <50972280.2955420a.5c2d.4a67@mx.google.com> ---------------------------------------------------------------------------------------------------- SUBMISSION DEADLINE EXTENDED: November 15 !!! ---------------------------------------------------------------------------------------------------- 7th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2013 Bilbao, Spain April 2-5, 2013 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/LATA2013/ AIMS: LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2013 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). VENUE: LATA 2013 will take place in Bilbao, at the Basque Country in Northern Spain. The venue will be the Basque Center for Applied Mathematics (BCAM). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: ??? algebraic language theory ??? algorithms for semi???structured data mining ??? algorithms on automata and words ??? automata and logic ??? automata for system analysis and programme verification ??? automata, concurrency and Petri nets ??? automatic structures ??? cellular automata ??? combinatorics on words ??? computability ??? computational complexity ??? computational linguistics ??? data and image compression ??? decidability questions on words and languages ??? descriptional complexity ??? DNA and other models of bio???inspired computing ??? document engineering ??? foundations of finite state technology ??? foundations of XML ??? fuzzy and rough languages ??? grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) ??? grammars and automata architectures ??? grammatical inference and algorithmic learning ??? graphs and graph transformation ??? language varieties and semigroups ??? language???based cryptography ??? language???theoretic foundations of artificial intelligence and artificial life ??? parallel and regulated rewriting ??? parsing ??? pattern recognition ??? patterns and codes ??? power series ??? quantum, chemical and optical computing ??? semantics ??? string and combinatorial issues in computational biology and bioinformatics ??? string processing algorithms ??? symbolic dynamics ??? symbolic neural networks ??? term rewriting ??? transducers ??? trees, tree languages and tree automata ??? weighted automata STRUCTURE: LATA 2013 will consist of: ??? invited talks ??? invited tutorials ??? peer???reviewed contributions INVITED SPEAKERS: Jin-Yi Cai (Madison), Complexity Dichotomy for Counting Problems Kousha Etessami (Edinburgh), Algorithms for Analyzing Infinite-state Recursive Probabilistic Systems Luke Ong (Oxford), tutorial Languages and Automata for Higher-order Model Checking Jo??l Ouaknine (Oxford), tutorial Discrete Linear Dynamical Systems Thomas Schwentick (Dortmund), Applications of Automata in Database Theory -- Challenges to Automata Theory from Databases Andrei Voronkov (Manchester), The Lazy Reviewer Assignment Problem in EasyChair PROGRAMME COMMITTEE: Parosh Aziz Abdulla (Uppsala) Franz Baader (Dresden) Jos Baeten (CWI, Amsterdam) Christel Baier (Dresden) Gerth St??lting Brodal (Aarhus) John Case (Delaware) Marek Chrobak (Riverside) Mariangiola Dezani (Torino) Rod Downey (Wellington) Ding-Zhu Du (Dallas) Ivo D??ntsch (Brock) E. Allen Emerson (Austin) Javier Esparza (Technical University Munich) Michael R. Fellows (Darwin) Alain Finkel (ENS Cachan) Dov M. Gabbay (King???s, London) J??rgen Giesl (Aachen) Rob van Glabbeek (NICTA, Sydney) Georg Gottlob (Oxford) Annegret Habel (Oldenburg) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Charanjit S. Jutla (IBM Thomas J. Watson) Ming-Yang Kao (Northwestern) Deepak Kapur (Albuquerque) Joost-Pieter Katoen (Aachen) S. Rao Kosaraju (Johns Hopkins) Evangelos Kranakis (Carleton) Hans-J??rg Kreowski (Bremen) Tak-Wah Lam (Hong Kong) Gad M. Landau (Haifa) Kim G. Larsen (Aalborg) Richard Lipton (Georgia Tech) Jack Lutz (Iowa State) Ian Mackie (??cole Polytechnique, Palaiseau) Rupak Majumdar (Max Planck, Kaiserslautern) Carlos Mart??n-Vide (Tarragona, chair) Paliath Narendran (Albany) Tobias Nipkow (Technical University Munich) David A. Plaisted (Chapel Hill) Jean-Fran??ois Raskin (Brussels) Wolfgang Reisig (Humboldt Berlin) Micha??l Rusinowitch (LORIA, Nancy) Davide Sangiorgi (Bologna) Bernhard Steffen (Dortmund) Colin Stirling (Edinburgh) Alfonso Valencia (CNIO, Madrid) Helmut Veith (Vienna Tech) Heribert Vollmer (Hannover) Osamu Watanabe (Tokyo Tech) Pierre Wolper (Li??ge) Louxin Zhang (Singapore) ORGANIZING COMMITTEE: Adrian Horia Dediu (Tarragona) Peter Leupold (Tarragona) Carlos Mart??n???Vide (Tarragona, co-chair) Magaly Rold??n (Bilbao) Bianca Truthe (Magdeburg) Florentina Lilica Voicu (Tarragona) Enrique Zuazua (Bilbao, co-chair) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single???spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). Submissions have to be uploaded to: https://www.easychair.org/conferences/?conf=lata2013 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer???reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration is open from August 6, 2012 to April 2, 2013. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2013/ FEES: Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On???site registration fees: 580 Euro On???site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by January 2, 2013 will be excluded from the proceedings. One registration gives the right to present only one paper. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before January 2, 2013 (resp. March 23, 2013) to the conference bank account: Uno-e Bank bank???s address: Julian Camarillo 4 C, 28037 Madrid, Spain IBAN: ES3902270001820201823142 BIC/SWIFT: UNOEESM1 account holder: C. Martin ? GRLMC account holder???s address: Av. Catalunya 35, 43002 Tarragona, Spain Please mention LATA 2013 and your name in the subject. A receipt will be provided on site. Remarks: - Bank transfers should not involve any expense for the conference. - People claiming early registration will be requested to prove that the bank transfer order was carried out by the deadline. - PhD students will need to provide evidence of their status on site. People registering on site must pay in cash. For the sake of local organization, however, it is much recommended to do it earlier. DEADLINES: Paper submission: November 15, 2012 (23:59h, CET) ? EXTENDED - Notification of paper acceptance or rejection: December 16, 2012 Final version of the paper for the LNCS proceedings: December 25, 2012 Early registration: January 2, 2013 Late registration: March 23, 2013 Starting of the conference: April 2, 2013 End of the conference: April 5, 2013 Submission to the post???conference journal special issue: July 5, 2013 QUESTIONS AND FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34???977???559543 Fax: +34???977???558386 ACKNOWLEDGEMENTS: Basque Center for Applied Mathematics Diputaci?? de Tarragona Universitat Rovira i Virgili -------------- next part -------------- An HTML attachment was scrubbed... URL: From martin at eipye.com Sun Nov 4 21:24:32 2012 From: martin at eipye.com (Andrzej Murawski) Date: Sun, 04 Nov 2012 18:24:32 -0800 Subject: [FOM] [LICS] LICS Newsletter 140 Message-ID: <50972325.07cc440a.10d0.ffffad13@mx.google.com> Newsletter 140 November 4, 2012 ******************************************************************* * Past issues of the newsletter are available at http://lii.rwth-aachen.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://lii.rwth-aachen.de/lics/newsletters/inst.html ******************************************************************* TABLE OF CONTENTS * DEADLINES Deadlines in the coming weeks * LICS-RELATED CALLS LICS 2013 - Call for Workshop Proposals LICS 2013 - Call for Papers * CALLS FOR PAPERS/PROPOSALS CADE-24 - Call for Workshops, Tutorials and System Competitions LATA 2013 - Call for Papers CAV 2013 - Call for Workshop Proposals RDP 2013 - Call for Workshop Proposals TERMGRAPH 2013 - Call for Papers CAV 2013 - Call for Papers CADE-24 - Call for Papers DICE 2013 - Call for Papers PETRI NETS 2013 - Call for Papers TASE 2013 - Call for Papers TLCA 2013 - Call for Papers TAP 2013 - Call for Papers RTA 2013 - Call for Papers CALCO 2013 - Call for Papers DEADLINES * CADE-24 Proposal submission: November 9, 2012 http://www.cade-24.info/ * LATA 2013 Paper submission: November 15, 2012 http://grammars.grlmc.com/LATA2013/ * CAV 2013 Workshop Proposal: November 23, 2012 http://cav2013.forsyte.at/ * LICS 2013 Workshop Proposals: November 26, 2012 http://informatik.hu-berlin.de/lics/lics13/ * RDP 2013 Workshop Proposals: December 1, 2012 http://www.win.tue.nl/rdp2013/ * TERMGRAPH 2013 Abstract submission: December 20, 2012 Paper submission: January 7, 2013 http://termgraph2013.imag.fr * CAV 2013 Abstract submission: January 3, 2013 Paper submission (firm): January 7, 2013 http://cav2013.forsyte.at/ * CADE-24 Abstract submission: January 7, 2013 Paper submission: January 14, 2013 http://www.cade-24.info/ * LICS 2013 Title & Short Abstracts: January 7, 2013 Extended Abstracts: January 14, 2013 http://informatik.hu-berlin.de/lics/lics13/ * DICE 2013 Submission: January 10, 2013 http://dice2013.di.unito.it/ * PETRI NETS 2013 Submission of Papers: January 10, 2013 Submission of Tutorial Proposals: January 10, 2013 http://www.mc3.disco.unimib.it/petrinets2013/ * TASE 2013 Title and abstract submission: January 18, 2013 Paper submission: January 25, 2013 http://www1.aston.ac.uk/tase2013/ * TLCA 2013 Paper Registration (titles & short abstracts): January 25, 2013 Full Paper Submission: 1 February 2013 http://www.win.tue.nl/rdp2013/ * TAP 2013 Abstract submission: January 25, 2013 Paper submission: February 1, 2013 http://www.spacios.eu/TAP2013 * RTA 2013 Abstract submission: February 1, 2013 Paper submission: February 5, 2013 http://www.win.tue.nl/rdp2013/ * CALCO 2013 Abstract Submission: February 22, 2013 Paper Submission: March 1, 2013 http://coalg.org/calco13/ 28TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2013) Call for Workshop Proposals June 24, 28-29, 2013 New Orleans, USA http://www2.informatik.hu-berlin.de/lics/lics13/ * LOCATION AND COLOCATION The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science (LICS 2013) will be held in New Orleans, USA, 25-28 June 2013. It will be colocated with MFPS (Mathematical Foundations of Programming Semantics) and CSF (IEEE Computer Security Foundations). Possible dates for workshops are Monday 24 June, Friday 28 June afternoon, and Saturday 29 June. * SCOPE Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. * PROPOSALS Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - A discussion of the proposed format and agenda. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Your preferred dates. This is important! - Let us know if you would like your workshop to be a joint workshop with CSF. In that case you should submit to both. - Procedures for selecting participants and papers. - Expected number of participants. This is important! - Potential invited speakers. - Plans for dissemination (for example, special issues of journals). * SUBMISSION Proposals should be submitted via Easychair at https://www.easychair.org/conferences/?conf=licsworkshops2013 * IMPORTANT DATES Submission deadline: November 26, 2012 Notification: December 20, 2012 Program of the workshops ready: April 30, 2013 Workshops: June 24, 2013 or June 28-29, 2013 LICS conference: June 25-28, 2013 * WORKSHOPS CHAIR Patricia Bouyer-Decitre, CNRS, ENS Cachan * SELECTION COMMITTEE The workshops selection committee consists of the LICS General Chair, LICS Workshops Chair, LICS 2013 PC Chair and LICS 2013 Conference Chair. 28TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2013) Call for Papers June 25-28, 2013 New Orleans, USA http://informatik.hu-berlin.de/lics/lics13/ * LOCATION AND COLOCATION 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 (26-28 June). * SCOPE 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 Titles & Short Abstracts Due : January 7, 2013 Extended Abstracts Due : January 14, 2013 Author Notification (approximate) : March 22, 2013 * KLEENE AWARD 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. * 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, University of Leicester * GENERAL CHAIR Luke Ong, University of Oxford 24TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-24) Call for Workshops, Tutorials and System Competitions Lake Placid, USA 9-14 June 2013 http://www.cade-24.info * SCOPE CADE is the major international forum at which research on all aspects of automated deduction is presented. * CALL FOR WORKSHOPS Workshop proposals for CADE-24 are solicited. Both well-established workshops and newer ones are encouraged. Similarly, proposals for workshops with a tight focus on a core automated reasoning specialization, as well as those with a broader, more applied focus, are very welcome. Please provide the following information in your application document: + Workshop title + Names and affiliations of organizers + Proposed workshop duration (from half a day to two days) + Brief description of the goals and the scope of the workshop. Why is the workshop relevant for CADE? + Is the workshop new or has it met previously? In the latter case information on previous meetings should be given. + What are the plans for publication? * CALL FOR TUTORIALS Tutorial proposals for CADE-24 are solicited. Tutorials are expected to be half-day events, with a theoretical or applied focus, on a Topic Of Interest for CADE-24. Proposals should provide the following information: + Tutorial title. + Names and affiliations of organizers. + Brief description of the tutorial's goals and topics to be covered. + Whether or not a version of the tutorial has been given previously. CADE will take care of printing and distributing notes for tutorials that would like this service. * CALL FOR SYSTEM COMPETITIONS The CADE ATP Systems Competition CASC, which evaluates automated theorem proving systems for classical logics, has become an integral part of the CADE conferences. Further system competition proposals are solicited. The goal is to foster the development of automated reasoning systems in all areas relevant for automated deduction in a broader sense. + Competition title. + Names and affiliations of organizers. + Duration and schedule of the competition. + Room/space requirements. + Description of the competition task and the evaluation procedure. + Is the competition new or has it been organized before? In the latter case information on previous competitions should be given. + What computing resources are required and how will they be provided? * IMPORTANT DATES Deadline for proposal submissions: 9 November 2012 Acceptance/rejection notification: 30 November 2012 Workshops and Tutorials: 9-10 June 2013 Competitions: 9-14 June 2013 Conference: 11-14 June 2013 * SUBMISSION INSTRUCTIONS Proposals should be uploaded via https://www.easychair.org/conferences/?conf=cade24workshopscompe * CONFERENCE CO-CHAIRS Christopher A. Lynch Clarkson University Neil V. Murray SUNY Albany * PROGRAM COMMITTEE CHAIR Maria Paola Bonacina Universita degli Studi di Verona * TUTORIAL CHAIR Peter Baumgartner NICTA and Australian National University * WORKSHOP AND COMPETITION CHAIR Christoph Benzmueller Freie Universitaet Berlin * PUBLICITY AND WEB CHAIR Grant Olney Passmore Cambridge University and University of Edinburgh 7th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA, THEORY AND APPLICATIONS (LATA 2013) Call for Papers Bilbao, Spain, April 2-5, 2013 http://grammars.grlmc.com/LATA2013/ * AIMS LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2013 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence). * VENUE LATA 2013 will take place in Bilbao, at the Basque Country in Northern Spain. The venue will be the Basque Center for Applied Mathematics (BCAM). * SCOPE Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - automatic structures - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - foundations of XML - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - symbolic neural networks - term rewriting - transducers - trees, tree languages and tree automata - weighted automata * STRUCTURE LATA 2013 will consist of - 3 invited talks - 2 invited tutorials - peer-reviewed contributions * PROGRAMME COMMITTEE Parosh Aziz Abdulla (Uppsala) Franz Baader (Dresden) Jos Baeten (CWI, Amsterdam) Christel Baier (Dresden) Gerth Stolting Brodal (Aarhus) John Case (Delaware) Marek Chrobak (Riverside) Mariangiola Dezani (Torino) Rod Downey (Wellington) Ding-Zhu Du (Dallas) Ivo Duentsch (Brock) E. Allen Emerson (Austin) Javier Esparza (Technical University Munich) Michael R. Fellows (Darwin) Alain Finkel (ENS Cachan) Dov M. Gabbay (King's, London) Juergen Giesl (Aachen) Rob van Glabbeek (NICTA, Sydney) Georg Gottlob (Oxford) Annegret Habel (Oldenburg) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Charanjit S. Jutla (IBM Thomas J. Watson) Ming-Yang Kao (Northwestern) Deepak Kapur (Albuquerque) Joost-Pieter Katoen (Aachen) S. Rao Kosaraju (Johns Hopkins) Evangelos Kranakis (Carleton) Hans-Joerg Kreowski (Bremen) Tak-Wah Lam (Hong Kong) Gad M. Landau (Haifa) Kim G. Larsen (Aalborg) Richard Lipton (Georgia Tech) Jack Lutz (Iowa State) Ian Mackie (Ecole Polytechnique, Palaiseau) Rupak Majumdar (Max Planck, Kaiserslautern) Carlos Martin-Vide (Tarragona, chair) Paliath Narendran (Albany) Tobias Nipkow (Technical University Munich) David A. Plaisted (Chapel Hill) Jean-Francois Raskin (Brussels) Wolfgang Reisig (Humboldt Berlin) Michael Rusinowitch (LORIA, Nancy) Davide Sangiorgi (Bologna) Bernhard Steffen (Dortmund) Colin Stirling (Edinburgh) Alfonso Valencia (CNIO, Madrid) Helmut Veith (Vienna Tech) Heribert Vollmer (Hannover) Osamu Watanabe (Tokyo Tech) Pierre Wolper (Liege) Louxin Zhang (Singapore) * PUBLICATION A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. * DEADLINES Paper submission: November 15, 2012 (23:59 CET) Notification of paper acceptance or rejection: December 16, 2012 Final version of the paper for the LNCS proceedings: December 25, 2012 25TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION (CAV 2013) Call for Workshop Proposals Saint Petersburg, Russia July 13-19, 2013 http://cav2013.forsyte.at/ * GENERAL The 2013 Computer-Aided Verification (CAV) Workshops provide an opportunity for participants to discuss topics in the broader verification related domains. CAV 2013 Workshops will be held before the main conference on July 13 and 14. Workshop proposals will be reviewed by the workshop chair along with the program chairs and members of the steering committee. Proposals must consist of the following two parts: - Part I: Technical Information A short (about 1 page) scientific justification of the proposed topic, its significance and relevance to CAV, and the particular benefits of the workshop to the verification community, as well as a list of previous or related workshops (if relevant). - Part II: Organizational Information - contact information of the workshop organizers - identifying a main contact for the workshop (i.e. a workshop chair) - the desired length of the workshop, (one or two days) - estimate of the audience size - proposed format and agenda (for example, demo sessions, tutorials, etc.) - potential invited speakers - procedures for selecting papers and participants - plans for dissemination, if any (for example, special issues of journals) - special technical, AV, or USB stick needs - links to a preliminary website of the workshop and call for papers (if possible) - information if workshop has been previously held * IMPORTANT DATES Proposals are due by Nov 23, 2012 by email to the workshop chair. Organizers will be notified by Nov 30, 2012. The workshop proposals will be reviewed and evaluated on the following criteria: - Potential to advance state of the art in verification technologies, especially ability to break new ground. - Relevance to CAV. - Overlap of topics with other proposed workshops. - Past-successes of the workshop and association with previous CAV conferences. - Organizers' ability and experience to lead a successful workshop. 7TH INTERNATIONAL CONFERENCE ON REWRITING, DEDUCTION AND PROGRAMMING (RDP 2013) Call for Workshop Proposals Eindhoven, The Netherlands June 23-28, 2013 http://www.win.tue.nl/rdp2013/ * SCOPE RDP 2013 is the seventh edition of the International Conference on Rewriting, Deduction, and Programming, consisting of two main conferences RTA (Rewriting Techniques and Applications), June 24-26, and TLCA (Typed Lambda Calculi and Applications), June 26-28. * DATES Workshop proposals for RDP 2013 are solicited for the days June 24 (Monday), June 25 (Tuesday), June 27 (Thursday) and June 28 (Friday). Both well-established workshops and newer ones are encouraged. Also system competition proposals are solicited. Due to the overlap with the conferences, workshops most related to TLCA are expected to be on June 24 and 25, and workshops most related to RTA are expected to be on June 27 and 28. * CONTACT If you want to organize a workshop, please send the following information to Hans Zantema (h.zantema at tue.nl), no later than December 1, 2012: - Workshop title and description of the topic, - Names and affiliations of the organizers, and - Proposed workshop duration (from half a day to two days). Notification date: December 20. 7TH INTERNATIONAL WORKSHOP ON COMPUTING WITH TERMS AND GRAPHS (TERMGRAPH 2013) Call for Papers Rome, Italy March 23rd, 2013 (Part of ETAPS 2013) http://termgraph2013.imag.fr * AIMS AND SCOPE Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, for instance : the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages: many implementations of functional, logic, object-oriented, concurrent and mobile calculi are based on term graphs. Term graphs are also used in automated theorem proving and symbolic computation systems working on shared structures. The aim of this workshop is to bring together researchers working in different domains on term and graph transformation and to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in term graph rewriting. * ETAPS TERMGRAPH 2013 is a one-day satellite event of ETAPS 2013, which will take place in Rome, Italy, from March 16 to March 24, 2013. Previous editions of the TERMGRAPH workshop series (http://www.termgraph.org.uk/) took place in Barcelona (2002), in Rome (2004), in Vienna (2006), in Braga (2007) in York (2009) and in Saarbr?cken (2011). * IMPORTANT DATES December 20, 2012 Abstract submission January 7, 2013 Paper submission January 25, 2013 Notification of acceptance February 10, 2013 Proceedings version due * TOPICS Topics of interest are open and include all aspects of term graphs and sharing of common subexpressions in rewriting, programming, automated reasoning and symbolic computation. This includes (but is not limited to): term rewriting, graph transformation, graph-based implementations of lambda-calculus, programming languages, models of computation, graph-based languages, semantics and implementation of programming languages, compiler construction, pattern recognition, databases, bioinformatics, and system descriptions. * SUBMISSION AND PUBLICATION Authors are invited to submit either regular papers (up to 15 pages), or position papers, system descriptions, work in progress, extended abstracts (5-7 pages), via the EasyChair system, at URL https://www.easychair.org/conferences/?conf=termgraph2013 Submissions should be in PDF format, using the EPTCS style files (http://style.eptcs.org/). The Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS). * PROGRAM COMMITTEE Patrick Bahr, University of Copenhagen, Denmark Paolo Baldan, University of Padova, Italy Andrea Corradini, University of Pisa, Italy Frank Drewes, Umea University, Sweden Rachid Echahed (co-chair), CNRS and University of Grenoble, France Maribel Fernandez, King's College London, UK Clemens Grabmayer, Utrecht University, the Netherlands Wolfram Kahl, McMaster University, Canada Ian Mackie, Ecole Polytechnique, France Detlef Plump (co-chair), University of York, UK * ORGANIZERS Rachid Echahed, CNRS and University of Grenoble, France Detlef Plump, University of York, UK 25TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION (CAV 2013) Call for Papers St. Petersburg, Russia July 13-19, 2013 http://cav2013.forsyte.at/ * SCOPE The conference on Computer Aided Verification (CAV), 2013, is the 25th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. * TOPICS - Algorithms and tools for verifying models and implementations - Hardware verification techniques - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Verification methods for parallel and concurrent hardware/software systems - Testing and runtime analysis based on verification technology - Applications and case studies in verification - Decision procedures and solvers for verification - Mathematical and logical foundations of practical verification tools - Verification in industrial practice - Algorithms and tools for system synthesis - Hybrid systems and embedded systems verification - Verification techniques for security - Formal models and methods for biological systems * IMPORTANT DATES Abstract submission due: January 3, 2013; Paper submission (firm): January 7, 2013 anywhere on earth; Author feedback/rebuttal period: February 20-22, 2013; Notification of acceptance/rejection: March 6, 2013; Final version due: April 6, 2013 24TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-24) Call for Papers June 9-14, 2013 Lake Placid, New York, USA http://www.cade-24.info/ * SCOPE CADE is the major forum for the presentation of research in all aspects of automated deduction. The conference program features invited talks, paper presentations, system descriptions, workshops, tutorials, and system competitions, including the CADE ATP System Competition (CASC). CADE-24 invites high-quality submissions on the general topic of automated reasoning, including foundations, applications, implementations and practical experiences. - Logics of interest include: propositional, first-order, equational, classical, higher-order, non-classical, constructive, modal, temporal, many-valued, description, meta-logics, logical frameworks, type theory, set theory, as well as any combination thereof. - Paradigms of interest include: theorem proving, model building, constraint solving, computer algebra, model checking, proof checking, and their integrations. - Methods of interest include: resolution, superposition or paramodulation, completion, saturation, term rewriting, decision procedures and their combinations, model elimination, connection method, inverse method, tableaux, induction, proof planning, sequent calculi, natural deduction, as well as their supporting algorithms and data structures, including unification, matching, orderings, indexing, proof presentation and explanation, and search plans or strategies for inference control, including semantic guidance and AI-related methods. - Applications of interest include: analysis, verification and synthesis of software and hardware, formal methods, computer mathematics, computational logic, declarative programming, knowledge representation, deductive databases, natural language processing, computational linguistics, ontology reasoning, robotics, planning, and other areas of artificial intelligence. * PUBLICATION AND SUBMISSION The proceedings of the conference will be published in the Springer LNAI/LNCS series. Submissions can be made in the categories 'regular paper' (max 15 pages) and 'system description' (max 7 pages). Full system descriptions that provide in-depth presentation of original ideas in an implemented system can be submitted as regular papers. The page for electronic submission via EasyChair is https://www.easychair.org/conferences/?conf=cade24. * IMPORTANT DATES Title and abstract must be submitted before the paper. Abstract submission: 7 January 2013 Paper submission: 14 January 2013 Notification: 11 March 2013 Final version: 1 April 2013 Workshops and Tutorials: 9-10 June 2013 Competitions: 9-14 June 2013 Conference: 11-14 June 2013 * CONFERENCE CO-CHAIRS Christopher A. Lynch Clarkson University Neil V. Murray University at Albany - SUNY * PROGRAM COMMITTEE CHAIR Maria Paola Bonacina Universita degli Studi di Verona * WORKSHOP AND COMPETITION CHAIR Christoph Benzmueller Freie Universitaet Berlin * TUTORIAL CHAIR Peter Baumgartner NICTA and Australian National University * PUBLICITY AND WEB CHAIR Grant Olney Passmore Cambridge University and Edinburgh University * PROGRAM COMMITTEE Alessandro Armando Universita degli Studi di Genova & FBK Trento, Italy Peter Baumgartner NICTA & Australian National University, Australia Christoph Benzmueller Freie Universitaet Berlin, Germany Maria Paola Bonacina Universita degli Studi di Verona, Italy (Chair) Cristina Borralleras Universitat de Vic, Spain Thierry Boy De La Tour Universite de Grenoble, France Evelyne Contejean CNRS & Universite de Paris-Sud, France Leonardo De Moura Microsoft Research, USA Stephanie Delaune Ecole Nationale Superieure de Cachan, France Clare Dixon University of Liverpool, UK Pascal Fontaine Universite de Lorraine & LORIA, France Ulrich Furbach Universitaet Koblenz-Landau, Germany Ruben Gamboa University of Wyoming, USA Juergen Giesl RWTH Aachen, Germany Paul B. Jackson University of Edinburgh, UK Predrag Janicic Univerzitet u Beogradu, Serbia Helene Kirchner INRIA Rocquencourt, France Konstantin Korovin University of Manchester, UK K. Rustan M. Leino Microsoft Research, USA Christopher A. Lynch Clarkson University, USA Cesar A. Munoz NASA Langley, USA Neil V. Murray University at Albany - SUNY , USA Lawrence C. Paulson University of Cambridge, UK Frank Pfenning Carnegie Mellon University, USA Brigitte Pientka McGill University, Canada David A. Plaisted University of North Carolina at Chapel Hill, USA Christophe Ringeissen LORIA & INRIA Nancy-Grand Est, France Ulrike Sattler University of Manchester, UK Renate A. Schmidt University of Manchester, UK Manfred Schmidt-Schauss Johann Wolfgang Goethe Universitaet, Germany Stephan Schulz Technische Universitaet Muenchen, Germany Viorica Sofronie-Stokkermans Universitaet Koblenz-Landau, Germany Ashish Tiwari SRI International, USA Uwe Waldmann MPI fuer Informatik, Germany Christoph Weidenbach MPI fuer Informatik, Germany Jian Zhang Chinese Academy of Sciences, P.R. China 4TH WORKSHOP ON DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY (DICE 2013) Call for Papers Rome, Italy March 16-17, 2013 (satellite event of ETAPS 2013) http://dice2013.di.unito.it/ * IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 * INVITED - Jean-Yves Marion (Loria - INPL Nancy) - Marko van Eekelen (Open University - Radboud University Nijmegen) - Paul-Andr? Melli?s (PPS, Paris) * SCOPE The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/ computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity-bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). * SUBMISSIONS Authors are invited to submit an extended abstract, up to 5 pages. Abstracts should be written in English, in the form of a PDF file uploaded to DICE 13 page at Easychair https://www.easychair.org/account/signin.cgi?conf=dice2013. Submissions of abstracts by PC members are allowed and encouraged. We plan on not having pre-proceedings; an open call for post-proceedings, hopefully as special issue of a journal, will follow. * PROGRAM COMMITTEE: - Roberto Amadio (Paris-Diderot) - Harry Mairson (Brandeis) - Virgile Mogbil (Paris 13) - Simona Ronchi Della Rocca (Torino) (Chair) - Luca Roversi (Torino) - Olha Shkaravska (Nijmegen) - Ulrich Sch?pp (LMU) - Aleksy Shubert (Warsaw) - Jakob G. Simonsen (DIKU) 34TH INTERNATIONAL CONFERENCE ON APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY (PETRI NETS 2013) Call for Papers Milano, Italy June 24-28, 2013 http://www.mc3.disco.unimib.it/petrinets2013/ * SCOPE The 34th annual international Petri Net conference will be organised by the Department of Computer Science, Systems and Communication (DISCo), University of Milano - Bicocca. The conference takes place under the auspices of the EATCS, and GI SIG "Petri Nets and Related System Models". The language of the conference is English, and its proceedings will be published by Springer-Verlag in Lecture Notes in Computer Science. All accepted papers will be considered for the "Outstanding Paper" award(s). Papers presenting original research on application or theory of Petri nets, as well as contributions addressing topics relevant to the general field of distributed and concurrent systems are sought. * IMPORTANT DATES Submission of Papers: January 10, 2013 Submission of Tutorial Proposals: January 10, 2013 Notification: March 1, 2013 Final Version Due: April 1, 2013 Participation in Tool Exhibition: June 1, 2013 Workshops & Tutorials: June 24-25, 2013 Conference: June 26-28, 2013 The deadline for submission of papers is STRICT. However, if you submit the title page by January 10 it is sufficient to submit the full paper by January 15. * TOPICS + Topics specific to Petri Nets - System design using nets - Analysis and synthesis, structure and behaviour of nets - Relationships between Petri Nets and other approaches - Net-based semantical, logical and algebraic calculi - Symbolic net representation (graphical or textual) - Computer tools for nets - Experience with using nets, case studies - Higher-level net models - Timed and stochastic nets - Standardisation of nets - Experience reports describing applications of nets to different kinds of systems and application fields, e.g.: - flexible manufacturing systems - office automation - real-time systems - workflows - embedded systems - supervisory control - defence systems - protocols and networks - biological systems - Internet - health and medical systems - e-commerce and trading - environmental systems - programming languages - hardware - performance evaluation - telecommunications - operations research - railway networks + General topics related to concurrency - Model checking and verification of distributed systems - Verification of infinite-state or parametric systems - Causality/partial order theory of concurrency - Educational issues related to concurrency - New issues and developments in the theory of concurrency - Modelling of hardware and biological systems * PAPER SUBMISSIONS Two kinds of papers can be submitted: - regular papers (max 20 pages) describing original results pertaining to the development of the theory of Petri Nets and distributed and concurrent systems in general, new results extending the applicability of Petri Nets, or case studies, application and experience reports pertinent to the practical use of Petri Nets and concurrency. For papers describing the experiences from applications of Petri Nets, authors are encouraged to consult the document: ApplicationFormat.pdf (available at www.informatik.uni-hamburg.de/TGI/sc-info/docs/ApplicationFormat.pdf) - tool papers (max 10 pages) describing a computer tool based on Petri Nets (not an application of the tool or the theory behind the tool). For more information, please see the document: ToolFormat.pdf (available at www.informatik.uni-hamburg.de/TGI/sc-info/docs/ToolFormat.pdf). The tool should be available for use by other groups (but not necessarily for free). The submission should indicate how the reviewers can get access to the tool (this must be for free). The tool will be demonstrated in the Tool Exhibition, in addition to being presented in a conference talk. Submitted papers must: - be contributions that have neither already been published nor are simultaneously being considered for publication in a peer-reviewed forum; - clearly state the problem being addressed, the goal of the work, the results achieved, and the relation to other work; - be in English and in the Springer LNCS-format: http://www.springer.de/comp/lncs/authors.html; - adhere to the page limit for the relevant category (see above); - be sent electronically (as a PDF file) no later than the above mentioned deadlines using the website http://www.easychair.org/conferences/?conf=petrinets2013. * PROGRAM COMMITTEE CO-CHAIRS Jos? Manuel Colom, Spain Joerg Desel, Germany * WORKSHOP AND TUTORIAL CO-CHAIRS Serge Haddad, France Alex Yakovlev, UK * ORGANISING COMMITTEE CHAIR Lucia Pomello, Italy * PUBLICITY CHAIRS Luca Bernardinello, Italy Lucia Pomello, Italy * PROGRAM COMMITTEE H. Alla, France M. Beccuti, Italy J. Billington, Australia J. Carmona, Spain G. Ciardo, USA J.M. Colom, Spain (co-chair) P. Darondeau, France J. Desel, Germany (co-chair) R. Devillers, Belgium Z. Duan, China J. Esparza, Germany M.P. Fanti, Italy L. Gomes, Portugal S. Haddad, France H. Hansen, Singapore K. Hiraishi, Japan V. Khomenko, UK E. Kindler, Denmark H. Klaudel, France J. Kleijn, The Netherlands R. Lazic, UK C. Lin, China N. Lohmann, Germany I. Lomazova, Russia A. Miner, USA L. Pomello, Italy W. Reisig, Germany C. Seatzu, Italy C. Stahl, The Netherlands S. Taoka, Japan A. Valmari, Finland M. Westergaard, The Netherlands 7TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE 2013) Call for Papers Aston University Conference Centre, Birmingham, UK July 1-3, 2013 http://www.aston.ac.uk/tase2013 * OVERVIEW Software engineering is at the heart of many state of the art tools designed to simplify and improve our lives, including cloud computing applications, the semantic web and self-configuring systems. As these instruments are involved in fields of vital importance, by providing customised solutions for education, businesses, government and health care, the role played by the theory behind their working principles bears an undeniable weight. In this context, the TASE International Symposium strives to provide top scientists with a framework for communicating their latest and most valuable theoretical results in the field of software engineering. * SUBJECT AREAS We invite contributions concerning the theoretical aspects of the following areas (please note that this is not an exhaustive list): - model driven software engineering - component based software engineering - service oriented and cloud computing - semantic web and web services - software security, reliability, simulation and verification - probabilistic fundamentals of software engineering - embedded and real time software systems - program logics and underlying mathematical issues - aspect, rule and object oriented software design - self-configuring software systems - reverse engineering * SUBMISSIONS We invite all prospective authors to submit their manuscripts via the TASE13 portal, hosted on Easychair at: https://www.easychair.org/conferences/?conf=tase2013 * IMPORTANT DATES Title and abstract submission: 18 January 2013 Paper submission: 25 January 2013 Acceptance/rejection notification: 22 March 2013 Camera-ready version submission: 26 April 2013 11TH INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS (TLCA 2013) Call for Papers Eindhoven, 23-28 June 2013 co-located with RTA 2013 as part of RDP 2013 http://www.win.tue.nl/rdp2013/ * SCOPE The 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: - Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity - Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models - Types: subtypes, dependent types, polymorphism, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants - Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, flow analysis of higher-type computation, program equivalence, program transformation and optimization * IMPORTANT DATES - Paper Registration (titles & short abstracts): 25 January 2013 - Full Paper Submission: 1 February 2013 - Author Notification: 22 March 2013 - Camera-Ready Paper for the Proceedings: 12 April 2013 * SUBMISSION GUIDELINES We solicit submissions of research papers, which must: - be in English and not exceed 15 pages (including figures and bibliography). Additional material intended for the reviewers 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. Reviewers will be told that they may choose to ignore the appendix. - present original research which is unpublished and not submitted elsewhere (conferences, journals, books, etc.) - use the Springer-Verlag LNCS style. - be submitted electronically in PDF via the EasyChair TLCA 2013 Submission Webpage (will open nearer the deadline) https://www.easychair.org/conferences/?conf=tlca2013. Submissions deviating from these instructions may be rejected without review. A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. The proceedings will be published as a volume in the ARCoSS subline series of Springer-Verlag Lecture Notes in Computer Science. Final papers will be in the format specified by Springer-Verlag. Any questions regarding the submission guidelines should be directed to the Programme Committee Chair (Masahito Hasegawa ) prior to submitting. * COLOCATED EVENTS TLCA 2013 is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the International Conference on Rewriting Techniques and Applications (RTA 2013) and several related events. Details on workshops affiliated with RDP 2013 will be available at the web site in due course. * CONFERENCE CHAIR Herman Geuvers (Radboud University Nijmegen, Netherlands) * PROGRAMME COMMITTEE CHAIR Masahito Hasegawa (Kyoto University, Japan) * PROGRAMME COMMITTEE Andreas Abel (LMU Munchen, Germany) Patrick Baillot (CNRS and ENS Lyon, France) Nick Benton (Microsoft Cambridge, UK) Lars Birkedal (IT University of Copenhagen, Denmark) Herman Geuvers (Radboud University Nijmegen, Netherlands) Masahito Hasegawa (Kyoto University, Japan) (PC chair) Naoki Kobayashi (University of Tokyo, Japan) Paul-Andre Mellies (CNRS and Universite Paris Diderot, France) Thomas Streicher (TU Darmstadt, Germany) Lorenzo Tortora de Falco (Universita Roma Tre, Italy) Stephanie Weirich (University of Pennsylvania, US) * TLCA PUBLICITY CHAIR Luca Paolini (Universita di Torino, Italy) 7TH INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) Call for Papers Budapest, Hungary June 17-21, 2013 http://www.spacios.eu/TAP2013 * SCOPE The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. * TOPICS Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security * IMPORTANT DATES Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 * PROGRAM CHAIRS Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) * SUBMISSION Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 (submission page to be opened in due time) TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Subject to final approval by Springer, accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ 24TH INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA 2013) Call for Papers June 24 - 26, 2013 Eindhoven, The Netherlands collocated with TLCA 2013 as part of RDP 2013 http://www.win.tue.nl/rdp2013/ * GENERAL The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. * TOPICS OF INTEREST RTA is the major forum for the presentation of research 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; homotopy theory; implicit computational complexity; - Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; - 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; higher-dimensional rewriting; - Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. * PUBLICATION The proceedings of RTA 2013 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. For more information about LIPIcs please consult: * SUBMISSION GUIDELINES Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: , - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: https://www.easychair.org/conferences/?conf=rta2013. The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given 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. * IMPORTANT DATES abstract submission February 1 2013 paper submission February 5 2013 rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 * PROGRAMME COMMITTEE CHAIR Femke van Raamsdonk (VU University Amsterdam, The Netherlands) * PROGRAMME COMMITTEE *** Eduardo Bonelli, National University of Quilmes Byron Cook, Microsoft Research Cambridge Stephanie Delaune, ENS Cachan Gilles Dowek, Inria Paris-Rocquencourt Maribel Fernandez, King's College London Nao Hirokawa, JAIST Ishikawa Delia Kesner, University Paris-Diderot Helene Kirchner, Inria Paris-Rocquencourt Barbara Koenig, University Duisburg Essen Temur Kutsia, Johannes Kepler University Linz Aart Middeldorp, University of Innsbruck Vincent van Oostrom, Utrecht University Femke van Raamsdonk, VU University Amsterdam Kristoffer Rose, IBM Research New York Manfred Schmidt-Schauss, Goethe University Frankfurt Peter Selinger, Dalhousie University Paula Severi, University of Leicester Aaron Stump, The University of Iowa Tarmo Uustalu, Institute of Cybernetics Tallinn Roel de Vrijer, VU University Amsterdam Johannes Waldmann, HTWK Leipzig Hans Zantema, Eindhoven University of Technology * CONFERENCE CHAIR Hans Zantema (Eindhoven University of Technology, The Netherlands) 5TH INTERNATIONAL CONFERENCE ON ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE (CALCO 2013) Call for Papers Warsaw, Poland September 3 - 6, 2013 http://coalg.org/calco13/ * IMPORTANT DATES Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 * SCOPE CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK, 2011). The fifth edition will be held in Warsaw, the capital of Poland. * TOPICS OF INTEREST We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. + Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories + Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) + Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages + System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra * NEW TOPICS This edition of CALCO will feature two new topics, and submission of papers on these topics is especially encouraged. + Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications + Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra * SUBMISSION GUIDELINES Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. As with previous editions, the proceedings will be published in the Springer LNCS series. Final papers should be no more than 15 pages long in the format specified by Springer (see http://www.springer.de/comp/lncs/authors.html). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. * BEST PAPER AND BEST PRESENTATION AWARDS For the first time, this edition of CALCO will feature two kinds of awards: a best paper award whose recipients will be selected by the PC before the conference and a best presentation award, elected by the participants. * IMPORTANT DATES Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 * PROGRAMME COMMITTEE Luca Aceto - Reykjavik University, Iceland Jiri Adamek - TU Braunschweig, D Lars Birkedal - IT University of Copenhagen, DK Filippo Bonchi - CNRS, ENS-Lyon, F Corina Cirstea - University of Southhampton, UK Bob Coecke - University of Oxford, UK Andrea Corradini - University of Pisa, I Mai Gehrke - Universit? Paris Diderot - Paris 7, F H. Peter Gumm - Philipps University Marburg, D Gopal Gupta - University of Texas at Dallas, USA Ichiro Hasuo - Tokyo University, Japan Reiko Heckel - University of Leicester, UK (cochair) Bart Jacobs - Radboud University Nijmegen, NL Ekaterina Komendantskaya - University of Dundee, Scotland, UK Barbara K?nig - University of Duisburg-Essen, D Jos? Meseguer - University of Illinois, Urbana-Champaign, USA Marino Miculan - University of Udine, I Stefan Milius - TU Braunschweig, D (cochair) Larry Moss - Indiana University, Bloomington, USA Till Mossakowski - DFKI Lab Bremen and University of Bremen, D Prakash Panangaden - McGill University, Montreal, Canada Dirk Pattinson - Imperial College London, UK Dusko Pavlovic - Royal Holloway, University of London, UK Daniela Petrisan - University of Leicester, UK John Power - University of Bath, UK Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL Lutz Schr?der - Friedrich-Alexander Universit?t Erlangen-N?rnberg, D Monika Seisenberger - Swansea University, UK Sam Staton - University of Cambridge, UK Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL Pawel Sobocinski - University of Southampton, UK Yde Venema - University of Amsterdam, NL Uwe Wolter - University of Bergen, NO * ORGANISING COMMITTEE Bartek Klin (University of Warsaw, Poland) Andrzej Tarlecki (University of Warsaw, Poland) * LOCATION Warsaw, the capital of Poland, is a lively city with many historic monuments and sights, but also with a thriving business district. It is easily accessible via two airports: the main Chopin Airport, used by most international carriers, and the recently open Warsaw Modlin Airport (30 minutes away by rail), used by budget airlines. * SATELLITE WORKSHOPS CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired by Monika Seisenberger (Swansea University). The workshop is dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. A workshop dedicated to tools based on algebraic and/or coalgebraic principles, CALCO Tools, will be held alongside the main conference, chaired by Lutz Schr?der (Friedrich Alexander Universitaet Erlangen-Nuernberg). Papers of this workshop will be included in the CALCO proceedings. You are subscribed to the lics mailing list because you have signed up for it in the past. Submissions to the newsletter: Send an email to las-lics at lists.tu-berlin.de (moderated) or lics at informatik.hu-berlin.de. Unsubscribe: To unsubscribe, please send an email to las-lics-request at lists.tu-berlin.de with the keyword 'unsubscribe' in the message body (without '). Subscribe: To subscribe, please send an email to las-lics-request at lists.tu-berlin.de with the keyword 'subscribe' in the message body (without '). From martin at eipye.com Wed Nov 7 01:17:21 2012 From: martin at eipye.com (jean-yves beziau) Date: Tue, 06 Nov 2012 22:17:21 -0800 Subject: [FOM] UNILOG'2013 Extended Deadline November 15th, 2012 Message-ID: <5099fcc0.214f420a.7f2a.ffffb030@mx.google.com> UNILOG'2013 http://www.uni-log.org/ The 4th World Congress and School on Universal Logic? will happen in Rio de Janeiro, March 29 - April 7, 2013 A world event dedicated to all aspects of logic 30 invited/keynote speakers: S.Feferman, Y.Gurevich, J.Seldin, D.Mundici, P.Suppes. A.Avron, J.M.Dunn, etc. 1 contest: Scope of logic theorems 15 workshops: Many-Valued Logics, Abstract Proof Theory, Intuitionistic Modal Logic, etc. 1 secret speaker: his/her/its identity will be revealed only at the time of his/her/its talk 25 tutorials: Non-Deterministic Semantics, Hypersequents, Undecidability and Incompleteness Everywhere, etc. Extended Deadline to submit a talk: ? November 15th, 2012 Pre-registration is open >--------------------------------------------------- World Congress and School on Universal Logic Montreux 2005 - Xi'an 2007 - Lisbon 2010 - Rio 2013? http://www.uni-log.org/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ps218 at cam.ac.uk Tue Nov 6 11:07:04 2012 From: ps218 at cam.ac.uk (Peter Smith) Date: 06 Nov 2012 16:07:04 +0000 Subject: [FOM] Teach Yourself Logic: A Guide Message-ID: It is depressing. Serious logic is seemingly taught less and less, at least in UK philosophy departments. Yet logic itself is, of course, no less exciting and rewarding than it ever was, and the amount of important formally-informed work in philosophy is if anything ever greater. It seems then that many beginning graduate students in philosophy will need to teach themselves from books, either solo or by organising study groups. But what to read? I have just counted almost three hundred formal logic books of one kind or another on my own shelves -- and of course these form only a selection of what is out there. Philosophy students need an annotated Guide: so I've made a start at writing one. You can find the first half (12pp.) at www.logicmatters.net/students/tyl/ I hope that some FOMers who are equally concerned about keeping logic education alive and well will take a look, and post any comments or suggestions on the site (or email me). And, of course, spread the word to their students. For into, the sections so far drafted: (1) Back to the beginning. (2) Getting to grips with basic first-order logic. (3) Modal logic. (4) From first-order logic to model theory. (8) Arithmetic, computation and G?delian incompleteness. (9) Beginning set theory. Sections to come: (5) Classical variations: second-order, plural, free logic, etc. (6) Non-classical variations. (7) A little proof theory. (10) Continuing with set theory. (11) A little category theory. (12) Mathematical explorations. -- Dr Peter Smith, University of Cambridge logicmatters.net From frode.bjordal at ifikk.uio.no Mon Nov 5 16:10:43 2012 From: frode.bjordal at ifikk.uio.no (=?ISO-8859-1?Q?Frode_Bj=F8rdal?=) Date: Mon, 5 Nov 2012 22:10:43 +0100 Subject: [FOM] Negation, Contradiction, Contravalence and Complementarity Message-ID: Dear all, I hope many on the list will find interest in the content of the abstract for my talk Negation,Contradiction, Contravalence and Complementarityon Friday for Filosofisk Seminar at the University of Oslo. This short abstract has links to an extended abstract and to the recently published article Librationist Closures of the Paradoxes which supplies the stringent background and more topics of potential interest. One chief purpose of the lecture is to argue that although the librationist system ? for some formulas *A* has *A* as a theorem and also has ?*A* as a theorem, ? is neither inconsistent nor contradictory. We argue that in the paradoxical cases where we have both that *A* is a theorem as well as that ?*A* as a theorem, * A* and ?*A* are complementary sentences which say the same thing in opposite ways. Needless to say, but this is made much more precise. In consequence, ? should not be counted as a paraconsistent system. Best wishes Frode Bj?rdal Professor i filosofi IFIKK, Universitetet i Oslowww.hf.uio.no/ifikk/personer/vit/fbjordal/index.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From irving.anellis at gmail.com Wed Nov 7 17:49:03 2012 From: irving.anellis at gmail.com (Irving Anellis) Date: Wed, 7 Nov 2012 17:49:03 -0500 Subject: [FOM] Logica Universalis special issue -- van Heijenoort at 100 Message-ID: The special issue of Logica Universalis in celebration of the centenary of the birth of Jean van Heijenoort has just appeared in print. It is: Logica Universalis. Volume 6 Number 3-4 Special Issue: Perspectives on the History and Philosophy of Modern Logic: Van Heijenoort Centenary The contents are: Guest Editor?s Introduction: JvH100 Irving H. Anellis Scholarly Publications of Jean van Heijenoort Compiled by lrving H. Anellis Jean van Heijenoort: Kaleidoscope Anita Burdman Feferman Jean van Heijenoort and the G?del Editorial Project John W. Dawson Editor?s Introduction to Jean van Heijenoort, Historical Development of Modern Logic Irving H. Anellis Historical Development of Modern Logic Jean van Heijenoort Jean van Heijenoort?s Conception of Modern Logic, in Historical Perspective Irving H. Anellis Jean van Heijenoort?s Contributions to Proof Theory and Its History Irving H. Anellis Which Mathematical Logic is the Logic of Mathematics? Jaakko Hintikka Frege?s Ancestral and Its Circularities Ignacio Angelelli HERBRAND?s Fundamental Theorem in the Eyes of JEAN VAN HEIJENOORT Claus-Peter Wirth Toward A Visual Proof System: Lewis Carroll?s Method of Trees Francine F. Abeles On Rereading van Heijenoort?s Selected Essays Solomon Feferman -------------------------------------------------------------------------------- In Defense of Logical Universalism: Taking Issue with Jean van Heijenoort Philippe de Rouilhan Logic as Calculus Versus Logic as Language, Language as Calculus Versus Language as Universal Medium, and Syntax Versus Semantics Jan Wolenski Logic as a Science and Logic as a Theory: Remarks on Frege, Russell and the Logocentric Predicament Anssi Korhonen Abstracts and open source articles are available electronically from Springer-Verlag, at: http://www.springerlink.com/content/x64163142145/ Regrettably, the contribution which Georg Kreisel promised could not be delivered, due to his lengthy illness and hospitalization earlier this year. -- Irving H. Anellis Peirce Edition Project Indiana University - Purdue University at Indianapolis From martin at eipye.com Thu Nov 8 18:16:35 2012 From: martin at eipye.com (Olivier Bournez) Date: Thu, 08 Nov 2012 15:16:35 -0800 Subject: [FOM] CiE 2013: The Nature of Computation Message-ID: <509c3d4d.a44f420a.1d7c.ffffcb17@mx.google.com> *********************************************************************** CALL FOR PAPERS: CiE 2013: The Nature of Computation Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications. CiE 2013 conference topics include, but not exclusively: * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: * Gerard Alberts (Amsterdam) * Lu?s Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzs?bet Csuhaj-Varj? (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * J?r?me Durand-Lose (Orl?ans) * Viv Kendon (Leeds) * Bj?rn Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John?s NF) * Benedikt L?we (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pax0 at seznam.cz Mon Nov 12 15:08:02 2012 From: pax0 at seznam.cz (pax0 at seznam.cz) Date: Mon, 12 Nov 2012 21:08:02 +0100 (CET) Subject: [FOM] Avoiding patterns/RCA/WKL Message-ID: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> It is well-known that there is an infinite word not containing a square (avoiding the pattern xx) over the three letter alphabet {0,1,2}. My question is: Do we need WKL over RCA for this result? The intuition is that there is a finitely branching tree of square-free prefixes in which we have to find an infinite branch. But is WKL really used here? Thank you, Jan Pax From alberto.marcone at dimi.uniud.it Tue Nov 13 16:06:44 2012 From: alberto.marcone at dimi.uniud.it (Alberto Marcone) Date: Tue, 13 Nov 2012 22:06:44 +0100 Subject: [FOM] Avoiding patterns/RCA/WKL In-Reply-To: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> References: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> Message-ID: <50A2B664.9040808@dimi.uniud.it> Il 12/11/2012 21:08, pax0 at seznam.cz ha scritto: > It is well-known that there is an infinite word not containing a square (avoiding the pattern xx) > over the three letter alphabet {0,1,2}. > My question is: Do we need WKL over RCA for this result? > The intuition is that there is a finitely branching tree of square-free prefixes in which we have to find an infinite branch. > But is WKL really used here? > Thank you, Jan Pax > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom > I think the answer to Jan's question is negative. http://en.wikipedia.org/wiki/Squarefree_word lists several explicit definitions of square-free words. Some of these (e.g. the one starting from the Thue?Morse sequence) are computable, and I expect (although I did not check the details) that everything is provable in RCA_0. Best wishes, Alberto -- Alberto Marcone alberto.marcone at dimi.uniud.it Dip. di Matematica e Informatica Universita' di Udine tel: +39-0432-558482 via delle Scienze 206 fax: +39-0432-558499 33100 Udine Italy http://users.dimi.uniud.it/~alberto.marcone/ From mcnulty at mailbox.sc.edu Tue Nov 13 17:03:15 2012 From: mcnulty at mailbox.sc.edu (George McNulty) Date: Tue, 13 Nov 2012 17:03:15 -0500 Subject: [FOM] Avoiding patterns/RCA/WKL In-Reply-To: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> References: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> Message-ID: <50A2C3A3.2050808@mailbox.sc.edu> Perhaps the simplest proof of Axel Thue's result here is to produce a endomorphism h on the free semigroup with 3 free generators that preserves square-freeness. Thue provided one in 1912. If h maps the letter a to a word beginning with a, then simply iterating a, h(a), h(h(a)), ... produces initial segments of an infinite squarefree word on 3 letters. The desired morphism h can be explicitly specified by declaring what the images of the three letters are. The key fact that needs to be established is that h preserves squarefreeness if and only if the images under h of squarefree words of length no more than 3 are all squarefree. Once this is done, it is not hard to come up with particular squarefreeness preserving morphisms. So I suppose the question is what does it take to prove the key fact mentioned above. George McNulty On 11/12/2012 03:08 PM, pax0 at seznam.cz wrote: > It is well-known that there is an infinite word not containing a square (avoiding the pattern xx) > over the three letter alphabet {0,1,2}. > My question is: Do we need WKL over RCA for this result? > The intuition is that there is a finitely branching tree of square-free prefixes in which we have to find an infinite branch. > But is WKL really used here? > Thank you, Jan Pax > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom From urquhart at cs.toronto.edu Tue Nov 13 21:46:40 2012 From: urquhart at cs.toronto.edu (Alasdair Urquhart) Date: Tue, 13 Nov 2012 21:46:40 -0500 (EST) Subject: [FOM] Avoiding patterns/RCA/WKL In-Reply-To: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> References: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> Message-ID: I don't think you need WKL to prove the existence of an infinite square-free word. The monograph "Combinatorics on Words" by M. Lothaire proves this result on pp. 23-26. Lothaire first constructs the infinite word of Thue-Morse by a simple recursive procedure. Then an infinite square-free word is constructed on p. 26 via a substitution. WKL doesn't seem to be needed. On Mon, 12 Nov 2012, pax0 at seznam.cz wrote: > It is well-known that there is an infinite word not containing a square (avoiding the pattern xx) > over the three letter alphabet {0,1,2}. > My question is: Do we need WKL over RCA for this result? > The intuition is that there is a finitely branching tree of square-free prefixes in which we have to find an infinite branch. > But is WKL really used here? > Thank you, Jan Pax From andrej.bauer at andrej.com Wed Nov 14 23:44:03 2012 From: andrej.bauer at andrej.com (Andrej Bauer) Date: Wed, 14 Nov 2012 23:44:03 -0500 Subject: [FOM] Avoiding patterns/RCA/WKL In-Reply-To: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> References: <54096.18135.31687-17111-927927663-1352750882@seznam.cz> Message-ID: According to Wikipedia a square free ternary sequence may be obtained as the first difference of the Thue-Morse sequence, see http://en.wikipedia.org/wiki/Squarefree_word. This is quite easily computed, here is code in Haskell: thuemorse :: Int -> Int thuemorse 0 = 0 thuemorse n | even n = thuemorse (n `div` 2) thuemorse n | otherwise = 1 - thuemorse ((n - 1) `div` 2) squarefree :: Int -> Int squarefree n = 1 + thuemorse (n + 1) - thuemorse n Here are the first 50 digits of the squarefree word computed: take 50 (map squarefree [0..]) [2,1,0,2,0,1,2,1,0,1,2,0,2,1,0,2,0,1,2,0,2,1,0,1,2,1,0,2,0,1,2,1,0,1,2,0,2,1,0,1,2,1,0,2,0,1,2,0,2,1] With kind regards, Andrej On Mon, Nov 12, 2012 at 3:08 PM, wrote: > It is well-known that there is an infinite word not containing a square (avoiding the pattern xx) > over the three letter alphabet {0,1,2}. > My question is: Do we need WKL over RCA for this result? > The intuition is that there is a finitely branching tree of square-free prefixes in which we have to find an infinite branch. > But is WKL really used here? > Thank you, Jan Pax > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom From neilpmb at yahoo.com Thu Nov 15 23:53:47 2012 From: neilpmb at yahoo.com (Neil Tennant) Date: Thu, 15 Nov 2012 20:53:47 -0800 (PST) Subject: [FOM] On deriving G2 from G1 Message-ID: <1353041627.59333.YahooMailNeo@web120406.mail.ne1.yahoo.com> fom-ers with an interest in the thread begun by Richard Heck on G1 implying G2 might be interested in the following note: http://people.cohums.ohio-state.edu/tennant9/G1_implies_G2.pdf Neil Tennant From frode.bjordal at ifikk.uio.no Fri Nov 16 19:05:57 2012 From: frode.bjordal at ifikk.uio.no (=?ISO-8859-1?Q?Frode_Bj=F8rdal?=) Date: Sat, 17 Nov 2012 01:05:57 +0100 Subject: [FOM] Minor corrections Message-ID: Dear all, I made some minor but important corrections to the abstract Negation, Contradiction, Contravalence and Complementaritywhich I linked to on the 5th of November. Best regards Frode Bj?rdal Professor i filosofi IFIKK, Universitetet i Oslowww.hf.uio.no/ifikk/personer/vit/fbjordal/index.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From dinasso at dm.unipi.it Sat Nov 17 04:25:07 2012 From: dinasso at dm.unipi.it (dinasso at dm.unipi.it) Date: Sat, 17 Nov 2012 10:25:07 +0100 (CET) Subject: [FOM] Workshop "ULTRA-COMBINATORICS" in Pisa, January 24-25, 2013. Message-ID: <2724.78.13.106.82.1353144307.squirrel@tonelli.dm.unipi.it> ***** Workshop "ULTRA-COMBINATORICS" ***** Application of ultrafilters in combinatorial number theory, and related topics January 24-25, 2013 Centro di Ricerca Matematica "E. De Giorgi", Pisa (Italy) www.crm.sns.it Scientific Committee: Imre Leader (Univ. Cambridge, UK); Dona Strauss (Univ. Leeds, UK) Mauro Di Nasso (Univ. Pisa, Italy). Organization: CRM - Centro di Ricerca Matematica "E. De Giorgi" Chair: Mauro Di Nasso, University of Pisa. Email: ultracombinatorics at dm.unipi.it WEB: http://www.crm.sns.it/event/268 Up-to-date info can also be found at: http://www.dm.unipi.it/~dinasso/ultracombinatorics --- DESCRIPTION --- This workshop aims to bring together European researchers interested in the applications of ultrafilters in combinatorics of numbers, and related topics. The talks will present recent results in this area and provide an updated overview of the subject. The main goal of this meeting is to disseminate information about the various techniques related to the use of ultrafilters (including algebra in the space betaN and nonstandard analysis) and their potential to attack open problems in Ramsey theory and number theory. --- INVITED SPEAKERS --- * Mathias Beiglboeck (Univ. Wien, Austria) * Sabine Koppelberg (Berlin Freie Univ., Germany) * Imre Leader (Univ. Cambridge, UK) * David Ross (Univ. Hawaii, USA & Univ. Oslo, Norway) - to be confirmed - * Dona Strauss (Univ. Leeds, UK) --- REGISTRATION --- People who plan to participate in this workshop must register at the official CRM web page of the workshop: http://www.crm.sns.it/event/268 There are no registration fees to attend this workshop. Please note that the organization of ULTRA-COMBINATORICS is not involved in reservations of Hotels. --- PROGRAM --- The workshop will take place at CRM - Centro di Ricerca Matematica "E. De Giorgi" of Pisa, and will consist of two sessions for invited talks, and two sessions of contributed talks. Registration will start at 9:00 am of Thurday, January 24, 2013. The first session of talks will start at 10:00 am of the same day, and the last session will end by 6:00 pm of the following day, Friday January 25, 2013. A social dinner is scheduled for the evening of Thursday, January 24. --- CONTRIBUTED TALKS --- Contributed talks are invited. To submit a proposal, please register to the workshop and in the registration form you will be asked to insert an abstract. http://crm.sns.it/event/268/registration.html *** The submission deadline is Friday, January 4, 2013 *** As a general rule, decisions on the acceptance of submitted abstracts will be communicated to the authors shortly after their submission. --- ACCOMMODATION FOR YOUNG RESEARCHERS --- Depending on the funds available, accommodation expenses at an agreed Residence in Pisa may be covered to some graduate students and young researchers. To apply for support, follow the instructions as given in the web page: http://www.dm.unipi.it/~dinasso/ultracombinatorics/support.htm -------------------------- Please circulate this announcement to whomever you think interested in ULTRA-COMBINATORICS -------------------------- From martin at eipye.com Sat Nov 17 13:26:06 2012 From: martin at eipye.com (Martin Davis) Date: Sat, 17 Nov 2012 12:26:06 -0600 Subject: [FOM] moderator is in Mexico Message-ID: Back for Thanksgiving. -Martin From neilpmb at yahoo.com Sun Nov 18 14:23:55 2012 From: neilpmb at yahoo.com (Neil Tennant) Date: Sun, 18 Nov 2012 11:23:55 -0800 (PST) Subject: [FOM] typo corrected in G1 impies G2 Message-ID: <1353266635.652.YahooMailNeo@web120402.mail.ne1.yahoo.com> Thanks to Dustin Wehr for spotting an important typo, which has been corrected at http://people.cohums.ohio-state.edu/tennant9/G1_implies_G2.pdf Neil Tennant From zadeh at eecs.berkeley.edu Wed Nov 21 17:57:03 2012 From: zadeh at eecs.berkeley.edu (Lotfi A. Zadeh) Date: Wed, 21 Nov 2012 14:57:03 -0800 Subject: [FOM] Logical Correctness Message-ID: <50AD5C3F.8010102@eecs.berkeley.edu> Dear all, In dealing witha problem in nonmonotonic reasoning, the following question arose. Informally, consider the sentence If it is impossible that p, then it is possible that p, where p is a factual proposition. The sentence is counterintuitive. Could it be logically correct, considering various interpretations of impossible, implication, possibility and p? There are some related basic questions.Could the sentence be logically correct if possibility is allowed to take values in the unit interval? How can one deal with the questionunder discussion when p is a proposition such as Robert is rich, where rich is a multivalued(fuzzy) predicate? If it is possible that Robert is rich, what is the possibility that Robert is not rich? What is the possibility that Robert is poor? A less simple example of p: Most Swedes are tall. Can fuzzy modal logic deal with such questions? With warm regards Sincerely, Lotfi Zadeh -- Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL:http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL:http://zadeh.cs.berkeley.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From tchow at alum.mit.edu Wed Nov 21 20:30:39 2012 From: tchow at alum.mit.edu (Timothy Y. Chow) Date: Wed, 21 Nov 2012 20:30:39 -0500 (EST) Subject: [FOM] Logical Correctness In-Reply-To: References: Message-ID: Lotfi A. Zadeh wrote: > If it is impossible that p, then it is possible that p, > > where p is a factual proposition. The sentence is counterintuitive. > Could it be logically correct, considering various interpretations of > impossible, implication, possibility and p? This is probably too trivial an observation to be interesting, but if we interpret the "If ..., then ..." as a material conditional, then your statement will come out true as long as it is possible that p. Tim From silver_1 at mindspring.com Thu Nov 22 15:25:55 2012 From: silver_1 at mindspring.com (Charlie) Date: Thu, 22 Nov 2012 12:25:55 -0800 Subject: [FOM] Logical Correctness In-Reply-To: <50AD5C3F.8010102@eecs.berkeley.edu> References: <50AD5C3F.8010102@eecs.berkeley.edu> Message-ID: <0281E1D5-B4C4-4E61-83C4-BA7153D713D4@mindspring.com> Take Zadeh's assertion below that "p is a factual proposition". On what seems a standard reading, p could be true or false, depending on facts. Thus, p is (factually) possible. Then, the antecedent of "If it is impossible that p, then it is possible that p" is false, making the material conditional true. I'm aware Zadeh probably interprets these things non-standardly, but I don't know what sorts of interpretations he has in this case. A start would be to explain "factual statements" in some way so they could be impossible. Otherwise, as mentioned, the conditional is trivially true. Basing my guess on his well-known, fuzzy analysis of "tall," I'd assume he may want to apply the same sort of evaluation on "impossible," such that there's no single impossibility, but grades of impossibilities. Maybe something could be fuzzily "impossible," meaning something like: more impossible than possible. ---> But I'm just guessing. I'd be interested in his telling us his ideas about this. Charlie Silver On Nov 21, 2012, at 2:57 PM, Lotfi A. Zadeh wrote: > Dear all, > > In dealing with a problem in nonmonotonic reasoning, the following question arose. Informally, consider the sentence > If it is impossible that p, then it is possible that p, > where p is a factual proposition. The sentence is counterintuitive. Could it be logically correct, considering various interpretations of impossible, implication, possibility and p? There are some related basic questions. Could the sentence be logically correct if possibility is allowed to take values in the unit interval? How can one deal with the question under discussion when p is a proposition such as Robert is rich, where rich is a multivalued (fuzzy) predicate? If it is possible that Robert is rich, what is the possibility that Robert is not rich? What is the possibility that Robert is poor? A less simple example of p: Most Swedes are tall. Can fuzzy modal logic deal with such questions? > > With warm regards > > Sincerely, > > Lotfi Zadeh > > -- > Lotfi A. Zadeh > Professor Emeritus > Director, Berkeley Initiative in Soft Computing (BISC) > > Address: > 729 Soda Hall #1776 > Computer Science Division > Department of Electrical Engineering and Computer Sciences > University of California > Berkeley, CA 94720-1776 > > zadeh at eecs.berkeley.edu > > Tel.(office): (510) 642-4959 > Fax (office): (510) 642-1712 > Tel.(home): (510) 526-2569 > Fax (home): (510) 526-2433 > URL: > http://www.cs.berkeley.edu/~zadeh/ > > > BISC Homepage URLs > URL: > http://zadeh.cs.berkeley.edu/ > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom From drago at unina.it Thu Nov 22 16:19:11 2012 From: drago at unina.it (Antonino Drago) Date: Thu, 22 Nov 2012 22:19:11 +0100 Subject: [FOM] Logical Correctness References: <50AD5C3F.8010102@eecs.berkeley.edu> Message-ID: <30E10C74DEA64F70A10D65A907746B0B@Drago> Wednesday, November 21, 2012 11:57 PM Lotfi A. Zadeh wrote: In dealing with a problem in nonmonotonic reasoning, the following question arose. Informally, consider the sentence if it is impossible that p, then it is possible that p, where p is a factual proposition. The sentence is counterintuitive. Could it be logically correct, considering various interpretations of impossible, implication, possibility and p? My answer is that "impossiblity" is a modal word. Being modal logic equivalent via S4 model to intuitionist logic (also intutively, "impossiblity" is equivalent to "it is not the case it is not", i.e. a doubly negated sentence which is not equivalent to the corresponding affirmative sentence "it is the case"; hence, the former sentence belongs to intuitionist logic and so), the inference at issue is not only counterintuitive, but also wrong, because it applies the double negated law of classical logic to an intuitionist sentence. For an instance, it is wrong to derive from "the impossibility of the perpetual motion" the sentence "the perpetual motion exists". Best wishes for great discoveries in exploring the world of the doubly negated sentences. Antonino Drago -- My answwer is that Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL: http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL: http://zadeh.cs.berkeley.edu/ ------------------------------------------------------------------------------ _______________________________________________ FOM mailing list FOM at cs.nyu.edu http://www.cs.nyu.edu/mailman/listinfo/fom -------------- next part -------------- An HTML attachment was scrubbed... URL: From maarten.jordens at canterbury.ac.nz Thu Nov 22 14:55:23 2012 From: maarten.jordens at canterbury.ac.nz (Maarten McKubre-Jordens) Date: Thu, 22 Nov 2012 19:55:23 +0000 Subject: [FOM] Two PhD scholarships in non-classical mathematics Message-ID: Dear Colleagues, Please find below advertisements for two PhD scholarships in the Foundations area, one in mathematics, and one in philosophy. Please pass them around and encourage anyone who might be interested to apply! Best, Maarten ==== Job 1==== Applications are invited for a fully-funded PhD scholarship on the Marsden-funded project Non-classical Foundations of Analysis The project seeks to formulate and understand new mathematical models of the continuum using non-classical logics. The main thrust of the project will be to use paraconsistent logics to explore properties of sets, sequences, functions and continuity, and to prove interesting theorems that are classically hidden by inconsistency. The successful applicant will carry out doctoral study at the Department of Mathematics and Statistics, University of Canterbury, New Zealand. The topic of the thesis is flexible within the parameters of the project; the appointment is for three years. For details and how to apply, see the project website: http://www.math.canterbury.ac.nz/~m.jordens/NCFA/ Informal queries should be directed to the project co-ordinator, Maarten McKubre-Jordens (e-mail: maarten.jordens at canterbury.ac.nz ). ==== Job 2==== A position for a fully-funded PhD candidate is available on the new Marsden Fund project Models of Paradox in Non-Classical Mereotopology to be conducted for three years starting March 2013, at the Department of Philosophy, University of Otago. The successful candidate might already know what all the words in the project's title mean. The goal of the project is to understand the nature of logical paradoxes. The strategy is to use mathematical models based on non-classical logics (paraconsistent and paracomplete). The topic of the thesis will be up to the candidate, but should involve a serious approach to non-classical mathematics. For more information, including full project description, see http://sites.google.com/site/doctorzachweber/models-of-paradox Inquiries and expressions of interest, including research proposals, should go to Zach Weber zach.weber at otago.ac.nz This email may be confidential and subject to legal privilege, it may not reflect the views of the University of Canterbury, and it is not guaranteed to be virus free. If you are not an intended recipient, please notify the sender immediately and erase all copies of the message and any attachments. Please refer to http://www.canterbury.ac.nz/emaildisclaimer for more information. From jifriedman at ucdavis.edu Thu Nov 22 18:32:57 2012 From: jifriedman at ucdavis.edu (Joel I. Friedman) Date: Thu, 22 Nov 2012 15:32:57 -0800 Subject: [FOM] Logical Correctness In-Reply-To: <50AD5C3F.8010102@eecs.berkeley.edu> References: <50AD5C3F.8010102@eecs.berkeley.edu> Message-ID: <50AEB629.3040100@ucdavis.edu> Dear Lotfi Zadeh, As a non-fuzzy logician myself, I would say that the following equivalence holds: it is impossible that p if and only if it is not possible that p So your conditional statement, "if it is impossible that p, then it is possible that p, is equivalent to the following: if is is not possible that p, then it is possible that p By /Consequentia Mirabiles/, a truth-functionally valid form of inference, we arrive at the following conclusion: it is possible that p This conclusion also implies your conditional statement, so that we have the following equivalence: it is possible that p if and only if (if it is impossible that p, then it is possible that p) So yes, I guess the conditional statement you came up with is "logically correct", for various instances of "p", assuming that "it is possible that p" is also logically correct.. But I don't see any reason to bring in fuzzy logic here. Joel Friedman On 11/21/2012 2:57 PM, Lotfi A. Zadeh wrote: > Dear all, > > In dealing witha problem in nonmonotonic reasoning, the following > question arose. Informally, consider the sentence > > If it is impossible that p, then it is possible that p, > > where p is a factual proposition. The sentence is counterintuitive. > Could it be logically correct, considering various interpretations of > impossible, implication, possibility and p? There are some related > basic questions.Could the sentence be logically correct if possibility > is allowed to take values in the unit interval? How can one deal with > the questionunder discussion when p is a proposition such as Robert is > rich, where rich is a multivalued(fuzzy) predicate? If it is possible > that Robert is rich, what is the possibility that Robert is not rich? > What is the possibility that Robert is poor? A less simple example of > p: Most Swedes are tall. Can fuzzy > > modal logic deal > with such questions? > > With warm regards > > Sincerely, > > Lotfi Zadeh > -- > Lotfi A. Zadeh > Professor Emeritus > Director, Berkeley Initiative in Soft Computing (BISC) > > Address: > 729 Soda Hall #1776 > Computer Science Division > Department of Electrical Engineering and Computer Sciences > University of California > Berkeley, CA 94720-1776 > zadeh at eecs.berkeley.edu > Tel.(office): (510) 642-4959 > Fax (office): (510) 642-1712 > Tel.(home): (510) 526-2569 > Fax (home): (510) 526-2433 > URL:http://www.cs.berkeley.edu/~zadeh/ > > BISC Homepage URLs > URL:http://zadeh.cs.berkeley.edu/ > > > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom From jifriedman at ucdavis.edu Thu Nov 22 18:36:39 2012 From: jifriedman at ucdavis.edu (Joel I. Friedman) Date: Thu, 22 Nov 2012 15:36:39 -0800 Subject: [FOM] Logical Correctness/ Friedman In-Reply-To: <50ADC299.6010201@eecs.berkeley.edu> References: <50ADC299.6010201@eecs.berkeley.edu> Message-ID: <50AEB707.70705@ucdavis.edu> An HTML attachment was scrubbed... URL: From zadeh at eecs.berkeley.edu Thu Nov 22 01:13:45 2012 From: zadeh at eecs.berkeley.edu (Lotfi A. Zadeh) Date: Wed, 21 Nov 2012 22:13:45 -0800 Subject: [FOM] Logical Correctness/ Friedman Message-ID: <50ADC299.6010201@eecs.berkeley.edu> Dear Joel Friedman, Thank you for your constructive comment. A problem with your reasoning is that it applies only when p is a crisp proposition. When p is a fuzzy proposition such as Robert is rich, or Most Swedes are tall, classical material implication does not apply. As a test, consider the conditional statement: If it is impossible that Robert is rich, then it is possible that Robert is rich. In this case, the issue is not logical correctness but the truth-value of the conditional statement, with the understanding that rich, most and tall are labels of fuzzy sets. How would you compute the truth-value of the conditional statement? Sincerely, Lotfi Zadeh -- Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL: http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL: http://zadeh.cs.berkeley.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From jawbrey at att.net Fri Nov 23 00:24:18 2012 From: jawbrey at att.net (Jon Awbrey) Date: Fri, 23 Nov 2012 00:24:18 -0500 Subject: [FOM] Logical Correctness -- Fuzzyness & Triadic Relations In-Reply-To: <50AD5C3F.8010102@eecs.berkeley.edu> References: <50AD5C3F.8010102@eecs.berkeley.edu> Message-ID: <50AF0882.8040606@att.net> Lotfi, Perhaps I might ask you about a more general issue. Way back during my first foundational crisis (1967-1972), I had been willing to consider almost any alternatives to the usual set theories, so I can remember looking at early accounts of fuzzy set theory. There was in addition a link to certain issues that came up in my studies of C.S. Peirce, especially the idea that many of the dyadic relations we use in logic, mathematics, and semantics -- typically functions that assign meanings and values to symbols and expressions -- are better understood if taken in the context of triadic relations that serve to complete and generalize them. My line of thought went a bit like this: Consider a fuzzy set as a triadic relation of the form x \in^r S among an element x, a degree of membership r, and a set S. Ask yourself: Where do these assigned degrees of membership come from? Imagine that they come from averaging the results of many judges making binary {0, 1} = {out, in} decisions. Now consider the more fundamental triadic relation from which this data is derived, the relation of the form x in_j S that exists among an element x, an interpreter (judge, observer, user) j, and a set S. That formulates fuzzy sets in a way that links up with many Peircean themes. Regards, Jon Awbrey http://inquiryintoinquiry.com From pratt at cs.stanford.edu Fri Nov 23 17:23:01 2012 From: pratt at cs.stanford.edu (Vaughan Pratt) Date: Fri, 23 Nov 2012 14:23:01 -0800 Subject: [FOM] Logical Correctness In-Reply-To: <30E10C74DEA64F70A10D65A907746B0B@Drago> References: <50AD5C3F.8010102@eecs.berkeley.edu> <30E10C74DEA64F70A10D65A907746B0B@Drago> Message-ID: <50AFF745.7070907@cs.stanford.edu> While I don't know whether Zadeh would agree with this, I would think that to answer his question without first reading Peter Hajek's excellent article at http://plato.stanford.edu/entries/logic-fuzzy/ one would basically have to re-invent Hajek's wheel. The two references Zadeh offered along with his question, http://www2.iiia.csic.es/%7Efbou/LoMoReVI/Slides/Bou-FuzzyModalLogics.pdf and http://uai.sis.pitt.edu/papers/94/p278-hajek.pdf both assume it as a prerequisite. The former reference should be of particular interest to fans of Belnap and Anderson's relevant logic, Girard's linear logic, and Dunn's gaggle (for "generalized galois logics") theory because of the role played in it by Ward and Dilworth's much earlier (1939) residuated lattices in a nonclassical modal setting. Zadeh's question seems to me somewhere between motivation and advertisement for these papers, which address a considerably wider range of questions about modal fuzzy logic and suitable implications. Birkhoff and von Neumann's quantum logic based on orthocomplemented lattices is another logic with perfectly fine laws for conjunction, disjunction and (involutory) negation for which implication presents problems, e.g. the nice-in-some-respects Sasaki hook lacks a Deduction Theorem. Vaughan Pratt From pmt6sbc at maths.leeds.ac.uk Fri Nov 23 04:45:21 2012 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Fri, 23 Nov 2012 09:45:21 +0000 (GMT) Subject: [FOM] Legacy of Reuben Goodstein, Friday 14th December, 2012 Message-ID: _______________________________________________________________________ THE LEGACY OF REUBEN GOODSTEIN His Centennial and the Wittgenstein Connection Friday 14th December 2012, University of Leicester 2012 is the Centenary of the birth of Reuben Louis Goodstein, the first holder of a UK university chair in Mathematical Logic. In honour of Goodstein and his legacy, we are organizing a day recognizing his impact on the development of Mathematical Logic, worldwide, in the UK and at Leicester. The list of distinguished speakers includes: Harvey Rose (Bristol), Jan von Plato (Helsinki), Stanley Wainer (Leeds), Mathieu Marion/Mitsuhiro Okada (Montreal/Keio, Japan), Mike Price (Leicester), Mary Walmsley (Leicester). Topics will include: * Goodstein's theorem in the light of the Bernays-Goodstein correspondence * Goodstein sequences and independence of Peano arithmetic * Goodstein and Wittgenstein * Goodstein and the Mathematical Association * We are also hoping to have a panel discussion entitled 'Goodstein * 'Remembered', where any delegate can share memories and thoughts of Goodstein. We anticipate there will be a number of ex-colleagues and students of Goodstein, and members of the Goodstein family in attendance, and a small evening dinner for speakers and organisers, and guests. The meeting is supported by the London Mathematical Society, and there are a number of bursaries available to UK research students to enable them to attend the meeting. Registration is free. To register, and for details of the programme, please go to the meeting webpage: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein Download a copy of the conference poster: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein/Goodstein.pdf __________________________ Organisers: S. Barry Cooper (Leeds), Jeremy Levesley (Leicester), Rick Thomas (Leicester), Paul Williams (LSE) From f.a.muller at fwb.eur.nl Sat Nov 24 06:17:07 2012 From: f.a.muller at fwb.eur.nl (F.A. Muller) Date: Sat, 24 Nov 2012 11:17:07 +0000 Subject: [FOM] Terminology In-Reply-To: References: Message-ID: Dear all, The standard English word for sentences (or propositions) that are always true is 'tautology'. Is there a word for sentences that are always false? (No, I don't want to hear 'contradiction', for that is defined as a sentence of the form 'p and not-p', or something logically equivalent to it, and therefore is a syntactical notion.) --> F.A. Muller Utrecht University --------------------------------Disclaimer-------------------------------- De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit bericht. Lees verder: http://www.eur.nl/email-disclaimer The information in this e-mail message is confidential and may be legally privileged. Read more: http://www.eur.nl/english/email-disclaimer -------------------------------------------------------------------------- From zadeh at eecs.berkeley.edu Fri Nov 23 19:06:22 2012 From: zadeh at eecs.berkeley.edu (Lotfi Zadeh) Date: Fri, 23 Nov 2012 16:06:22 -0800 Subject: [FOM] logical correctness/ Friedman Message-ID: <50B00F7E.6080302@eecs.berkeley.edu> Dear Joel: Many thanks for your comment. As you point out, it is a deep-seated tradition in philosophy and logic to deal with vague (fuzzy) predicates as if they were crisp. Incidentally, I believe that "fuzzy" is a better term than "vague" to describewhat we are really dealing with--unsharpnes(fuzziness) of boundaries. In multivalued logic, truth is a matter of degree. In fuzzy logic, everything is, or is allowed to be, a matter of degree, with the understanding that degrees may be fuzzy. This allows the use of terms such as "quite true," "more or less true," "quite possible," "almost impossible," etc. To return to the issue under discussion, your conclusion that the conditional statement If it is impossible that Robert is rich, then it is possible that Robert is rich is equivalent to It is possible that Robert is rich, is certainly correct, if you comply with what classical logic demands. The problem that I see, is that what classical logic demands is equivalent to denying the need for realistic models of vagueness (fuzziness). In the context of modal logic, a test of a model is its capabilityto deal with questions such as: What is the truth value of the statement," It is possible that Robert is rich?" when "rich" is a vague (fuzzy) predicate, with the understanding that truth takes values in the unit interval. Your discussion of the case where "rich" is a crisp predicate, suggests that the question does not have a simple answer. Can fuzzy modal logic deal with the question: If it is possible that Robert is rich, then what is the possibility that Robert is not rich? What is the possibility that Robert is poor, where rich and poor are vague (fuzzy) predicates? Sincerely, Lotfi -- Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL:http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL:http://zadeh.cs.berkeley.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From zadeh at eecs.berkeley.edu Fri Nov 23 21:36:32 2012 From: zadeh at eecs.berkeley.edu (Lotfi Zadeh) Date: Fri, 23 Nov 2012 18:36:32 -0800 Subject: [FOM] logical correctness\ Pratt Message-ID: <50B032B0.4050003@eecs.berkeley.edu> Dear Vaughan: Thank you for the wealth of references. Given the tremendous amount of information in these references, I am curious what would be your answers to some ofthe questions which I posed in my message. Specifically: If it is possible that Robert is rich, what is the possibility that Robert is poor? If it is possible that most Swedes are tall, what is the possibility that few Swedes are short? In many real-world settings, we have a mixture of possibilities and probabilities. Can you address the following question? If it is probable that Robert is rich, what is the possibility of the probability that Robert is poor? These questions appear to be simple, but I believe you will find that coming up with answers is not a simple matter. The questions are intended to test the problem-solving capability of the theories you refer to. I am awaiting with interest your solutions. With my regards. Sincerely, Lotfi -- Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL:http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL:http://zadeh.cs.berkeley.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From jewoods at Princeton.EDU Sat Nov 24 15:08:46 2012 From: jewoods at Princeton.EDU (John E. Woods) Date: Sat, 24 Nov 2012 20:08:46 +0000 Subject: [FOM] Terminology In-Reply-To: References: , Message-ID: <002A91331B155542B47214FB0771EF303AE4C97C@CSGMBX202W.pu.win.princeton.edu> I am fond of "countertautology" which I believe I picked up from Makinson's Topics in Modern Logic. Jack Woods Princeton University ________________________________________ From: fom-bounces at cs.nyu.edu [fom-bounces at cs.nyu.edu] on behalf of F.A. Muller [f.a.muller at fwb.eur.nl] Sent: Saturday, November 24, 2012 6:17 AM To: Subject: [FOM] Terminology Dear all, The standard English word for sentences (or propositions) that are always true is 'tautology'. Is there a word for sentences that are always false? (No, I don't want to hear 'contradiction', for that is defined as a sentence of the form 'p and not-p', or something logically equivalent to it, and therefore is a syntactical notion.) --> F.A. Muller Utrecht University --------------------------------Disclaimer-------------------------------- De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit bericht. Lees verder: http://www.eur.nl/email-disclaimer The information in this e-mail message is confidential and may be legally privileged. Read more: http://www.eur.nl/english/email-disclaimer -------------------------------------------------------------------------- _______________________________________________ FOM mailing list FOM at cs.nyu.edu http://www.cs.nyu.edu/mailman/listinfo/fom -------------- next part -------------- An HTML attachment was scrubbed... URL: From michaeljad at comcast.net Sat Nov 24 15:35:45 2012 From: michaeljad at comcast.net (Michael DeLaurentis) Date: Sat, 24 Nov 2012 15:35:45 -0500 Subject: [FOM] Terminology In-Reply-To: References: Message-ID: <04fd01cdca83$47ddb0d0$d7991270$@net> "Tautology" is also syntactic. "Faultology" and "antilogy" have been used to refer to compound sentences always false [syntactically]. "Analytic" sentences are always true by reason of semantics. Necessarily true sentences comprise both analytic and tautologous sentences. "Oxymorons" or "self-contradictory" are terms commonly used to refer to semantically necessarily false statements. -----Original Message----- From: fom-bounces at cs.nyu.edu [mailto:fom-bounces at cs.nyu.edu] On Behalf Of F.A. Muller Sent: Saturday, November 24, 2012 6:17 AM To: Subject: [FOM] Terminology Dear all, The standard English word for sentences (or propositions) that are always true is 'tautology'. Is there a word for sentences that are always false? (No, I don't want to hear 'contradiction', for that is defined as a sentence of the form 'p and not-p', or something logically equivalent to it, and therefore is a syntactical notion.) --> F.A. Muller Utrecht University --------------------------------Disclaimer-------------------------------- De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit bericht. Lees verder: http://www.eur.nl/email-disclaimer The information in this e-mail message is confidential and may be legally privileged. Read more: http://www.eur.nl/english/email-disclaimer -------------------------------------------------------------------------- _______________________________________________ FOM mailing list FOM at cs.nyu.edu http://www.cs.nyu.edu/mailman/listinfo/fom From rle at AdvancedReasoningForum.org Sat Nov 24 15:48:29 2012 From: rle at AdvancedReasoningForum.org (ARF (Richard L. Epstein)) Date: Sat, 24 Nov 2012 13:48:29 -0700 Subject: [FOM] Terminology References: Message-ID: <50B1329D.3D832453@AdvancedReasoningForum.org> In my writings I have always used *anti-tautology*. Richard L. Epstein "F.A. Muller" wrote: > Dear all, > > The standard English word for sentences (or propositions) > that are always true is 'tautology'. Is there a word for > sentences that are always false? (No, I don't want to hear > 'contradiction', for that is defined as a sentence of the > form 'p and not-p', or something logically equivalent to it, > and therefore is a syntactical notion.) > > --> F.A. Muller > Utrecht University > --------------------------------Disclaimer-------------------------------- > De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is > vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit > bericht. Lees verder: http://www.eur.nl/email-disclaimer > > The information in this e-mail message is confidential and may be legally > privileged. Read more: http://www.eur.nl/english/email-disclaimer > -------------------------------------------------------------------------- > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom From botocudo at gmail.com Sat Nov 24 22:01:44 2012 From: botocudo at gmail.com (Joao Marcos) Date: Sun, 25 Nov 2012 00:01:44 -0300 Subject: [FOM] Terminology Message-ID: > The standard English word for sentences (or propositions) > that are always true is 'tautology'. Is there a word for > sentences that are always false? (No, I don't want to hear > 'contradiction', for that is defined as a sentence of the > form 'p and not-p', or something logically equivalent to it, > and therefore is a syntactical notion.) A common word for the dual of a tautology ---viz. a sentence that is false by virtue of its logical structure--- is "antilogy". (You can find it registered in Merriam-Webster, for instance.) Best, Joao Marcos -- http://sequiturquodlibet.googlepages.com/ From frode.bjordal at ifikk.uio.no Sun Nov 25 08:17:41 2012 From: frode.bjordal at ifikk.uio.no (=?ISO-8859-1?Q?Frode_Bj=F8rdal?=) Date: Sun, 25 Nov 2012 14:17:41 +0100 Subject: [FOM] Terminology In-Reply-To: <04fd01cdca83$47ddb0d0$d7991270$@net> References: <04fd01cdca83$47ddb0d0$d7991270$@net> Message-ID: The alternative "antilogy" makes most sense, etymologiclly and stylistically, it seems; it also belongs to our lore. 2012/11/24 Michael DeLaurentis > "Tautology" is also syntactic. "Faultology" and "antilogy" have been used > to > refer to compound sentences always false [syntactically]. "Analytic" > sentences are always true by reason of semantics. Necessarily true > sentences > comprise both analytic and tautologous sentences. "Oxymorons" or > "self-contradictory" are terms commonly used to refer to semantically > necessarily false statements. > > -----Original Message----- > From: fom-bounces at cs.nyu.edu [mailto:fom-bounces at cs.nyu.edu] On Behalf Of > F.A. Muller > Sent: Saturday, November 24, 2012 6:17 AM > To: > Subject: [FOM] Terminology > > Dear all, > > The standard English word for sentences (or propositions) that are always > true is 'tautology'. Is there a word for sentences that are always false? > (No, I don't want to hear 'contradiction', for that is defined as a > sentence > of the form 'p and not-p', or something logically equivalent to it, and > therefore is a syntactical notion.) > > --> F.A. Muller > Utrecht University > --------------------------------Disclaimer-------------------------------- > De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is > vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit > bericht. Lees verder: http://www.eur.nl/email-disclaimer > > The information in this e-mail message is confidential and may be legally > privileged. Read more: http://www.eur.nl/english/email-disclaimer > -------------------------------------------------------------------------- > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom > > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom > -- Frode Bj?rdal Professor i filosofi IFIKK, Universitetet i Oslowww.hf.uio.no/ifikk/personer/vit/fbjordal/index.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From antonelli at ucdavis.edu Sun Nov 25 13:21:42 2012 From: antonelli at ucdavis.edu (G. Aldo Antonelli) Date: Sun, 25 Nov 2012 10:21:42 -0800 Subject: [FOM] Terminology In-Reply-To: References: Message-ID: <50B261B6.10606@ucdavis.edu> > The standard English word for sentences (or propositions) > that are always true is 'tautology'. Is there a word for > sentences that are always false? I believe Carnap uses the expression "contravalid" for such sentences. -- A. ***************************************** G. Aldo Antonelli Professor of Philosophy University of California, Davis http://www.aldo-antonelli.org antonelli at ucdavis.edu +1 530 554 1368 From m.mostowski at uw.edu.pl Sun Nov 25 12:48:47 2012 From: m.mostowski at uw.edu.pl (Marcin Mostowski) Date: Sun, 25 Nov 2012 18:48:47 +0100 (CET) Subject: [FOM] Terminology In-Reply-To: <002A91331B155542B47214FB0771EF303AE4C97C@CSGMBX202W.pu.win.princeton.edu> Message-ID: <1404321056.58734.1353865727320.JavaMail.root@zp1.poczta.uw.edu.pl> In polish logical terminology there is a common term "kontrtautologia" used for sentences false under all interpretations. see polish wikipedia: http://pl.wikipedia.org/wiki/Kontrtautologia It is used also in english version "contrtautology". I suppose that Makinson's "countertautology" is another english version of the same term. After short checking I observed that practically there is no term for this notion used in English by non-polish authors. It was surprising for me because the notion seems to be important and useful. Marcin Mostowski Warsaw University _________________________________________________________________________________________________________ I am fond of "countertautology" which I believe I picked up from Makinson's Topics in Modern Logic . Jack Woods Princeton University _________________________________________________________________________________________________________ Dear all, The standard English word for sentences (or propositions) that are always true is 'tautology'. Is there a word for sentences that are always false? (No, I don't want to hear 'contradiction', for that is defined as a sentence of the form 'p and not-p', or something logically equivalent to it, and therefore is a syntactical notion.) --> F.A. Muller Utrecht University From martin at eipye.com Mon Nov 26 00:24:06 2012 From: martin at eipye.com (Elena Pribavkina) Date: Sun, 25 Nov 2012 21:24:06 -0800 Subject: [FOM] Information about CSR 2013 to FOM list Message-ID: <50b2fce7.4883440a.47cf.665a@mx.google.com> 8th International Computer Science Symposium in Russia (CSR 2013): 2nd Call for Papers 8th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2013) June 25-29, 2013, Ekaterinburg, Russia http://csr2013.urfu.ru/ ******************************************************************************* CSR 2013 intends to reflect the broad scope of international cooperation in computer science. It is the eighth conference in a series of regular events previously held in St.Petersburg (2006), Ekaterinburg (2007), Moscow (2008), Novosibirsk (2009), Kazan (2010), St.Petersburg (2011), and Nizhny Novgorod (2012). The proceedings are published in Springer LNCS. IMPORTANT DATES Deadline for submissions: December 11, 2012 Notification of acceptance: February 13, 2013 Conference dates: June 25-29, 2013 As it has become a tradition, there will be YANDEX AWARDs for the best paper and for the best student paper! VENUE Ekaterinburg is a large city in the heart of Russia, 1600 km (a 2 hour flight) east from Moscow. It is the capital city as well as the main financial, cultural, and scientific centre of the Ural region. Ekaterinburg is accessible by direct regular flights of a number of international airlines including Lufthansa, Aeroflot, Finnair, Czech Airlines, Turkish Airlines, and FlyDubai. Ural Federal University is the largest Russian university outside Moscow. TOPICS include, but are not limited to: * algorithms and data structures * automata and formal languages * combinatorial optimization * constraint solving * computational complexity * cryptography * combinatorics in computer science * computational models and concepts * algorithms for concurrent and distributed systems, networks * proof theory and applications of logic to computer science * model checking * automated reasoning * deductive methods INVITED SPEAKERS * Mario Szegedy (Rutgers) will give an opening lecture * Thomas Colcombet (CNRS) * Gilles Dowek (INRIA) * Alexandr Kostochka (University of Illinois at Urbana-Champaign / Novosibirsk State University) * Nicole Schweikardt (Goethe University) * Jeffrey Shallit (University of Waterloo) * Paul Spirakis (University of Patras) * Ryan Williams (Stanford University) PROGRAM COMMITTEE * Max Alekseyev (University of South Carolina) * Andris Ambainis (University of Latvia) * Maxim Babenko (Higher School of Economics, Moscow) * Patrick Baillot (ENS Lyon) * Glencora Borradaile (Oregon State University) * Andrei Bulatov (Simon Fraser University) Chair * Yijia Chen (Shanghai Jiao Tong University) * Victor Dalmau (University Pompeu Fabra) * Yevgeniy Dodis (Courant Institute of Mathematical Sciences) * Manfred Droste (University Leipzig) * Anna Frid (Sobolev Institute of Mathematics) * Hamed Hatami (McGill University) * Tero Harju (University of Turku) * Michal Koucky (Mathematical Institute of Czech Academy of Sciences) * Stephan Kreutzer (Tecnical University of Berlin) * Alexander Kulikov (Steklov Institute of Mathematics at St. Petersburg) * Konstantin Makarychev (Microsoft Research at Redmond) * Simone Martini (University of Bologna) * Jaroslav Nesetril (Charles University) * Jean-Eric Pin (University Paris 7) * Harald Raecke (University of Munich) * Alexander Razborov (University of Chicago and Steklov Mathematical Institute) * Mikhail Volkov (Ural Federal University) ORGANIZERS B.N.Yeltsin Ural Federal University, Ekaterinburg, Russia CONFERENCE CHAIR Arseny Shur (Ural Federal University) SUBMISSIONS Authors are invited to submit an extended abstract or a full paper of at most 12 pages in the LNCS format (LaTeX, as pdf; final version with source), in English; instructions can be found at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. Proofs and other material omitted due to space constraints are to be put into a clearly marked appendix to be read at discretion of the referees. Papers must present original (and not previously published) research. Simultaneous submission to journals or to other conferences with published proceedings is not allowed. The proceedings of the symposium will be published in Springer's LNCS series. Accepted papers MUST be presented at the symposium. Submissions should be uploaded to the EasyChair Conference system: http://www.easychair.org/conferences/?conf=csr2013 SATELLITE EVENTS The 2nd Workshop on Current Trends in Cryptography (June 23-24, 2013) https://www.tc26.ru/en/CTCryptEN/CTCrypt2013 The 6th School for students and young researchers "Computer Science Ekaterinburg Days" (June 29 - July 1, 2013). Workshop proposals are welcome. FURTHER INFORMATION AND CONTACTS Web: http://csr2013.urfu.ru/ Email: csr2013 at urfu.ru From gkapou at yahoo.gr Mon Nov 26 12:58:48 2012 From: gkapou at yahoo.gr (George Kapoulas) Date: Mon, 26 Nov 2012 17:58:48 +0000 (GMT) Subject: [FOM] Terminology Message-ID: <1353952728.32966.YahooMailNeo@web171206.mail.ir2.yahoo.com> > The standard English word for sentences (or propositions) > that are always true is 'tautology'.? Is there a word for > sentences that are always false? antilogia - antilogy is one Greek? term one more is antifasi (contradiction in English ) -------------- next part -------------- An HTML attachment was scrubbed... URL: From martin at eipye.com Mon Nov 26 13:51:48 2012 From: martin at eipye.com (Geoff Sutcliffe by way of Martin Davis ) Date: Mon, 26 Nov 2012 10:51:48 -0800 Subject: [FOM] CADE-24 Workshops, Tutorials, Competitions Message-ID: <50b3ba43.e9c5440a.714a.ffffd8fd@mx.google.com> CALL FOR WORKSHOPS, TUTORIALS AND SYSTEM COMPETITIONS CADE-24 The 24th International Conference on Automated Deduction Lake Placid, USA, 9-14 June 2013 http://www.cade-24.info Submission deadline: 2 December 2012 CADE is the major international forum at which research on all aspects of automated deduction is presented. CALL FOR WORKSHOPS Workshop proposals for CADE-24 are solicited. Both well-established workshops and newer ones are encouraged. Similarly, proposals for workshops with a tight focus on a core automated reasoning specialization, as well as those with a broader or more applied focus, are very welcome. Please provide the following information in your application document: + Workshop title. + Names and affiliations of organizers. + Proposed workshop duration (from half a day to two days). + Brief description of the goals and the scope of the workshop. Why is the workshop relevant for CADE? + Is the workshop new or has it met previously? In the latter case information on previous meetings should be given. + Are there plans for publication? CALL FOR TUTORIALS Tutorial proposals for CADE-24 are solicited. Tutorials are expected to be half-day events, with a theoretical or applied focus, on a Topic Of Interest for CADE-24. Proposals should provide the following information: + Tutorial title. + Names and affiliations of organizers. + Brief description of the tutorial's goals and topics to be covered. + Whether or not a version of the tutorial has been given previously. CADE will take care of printing and distributing notes for tutorials that would like this service. CALL FOR SYSTEM COMPETITIONS The CADE ATP Systems Competition CASC, which evaluates automated theorem proving systems for classical logics, has become an integral part of the CADE conferences. Further system competition proposals are solicited. The goal is to foster the development of automated reasoning systems in all areas relevant for automated deduction in a broad sense. + Competition title. + Names and affiliations of organizers. + Duration and schedule of the competition. + Room/space requirements. + Brief description of the competition task and the evaluation procedure. + Is the competition new or has it been organized before? In the latter case information on previous competitions should be given. + What computing resources are required and how will they be provided? IMPORTANT DATES FOR WORKSHOP AND COMPETITION PROPOSALS Deadline for proposal submissions 2 December 2012 Acceptance/rejection notification: 10 December 2012 Workshops and Tutorials: 9-10 June 2013 Competitions: 9-14 June 2013 Conference: 11-14 June 2013 SUBMISSION INSTRUCTIONS Proposals should be uploaded via https://www.easychair.org/conferences/?conf=cade24workshopscompe CADE-24 ORGANIZERS Conference Co-Chairs: Christopher A. Lynch Clarkson University Neil V. Murray SUNY Albany Program Committee Chair: Maria Paola Bonacina Universita` degli Studi di Verona Tutorial Chair: Peter Baumgartner NICTA and Australian National University Workshop and Competition Chair: Christoph Benzmueller Freie Universitaet Berlin Publicity and Web Chair: Grant Olney Passmore Cambridge University and University of Edinburgh From irving.anellis at gmail.com Mon Nov 26 18:23:37 2012 From: irving.anellis at gmail.com (Irving Anellis) Date: Mon, 26 Nov 2012 18:23:37 -0500 Subject: [FOM] Terminology Message-ID: I generally don't use the term "tautology" at all. Instead, I prefer "t-definite", and thus simultaneously also making possible the use of "f-definite", "t-indefinite" and "f-indefinite". -- Irving H. Anellis 8905 Evergreen Avenue, Apt. 171 Indianapolis, IN 46240-2073 From pmt6sbc at maths.leeds.ac.uk Mon Nov 26 18:24:08 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 26 Nov 2012 23:24:08 GMT Subject: [FOM] 10th Annual Conference on Theory and Applications of Models of Computation (TAMC13) Message-ID: <201211262324.qAQNO82K006964@maths.leeds.ac.uk> FIRST CALL FOR PAPERS: TAMC 2013 The 10th annual conference on Theory and Applications of Models of Computation University of Hong Kong, Pokfulam, Hong Kong Important Dates Submission deadline : 11:59 pm EST January 11, 2013 Notification of authors : late February or early March, 2013 Final versions deadline : to be announced soon The TAMC proceedings will be published in the Lecture Notes in Computer Science Series by Springer (http://www.springer.com/lncs). Authors of accepted papers are expected to present their work at the conference. Post Conference Publications Special issues of the journals Theoretical Computer Science and Mathematical Structures in Computer Science devoted to a selected set of accepted papers of the conference are planned. Aims and Scope TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference are computability, complexity, and algorithms. Typical but not exclusive topics of interest include: * algebraic computation * algorithmic coding theory * algorithmic number theory * approximation algorithms * automata theory * circuit complexity * computability * computational biology, and biological computing * computational complexity * computational game theory * computational logic * computational geometry * continuous and real computation * cryptography * data structures * design and analysis of algorithms * distributed algorithms * fixed parameter tractability * graph algorithms * information and communication complexity * learning theory * natural computation * network algorithms, networks in nature and society * online algorithms * optimization * parallel algorithms * privacy and security * property testing * proof complexity * quantum computing * randomness, pseudo-randomness * randomized algorithms * streaming algorithms http://www.cs.hku.hk/tamc2013/call.htm From hmflogic at gmail.com Tue Nov 27 15:29:52 2012 From: hmflogic at gmail.com (Harvey Friedman) Date: Tue, 27 Nov 2012 15:29:52 -0500 Subject: [FOM] 508: Unique Undefinable Elements Message-ID: THIS RESEARCH WAS PARTIALLY SUPPORTED BY THE JOHN TEMPLETON FOUNDATION ***************************************** THIS POSTING IS ENTIRELY SELF CONTAINED ***************************************** UNIQUE UNDEFINABLE ELEMENTS We present a structure (in a finite relational type) with a unique undefinable element. Furthermore, the unique undefinable element is undefinable even if we use the quantifier "there exist infinitely many" and quantitative variants. We show that the structures can be taken to be a graph. We also prove that "there is a structure (in a finite relational type) with a unique second order undefinable element" is not provable in ZFC (assuming ZFC is consistent). 1. Introduction. 2. Cohen generic sets and forcing. 3. Cohen generic constructions. 4. Unique undefinable elements. 5. Interpretations into graphs. 6. Unique second order undefinable elements. 7. Dimension preservation. The manuscript is at http://www.math.osu.edu/~friedman.8/manuscripts.html #74, and has been submitted for publication. The unique undefinable element is called the God element. The work was motivated by theology, as discussed in the Introduction. ***************************************** I use http://www.math.ohio-state.edu/~friedman/ for downloadable manuscripts. This is the 508th in a series of self contained numbered postings to FOM covering a wide range of topics in f.o.m. The list of previous numbered postings #1-449 can be found in the FOM archives at http://www.cs.nyu.edu/pipermail/fom/2010-December/015186.html 450: Maximal Sets and Large Cardinals II 12/6/10 12:48PM 451: Rational Graphs and Large Cardinals I 12/18/10 10:56PM 452: Rational Graphs and Large Cardinals II 1/9/11 1:36AM 453: Rational Graphs and Large Cardinals III 1/20/11 2:33AM 454: Three Milestones in Incompleteness 2/7/11 12:05AM 455: The Quantifier "most" 2/22/11 4:47PM 456: The Quantifiers "majority/minority" 2/23/11 9:51AM 457: Maximal Cliques and Large Cardinals 5/3/11 3:40AM 458: Sequential Constructions for Large Cardinals 5/5/11 10:37AM 459: Greedy CLique Constructions in the Integers 5/8/11 1:18PM 460: Greedy Clique Constructions Simplified 5/8/11 7:39PM 461: Reflections on Vienna Meeting 5/12/11 10:41AM 462: Improvements/Pi01 Independence 5/14/11 11:53AM 463: Pi01 independence/comprehensive 5/21/11 11:31PM 464: Order Invariant Split Theorem 5/30/11 11:43AM 465: Patterns in Order Invariant Graphs 6/4/11 5:51PM 466: RETURN TO 463/Dominators 6/13/11 12:15AM 467: Comment on Minimal Dominators 6/14/11 11:58AM 468: Maximal Cliques/Incompleteness 7/26/11 4:11PM 469: Invariant Maximality/Incompleteness 11/13/11 11:47AM 470: Invariant Maximal Square Theorem 11/17/11 6:58PM 471: Shift Invariant Maximal Squares/Incompleteness 11/23/11 11:37PM 472. Shift Invariant Maximal Squares/Incompleteness 11/29/11 9:15PM 473: Invariant Maximal Powers/Incompleteness 1 12/7/11 5:13AMs 474: Invariant Maximal Squares 01/12/12 9:46AM 475: Invariant Functions and Incompleteness 1/16/12 5:57PM 476: Maximality, CHoice, and Incompleteness 1/23/12 11:52AM 477: TYPO 1/23/12 4:36PM 478: Maximality, Choice, and Incompleteness 2/2/12 5:45AM 479: Explicitly Pi01 Incompleteness 2/12/12 9:16AM 480: Order Equivalence and Incompleteness 481: Complementation and Incompleteness 2/15/12 8:40AM 482: Maximality, Choice, and Incompleteness 2 2/19/12 7:43AM 483: Invariance in Q[0,n]^k 2/19/12 7:34AM 484: Finite Choice and Incompleteness 2/20/12 6:37AM__ 485: Large Large Cardinals 2/26/12 5:55AM 486: Naturalness Issues 3/14/12 2:07PM 487: Invariant Maximality/Naturalness 3/21/12 1:43AM 488: Invariant Maximality Program 3/24/12 12:28AM 489: Invariant Maximality Programs 3/24/12 2:31PM 490: Invariant Maximality Program 2 3/24/12 3:19PM 491: Formal Simplicity 3/25/12 11:50PM 492: Invariant Maximality/conjectures 3/31/12 7:31PM 493: Invariant Maximality/conjectures 2 3/31/12 7:32PM 494: Inv Max Templates/Z+up, upper Z+ equiv 4/5/12 4:17PM 495: Invariant Finite Choice 4/5/12 4:18PM 496: Invariant Finite Choice/restatement 4/8/12 2:18AM 497: Invariant Maximality Restated 5/2/12 2:49AM 498: Embedded Maximal Cliques 1 9/18/12 12:43AM 499. Embedded Maximal Cliques 2 9/19/12 2:50AM 500: Embedded Maximal Cliques 3 9/20/12 10:15PM 501: Embedded Maximal Cliques 4 9/23/12 2:16AM 502: Embedded Maximal Cliques 5 9/26/12 1:21AM 503: Proper Classes of Graphs 10/13/12 12:17PM 504. Embedded Maximal Cliques 6 10/14/12 12:49PM 505: Function Transfer Theory 10/21/12 2:15AM 506: Finite Embedded Weakly Maximal Cliques 10/23/12 12:53AM 507: Finite Embedded Dominators 11/6/12 6:40AM Harvey Friedman From zadeh at eecs.berkeley.edu Mon Nov 26 19:08:28 2012 From: zadeh at eecs.berkeley.edu (Lotfi A. Zadeh) Date: Mon, 26 Nov 2012 16:08:28 -0800 Subject: [FOM] Logical Correctness/ Chow Message-ID: <50B4047C.1060508@eecs.berkeley.edu> Dear Tim: Thank you for your comment. Your comment is valid if p is a crisp proposition. In this case, as you point out, my question has a trivial answer. My question--and related questions--are non-trivial when p is a fuzzy proposition. In this case, my questions fall within the province of fuzzy modal logic, fuzzy logic and possibility theory. A point at issue is whether fuzzy modal logic is capable of coming up with answers to my questions. Vaughn thinks so, but I have doubts. There is a reason. If pis a fuzzy proposition, assessment of its truthvalue in a possible world is a non-trivial problem. Does fuzzy modal logic address this problem? Example. p: Robert is much richer than most of his friends. Representation of meaning ofpropositions of this level of complexity falls within the province of fuzzy logic. When p is a fuzzy proposition, possibility ceases to be a bivalent concept. Can fuzzy Kripke semantics deal with sentences like: It is quite possible that Robert is rich. As you can see, we enter unchartered territory. It is a sobering thought that dealing with simple sentences drawnfrom everyday discourse may well be beyond the reach of fuzzy modal logic. Sincerely, Lotfi -- Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL: http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL: http://zadeh.cs.berkeley.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.B.Levy at cs.bham.ac.uk Tue Nov 27 18:31:47 2012 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Tue, 27 Nov 2012 23:31:47 +0000 Subject: [FOM] PhD opportunities in the Computer Science theory group at Birmingham Message-ID: Dear all, We invite applications for PhD study at the University of Birmingham. We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in computation and programming language semantics. This often involves profound and surprising connections between different areas of computer science and mathematics. From category theory to ?-calculus and computational effects, from topology to constructive mathematics, from game semantics to program compilation, this is a diverse field of research that continues to provide new insight and underlying structure. See our webpage, with links to individual researchers, here: http://www.cs.bham.ac.uk/research/groupings/theory/ Information about PhD applications may be found here: http://www.cs.bham.ac.uk/admissions/postgraduate-research/ If you are considering applying, please contact any of us. We will be very happy to discuss the opportunities available. Best regards, the Birmingham CS theory group Mart?n Escard? (Topology, computation with infinite objects, constructive mathematics, intuitionistic type theory) Dan Ghica (Game semantics, heterogeneous computing, model checking) Achim Jung (Mathematical structures in the foundations of computing: logic, topology, order) Paul Levy (Denotational semantics, ?-calculus with effects, nondeterminism, category theory, game semantics) Uday Reddy (Semantics of state, separation logic) Eike Ritter (Security protocol verification) Hayo Thielecke (Abstract machines, concurrent and functional programming, software security) Steve Vickers (Constructive mathematics and topology, category theory and toposes) -- Paul Blain Levy School of Computer Science, University of Birmingham +44 121 414 4792 http://www.cs.bham.ac.uk/~pbl From hmflogic at gmail.com Tue Nov 27 22:03:35 2012 From: hmflogic at gmail.com (Harvey Friedman) Date: Tue, 27 Nov 2012 22:03:35 -0500 Subject: [FOM] 509: More Undefinable Elements Message-ID: THIS RESEARCH WAS PARTIALLY SUPPORTED BY THE JOHN TEMPLETON FOUNDATION ***************************************** THIS POSTING IS A CONTINUATION OF http://www.cs.nyu.edu/pipermail/fom/2012-November/016806.html ***************************************** The paper at http://www.math.osu.edu/~friedman.8/manuscripts.html #74, proves "there is a structure in a finite relational type with a unique undefinable element." Consider this: There is a structure in a finite relational type with exactly n undefinable elements. If n > 1 then the above is trivial. Take n distinct elements with no constant, relation, or function symbols. Of course, = is always allowed. However, consider these sharper forms. There is a structure in a finite relational type with exactly n undefinable elements, each of which is definable from any of the others. There is a structure in a finite relational type with exactly n undefinable elements, none of which is definable from the remaining n-1. The first of these is very easy to prove, for any n >= 1. Take 0,1,...,n-1, with the function f(x) = x+1 mod n. The second of these can be proved, for any n >= 1, by adapting the proof in http://www.math.osu.edu/~friedman.8/manuscripts.html #74, As in the paper, one can take the structure to be a graph, and one can use "there are infinitely many" and other quantitative quantifiers. ***************************************** I use http://www.math.ohio-state.edu/~friedman/ for downloadable manuscripts. This is the 509th in a series of self contained numbered postings to FOM covering a wide range of topics in f.o.m. The list of previous numbered postings #1-449 can be found in the FOM archives at http://www.cs.nyu.edu/pipermail/fom/2010-December/015186.html 450: Maximal Sets and Large Cardinals II 12/6/10 12:48PM 451: Rational Graphs and Large Cardinals I 12/18/10 10:56PM 452: Rational Graphs and Large Cardinals II 1/9/11 1:36AM 453: Rational Graphs and Large Cardinals III 1/20/11 2:33AM 454: Three Milestones in Incompleteness 2/7/11 12:05AM 455: The Quantifier "most" 2/22/11 4:47PM 456: The Quantifiers "majority/minority" 2/23/11 9:51AM 457: Maximal Cliques and Large Cardinals 5/3/11 3:40AM 458: Sequential Constructions for Large Cardinals 5/5/11 10:37AM 459: Greedy CLique Constructions in the Integers 5/8/11 1:18PM 460: Greedy Clique Constructions Simplified 5/8/11 7:39PM 461: Reflections on Vienna Meeting 5/12/11 10:41AM 462: Improvements/Pi01 Independence 5/14/11 11:53AM 463: Pi01 independence/comprehensive 5/21/11 11:31PM 464: Order Invariant Split Theorem 5/30/11 11:43AM 465: Patterns in Order Invariant Graphs 6/4/11 5:51PM 466: RETURN TO 463/Dominators 6/13/11 12:15AM 467: Comment on Minimal Dominators 6/14/11 11:58AM 468: Maximal Cliques/Incompleteness 7/26/11 4:11PM 469: Invariant Maximality/Incompleteness 11/13/11 11:47AM 470: Invariant Maximal Square Theorem 11/17/11 6:58PM 471: Shift Invariant Maximal Squares/Incompleteness 11/23/11 11:37PM 472. Shift Invariant Maximal Squares/Incompleteness 11/29/11 9:15PM 473: Invariant Maximal Powers/Incompleteness 1 12/7/11 5:13AMs 474: Invariant Maximal Squares 01/12/12 9:46AM 475: Invariant Functions and Incompleteness 1/16/12 5:57PM 476: Maximality, CHoice, and Incompleteness 1/23/12 11:52AM 477: TYPO 1/23/12 4:36PM 478: Maximality, Choice, and Incompleteness 2/2/12 5:45AM 479: Explicitly Pi01 Incompleteness 2/12/12 9:16AM 480: Order Equivalence and Incompleteness 481: Complementation and Incompleteness 2/15/12 8:40AM 482: Maximality, Choice, and Incompleteness 2 2/19/12 7:43AM 483: Invariance in Q[0,n]^k 2/19/12 7:34AM 484: Finite Choice and Incompleteness 2/20/12 6:37AM__ 485: Large Large Cardinals 2/26/12 5:55AM 486: Naturalness Issues 3/14/12 2:07PM 487: Invariant Maximality/Naturalness 3/21/12 1:43AM 488: Invariant Maximality Program 3/24/12 12:28AM 489: Invariant Maximality Programs 3/24/12 2:31PM 490: Invariant Maximality Program 2 3/24/12 3:19PM 491: Formal Simplicity 3/25/12 11:50PM 492: Invariant Maximality/conjectures 3/31/12 7:31PM 493: Invariant Maximality/conjectures 2 3/31/12 7:32PM 494: Inv Max Templates/Z+up, upper Z+ equiv 4/5/12 4:17PM 495: Invariant Finite Choice 4/5/12 4:18PM 496: Invariant Finite Choice/restatement 4/8/12 2:18AM 497: Invariant Maximality Restated 5/2/12 2:49AM 498: Embedded Maximal Cliques 1 9/18/12 12:43AM 499. Embedded Maximal Cliques 2 9/19/12 2:50AM 500: Embedded Maximal Cliques 3 9/20/12 10:15PM 501: Embedded Maximal Cliques 4 9/23/12 2:16AM 502: Embedded Maximal Cliques 5 9/26/12 1:21AM 503: Proper Classes of Graphs 10/13/12 12:17PM 504. Embedded Maximal Cliques 6 10/14/12 12:49PM 505: Function Transfer Theory 10/21/12 2:15AM 506: Finite Embedded Weakly Maximal Cliques 10/23/12 12:53AM 507: Finite Embedded Dominators 11/6/12 6:40AM 508: Unique Undefinable Elements 11/27/12 3:30PM Harvey Friedman From mlika_hamdi at yahoo.fr Wed Nov 28 06:12:17 2012 From: mlika_hamdi at yahoo.fr (mlika hamdi) Date: Wed, 28 Nov 2012 11:12:17 +0000 (GMT) Subject: [FOM] Call for papers ! Message-ID: <1354101137.12709.YahooMailNeo@web171202.mail.ir2.yahoo.com> Two International conferences and two special ?Issues of AL-MUKHATABAT Journal calls for papers ? 1 ? AL-MUKHATABATjournal is launching a call for papers in order to organize two days international conference in order to prepare two special issues on : 1.??? What are the epistemological lessons that we should take from the History of Arabic Sciences ?? 2.??? Arabic Logic in medieval philosophy. Selected proposals will be presented during two international conferences organized by the AL-MUKHATABATJournal and the Groupe d?Etudes et de Recherches Pour la logique, l??pist?mologie et la philosophie analytique(Kairouan University)? during 2013, before going to refereeing and publishing in the journal?s two special issues. Papers ? in French or in English or in Arabic ? will be selected by the editorial board to be presented during two conferences organized at Kairouan University in Tunisia during? 2013. Abtracts as well as the author?s short CV must be sent before December 15, 2012. Decisions will be communicated by January, 15, 2013. Following the conferences, the journal will select the contributions to be published in two special issues. Proposals are to be sent to : Hamdi MLIKA:? hamdi.mlika at yahoo.com ? Thank you ! Hamdi Mlika The Editor of AL-MUKHATABAT Journal http://almukhatabatjournal.unblog.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From urquhart at cs.toronto.edu Wed Nov 28 10:30:41 2012 From: urquhart at cs.toronto.edu (Alasdair Urquhart) Date: Wed, 28 Nov 2012 10:30:41 -0500 (EST) Subject: [FOM] Terminology In-Reply-To: References: Message-ID: In Section 15 of his Introduction to Mathematical Logic, Alonzo Church uses the word "contradiction" for a propositional formula that is false under all assignments to its variables. This terminology seems perfectly satisfactory to me. From sambin at math.unipd.it Wed Nov 28 09:33:15 2012 From: sambin at math.unipd.it (Giovanni Sambin) Date: Wed, 28 Nov 2012 15:33:15 +0100 Subject: [FOM] Foundation of Mathematics for Computer-Aided Formalization Message-ID: <50B620AB.9080308@math.unipd.it> Call for participation We are pleased to announce the workshop ``Foundation of Mathematics for Computer-Aided Formalization'' to be held in Padova (Italy), 9-11 January 2013. For more information (motivations, registration, contributed talks) please refer to the webpage: http://events.math.unipd.it/fomcaf13/ Invited speakers include: Thorsten Altenkirch (University of Nottingham, UK) Andrea Asperti (University of Bologna, Italy) Ulrich Berger (Swansea University, UK) Gilles Dowek (INRIA, Paris, France) Peter Dybjer (Chalmers University of Technology, G?teborg, Sweden) William M. Farmer (McMaster University, Hamilton, Canada) Herman Geuvers (Radboud University Nijmegen, The Netherlands) Georges Gonthier (Microsoft Research, Cambridge, UK) Hugo Herbelin (INRIA, Paris, France) Fairouz Kamareddine (Heriot-Watt University, Edinburgh, UK) Michael Kohlhase (Jacobs University, Bremen, Germany) Artur Kornilowicz (University of Bialystok, Poland) Zhaohui Luo (Royal Holloway, University of London, UK) Erik Palmgren (Stockholm University, Sweden) Peter Schuster (University of Leeds, UK) Helmut Schwichtenberg (Ludwig Maximilians University, Munich, Germany) The workshop is supported and/or sponsored by Department of Mathematics (University of Padova), Department of Computer Science and Engineering (University of Bologna), Italian Ministry of Education, University and Research (MIUR), Accademia Galileiana Padova. The organizing committee Francesco Ciraulo, Maria Emilia Maietti, Claudio Sacerdoti Coen, Giovanni Sambin From Aatu.Koskensilta at uta.fi Thu Nov 29 10:54:33 2012 From: Aatu.Koskensilta at uta.fi (Aatu Koskensilta) Date: Thu, 29 Nov 2012 17:54:33 +0200 Subject: [FOM] Terminology In-Reply-To: References: Message-ID: <20121129175433.1135592cdti0iibd@imp3.uta.fi> Quoting Alasdair Urquhart : > In Section 15 of his Introduction to Mathematical > Logic, Alonzo Church uses the word "contradiction" > for a propositional formula that is false under > all assignments to its variables. This terminology > seems perfectly satisfactory to me. In a wider context this terminology is not completely happy, unfortunately. By a tautology is usually meant a sentence that is true by virtue of its truth-functional structure, a substitution instance of a validity in propositional logic. But there are contradictions e.g. in first-order logic -- (x)(Ey)P(x,y) & (Ex)(y)~P(x,y) for instance -- that are not (substitution instances of) logical falsehoods in propositional logic, that are not false by virtue of their truth-functional structure. -- Aatu Koskensilta (aatu.koskensilta at uta.fi) "Wovon man nicht sprechen kann, dar?ber muss man schweigen" - Ludwig Wittgenstein, Tractatus Logico-Philosophicus From botocudo at gmail.com Thu Nov 29 12:17:10 2012 From: botocudo at gmail.com (Joao Marcos) Date: Thu, 29 Nov 2012 14:17:10 -0300 Subject: [FOM] Terminology Message-ID: > In Section 15 of his Introduction to Mathematical > Logic, Alonzo Church uses the word "contradiction" > for a propositional formula that is false under > all assignments to its variables. This terminology > seems perfectly satisfactory to me. In that case, maybe we will still have the need for a word to talk about the conjunction of a formula and its negation? At the time of Church, paraconsistent logics were still far from being created. Joao Marcos -- http://sequiturquodlibet.googlepages.com/ From MartDowd at aol.com Fri Nov 30 11:25:50 2012 From: MartDowd at aol.com (MartDowd at aol.com) Date: Fri, 30 Nov 2012 11:25:50 -0500 (EST) Subject: [FOM] Terminology Message-ID: <1f004.24df8280.3dea380e@aol.com> In computer science, the word "unsatisfiable" has been in wide use for such formulas for quite some time. - Martin Dowd In a message dated 11/29/2012 9:21:02 A.M. Pacific Standard Time, botocudo at gmail.com writes: In Section 15 of his Introduction to Mathematical > Logic, Alonzo Church uses the word "contradiction" > for a propositional formula that is false under > all assignments to its variables -------------- next part -------------- An HTML attachment was scrubbed... URL: From zadeh at eecs.berkeley.edu Thu Nov 29 19:42:32 2012 From: zadeh at eecs.berkeley.edu (Lotfi A. Zadeh) Date: Thu, 29 Nov 2012 16:42:32 -0800 Subject: [FOM] Logical Correctness/ Drago Message-ID: <50B800F8.6090501@eecs.berkeley.edu> Dear Antonino, Many thanks for your comment and your substantive question regarding interpretation of "impossible." To respond to your question, I will have to first clarify my questions. In the main, my questions relate to the case where in "possible p," p is a fuzzy proposition. Simple example. Robert is rich. Less simple example. Robert is much richer than most of his friends. When p is assumed to be a fuzzy proposition, my questions become nontrivial, and some--highly nontrivial. The case where p is a fuzzy proposition takes us beyond classical modal logic and puts us in the realm of fuzzy modal logic, fuzzy logic and possibility theory--a branch of fuzzy logic. Furthermore, when p is a fuzzy proposition, possibility becomes a matter of degree, with possibility taking values in the unit interval or, more generally, in a lattice. In this setting, a nontrivial question is the following. Informally, if it is possible that Robert is rich, what is the possibility that Robert is not rich? What is the possibility that Robert is poor? In his message, Vaughn gives the impression that answers to my questions can be found in the references which he cites. I doubt very much that this is the case. When possibility takes values in the unit interval, possible is a fuzzy subset of the unit interval. In this case, impossible is likewise a fuzzy set. In terms of possible, impossible may be interpreted in two ways. First, as the complement of possible; and second, as the antonym of possible, in which case impossible=1-possible in the notation of fuzzy arithmetic. When possibility takes values in the unit interval and possible is a fuzzy subset of the unit interval, terms such as quite possible, more or less possible, almost impossible, etc., become meaningful. Then, we can deal with sentences like "Itis quite possible that Robert isrich." Such sentences fall within the province of possibility theory, but not within the province of fuzzy modal logic. What is important to note is that "It is quite possible that Robert is rich," is an instance of a sentence drawn from everyday discourse. Dealing with such sentences is a challenge for modal logic. Sincerely, Lotfi -- Lotfi A. Zadeh Professor Emeritus Director, Berkeley Initiative in Soft Computing (BISC) Address: 729 Soda Hall #1776 Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720-1776 zadeh at eecs.berkeley.edu Tel.(office): (510) 642-4959 Fax (office): (510) 642-1712 Tel.(home): (510) 526-2569 Fax (home): (510) 526-2433 URL: http://www.cs.berkeley.edu/~zadeh/ BISC Homepage URLs URL: http://zadeh.cs.berkeley.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.randall.holmes at gmail.com Thu Nov 29 16:02:53 2012 From: m.randall.holmes at gmail.com (Randall Holmes) Date: Thu, 29 Nov 2012 14:02:53 -0700 Subject: [FOM] Updates to "Elementary Set Theory with a Universal Set" Message-ID: Dear colleagues, I am currently editing the online version of my elementary set theory text using NFU, found at http://math.boisestate.edu/~holmes/holmes/head.pdf(with the kind permission of my publishers), with an eye to producing an "official" second edition. If you know of any errata in this text that particularly annoy you, please advise me. You might possibly need to do this even if you have already sent me corrections: the version I am working from may not be the very latest version previously posted, and I have had trouble finding all the earlier mail about corrections. If you are inspired to take a look at it for the first time and feel inclined to comment, feel free. -- Sincerely, Randall Holmes Any opinions expressed above are not the official opinions of any person or institution. -------------- next part -------------- An HTML attachment was scrubbed... URL: From pmt6sbc at maths.leeds.ac.uk Thu Nov 29 17:29:18 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Thu, 29 Nov 2012 22:29:18 GMT Subject: [FOM] CiE 2013: The Nature of Computation, Milan, Italy, July 1-5, 2013 Message-ID: <201211292229.qATMTIAX023734@maths.leeds.ac.uk> ************************************************************************ CALL FOR PAPERS: CiE 2013: The Nature of Computation Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications. CiE 2013 conference topics include, but not exclusively: * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: * Gerard Alberts (Amsterdam) * Luis Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans) * Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ From T.Forster at dpmms.cam.ac.uk Thu Nov 29 13:12:58 2012 From: T.Forster at dpmms.cam.ac.uk (T.Forster at dpmms.cam.ac.uk) Date: 29 Nov 2012 18:12:58 +0000 Subject: [FOM] Terminology In-Reply-To: <20121129175433.1135592cdti0iibd@imp3.uta.fi> References: <20121129175433.1135592cdti0iibd@imp3.uta.fi> Message-ID: I've also heard `self-contradiction'.. On Nov 29 2012, Aatu Koskensilta wrote: >Quoting Alasdair Urquhart : > >> In Section 15 of his Introduction to Mathematical >> Logic, Alonzo Church uses the word "contradiction" >> for a propositional formula that is false under >> all assignments to its variables. This terminology >> seems perfectly satisfactory to me. > > In a wider context this terminology is not completely happy, >unfortunately. By a tautology is usually meant a sentence that is true >by virtue of its truth-functional structure, a substitution instance >of a validity in propositional logic. But there are contradictions >e.g. in first-order logic -- (x)(Ey)P(x,y) & (Ex)(y)~P(x,y) for >instance -- that are not (substitution instances of) logical >falsehoods in propositional logic, that are not false by virtue of >their truth-functional structure. > > From botocudo at gmail.com Thu Nov 29 13:13:10 2012 From: botocudo at gmail.com (Joao Marcos) Date: Thu, 29 Nov 2012 15:13:10 -0300 Subject: [FOM] Terminology Message-ID: > > In Section 15 of his Introduction to Mathematical > > Logic, Alonzo Church uses the word "contradiction" > > for a propositional formula that is false under > > all assignments to its variables. This terminology > > seems perfectly satisfactory to me. > > In a wider context this terminology is not completely happy, > unfortunately. By a tautology is usually meant a sentence that is true > by virtue of its truth-functional structure, a substitution instance > of a validity in propositional logic. But there are contradictions > e.g. in first-order logic -- (x)(Ey)P(x,y) & (Ex)(y)~P(x,y) for > instance -- that are not (substitution instances of) logical > falsehoods in propositional logic, that are not false by virtue of > their truth-functional structure. Another perspicuous example that does not depend on the duality of the quantifiers, but on equality instead, would be: (Ex)Px & (Ex)~Px & (x)(y)x=y No need for a very populated universe, in such a case! JM -- http://sequiturquodlibet.googlepages.com/ From hmflogic at gmail.com Thu Nov 29 13:42:27 2012 From: hmflogic at gmail.com (Harvey Friedman) Date: Thu, 29 Nov 2012 13:42:27 -0500 Subject: [FOM] 510: More Undefinable Elements 2 Message-ID: THIS RESEARCH WAS PARTIALLY SUPPORTED BY THE JOHN TEMPLETON FOUNDATION ***************************************** THIS POSTING IS A CONTINUATION OF http://www.cs.nyu.edu/pipermail/fom/2012-November/016806.html http://www.cs.nyu.edu/pipermail/fom/2012-November/016809.html ***************************************** The Trinity - see http://www.cs.nyu.edu/pipermail/fom/2012-November/016809.html - suggests the following. A STRUCTURE WITH EXACTLY THREE UNDEFINABLE ELEMENTS x,y,z, EACH DEFINABLE FROM EACH OTHER, WHERE NO NONEMPTY SUBSET OF {x,y,z} IS DEFINABLE. More generally, A STRUCTURE WITH EXACTLY n UNDEFINABLE ELEMENTS x_1,...,x_n, EACH DEFINABLE FROM EACH OTHER, WHERE NO NONEMPTY SUBSET OF {x_1,...,x_n} IS DEFINABLE. Here definability of elements and finite sets always means without parameters. This can be done by adaptation of the arguments in http://www.math.osu.edu/~friedman.8/manuscripts.html #74. As in there, we can get the structure to be a graph, and handle "there exists infinitely" and quantitative quantifiers. ***************************************** I use http://www.math.ohio-state.edu/~friedman/ for downloadable manuscripts. This is the 509th in a series of self contained numbered postings to FOM covering a wide range of topics in f.o.m. The list of previous numbered postings #1-449 can be found in the FOM archives at http://www.cs.nyu.edu/pipermail/fom/2010-December/015186.html 450: Maximal Sets and Large Cardinals II 12/6/10 12:48PM 451: Rational Graphs and Large Cardinals I 12/18/10 10:56PM 452: Rational Graphs and Large Cardinals II 1/9/11 1:36AM 453: Rational Graphs and Large Cardinals III 1/20/11 2:33AM 454: Three Milestones in Incompleteness 2/7/11 12:05AM 455: The Quantifier "most" 2/22/11 4:47PM 456: The Quantifiers "majority/minority" 2/23/11 9:51AM 457: Maximal Cliques and Large Cardinals 5/3/11 3:40AM 458: Sequential Constructions for Large Cardinals 5/5/11 10:37AM 459: Greedy CLique Constructions in the Integers 5/8/11 1:18PM 460: Greedy Clique Constructions Simplified 5/8/11 7:39PM 461: Reflections on Vienna Meeting 5/12/11 10:41AM 462: Improvements/Pi01 Independence 5/14/11 11:53AM 463: Pi01 independence/comprehensive 5/21/11 11:31PM 464: Order Invariant Split Theorem 5/30/11 11:43AM 465: Patterns in Order Invariant Graphs 6/4/11 5:51PM 466: RETURN TO 463/Dominators 6/13/11 12:15AM 467: Comment on Minimal Dominators 6/14/11 11:58AM 468: Maximal Cliques/Incompleteness 7/26/11 4:11PM 469: Invariant Maximality/Incompleteness 11/13/11 11:47AM 470: Invariant Maximal Square Theorem 11/17/11 6:58PM 471: Shift Invariant Maximal Squares/Incompleteness 11/23/11 11:37PM 472. Shift Invariant Maximal Squares/Incompleteness 11/29/11 9:15PM 473: Invariant Maximal Powers/Incompleteness 1 12/7/11 5:13AMs 474: Invariant Maximal Squares 01/12/12 9:46AM 475: Invariant Functions and Incompleteness 1/16/12 5:57PM 476: Maximality, CHoice, and Incompleteness 1/23/12 11:52AM 477: TYPO 1/23/12 4:36PM 478: Maximality, Choice, and Incompleteness 2/2/12 5:45AM 479: Explicitly Pi01 Incompleteness 2/12/12 9:16AM 480: Order Equivalence and Incompleteness 481: Complementation and Incompleteness 2/15/12 8:40AM 482: Maximality, Choice, and Incompleteness 2 2/19/12 7:43AM 483: Invariance in Q[0,n]^k 2/19/12 7:34AM 484: Finite Choice and Incompleteness 2/20/12 6:37AM__ 485: Large Large Cardinals 2/26/12 5:55AM 486: Naturalness Issues 3/14/12 2:07PM 487: Invariant Maximality/Naturalness 3/21/12 1:43AM 488: Invariant Maximality Program 3/24/12 12:28AM 489: Invariant Maximality Programs 3/24/12 2:31PM 490: Invariant Maximality Program 2 3/24/12 3:19PM 491: Formal Simplicity 3/25/12 11:50PM 492: Invariant Maximality/conjectures 3/31/12 7:31PM 493: Invariant Maximality/conjectures 2 3/31/12 7:32PM 494: Inv Max Templates/Z+up, upper Z+ equiv 4/5/12 4:17PM 495: Invariant Finite Choice 4/5/12 4:18PM 496: Invariant Finite Choice/restatement 4/8/12 2:18AM 497: Invariant Maximality Restated 5/2/12 2:49AM 498: Embedded Maximal Cliques 1 9/18/12 12:43AM 499. Embedded Maximal Cliques 2 9/19/12 2:50AM 500: Embedded Maximal Cliques 3 9/20/12 10:15PM 501: Embedded Maximal Cliques 4 9/23/12 2:16AM 502: Embedded Maximal Cliques 5 9/26/12 1:21AM 503: Proper Classes of Graphs 10/13/12 12:17PM 504. Embedded Maximal Cliques 6 10/14/12 12:49PM 505: Function Transfer Theory 10/21/12 2:15AM 506: Finite Embedded Weakly Maximal Cliques 10/23/12 12:53AM 507: Finite Embedded Dominators 11/6/12 6:40AM 508: Unique Undefinable Elements 11/27/12 3:30PM 509: More Undefinable Elements 11/27/12 10:03PM Harvey Friedman From irving.anellis at gmail.com Thu Nov 29 14:54:05 2012 From: irving.anellis at gmail.com (Irving Anellis) Date: Thu, 29 Nov 2012 14:54:05 -0500 Subject: [FOM] terminology Message-ID: Alasdair Urquhart notes that in Section 15 of his Introduction to Mathematical Logic, Alonzo Church uses the word "contradiction" for a propositional formula that is false under all assignments to its variables. This terminology seems perfectly satisfactory to me. I think that that terminology has become fairly standard. My own preference for "t-definite", "t-indefinite" or "f-indefinite", and "f-definite", as opposed to "tautology", "contingent" and "contradiction" lies in allowing application of those terms for truth as well as for validity, for semantic and syntactic uses. -- Irving H. Anellis 8905 Evergreen Avenue, Apt. 171 Indianapolis, IN 46240-2073 From silver_1 at mindspring.com Thu Nov 29 22:26:51 2012 From: silver_1 at mindspring.com (Charlie) Date: Thu, 29 Nov 2012 19:26:51 -0800 Subject: [FOM] criteria for the existence of infinite models of FO theories In-Reply-To: <1343690527.78426.YahooMailClassic@web120606.mail.ne1.yahoo.com> References: <1343690527.78426.YahooMailClassic@web120606.mail.ne1.yahoo.com> Message-ID: Is this the same question as before? I'm not sure. If so, one way would be to incorporate these three simple sentences as axioms (or their conjunction): 1) Ax~(Fxx); 2) AxAyAz(Fxy & Fyz --> Fxz); 3) AxEy(Fxy). Charlie Silver On Jul 30, 2012, at 4:22 PM, Andrei Popescu wrote: > Dear FOM subscribers, > > I am searching for (preferably lightweight) syntactic criteria for a first-order theory to admit infinite models. I would appreciate any pointers to results in the literature. > > All the best, > Andrei Popescu > _______________________________________________ > FOM mailing list > FOM at cs.nyu.edu > http://www.cs.nyu.edu/mailman/listinfo/fom