<!--{{{-->\n<div class='toolbar' macro='toolbar +saveTiddler -cancelTiddler deleteTiddler'></div>\n<div class='title' macro='view title'></div>\n<div class='editor' macro='edit title'></div>\n<div class='editor' macro='edit text'></div>\n<div class='editor' macro='edit tags'></div><div class='editorFooter'><span macro='message views.editor.tagPrompt'></span><span macro='tagChooser'></span></div>\n<!--}}}-->
<<tiddler MainMenu>>\n\nAuthorMainMenu\nMainMenu\nDefaultTiddlers\nPluginManager\nPresentationIndex\n
<!--{{{-->\n<div id='header' class='header' macro='gradient vert [[ColorPalette::PrimaryLight]] [[ColorPalette::PrimaryMid]]'>\n<div class='headerShadow'>\n<span class='siteTitle' refresh='content' tiddler='SiteTitle'></span>&nbsp;\n<span class='siteSubtitle' refresh='content' tiddler='SiteSubtitle'></span>\n</div>\n<div class='headerForeground'>\n<span class='siteTitle' refresh='content' tiddler='SiteTitle'></span>&nbsp;\n<span class='siteSubtitle' refresh='content' tiddler='SiteSubtitle'></span>\n</div>\n</div>\n<div id='mainMenu' refresh='content' tiddler='AuthorMainMenu'></div>\n<div id='sidebar'>\n<div id='sidebarOptions' refresh='content' tiddler='SideBarOptions'></div>\n<div id='sidebarTabs' refresh='content' force='true' tiddler='SideBarTabs'></div>\n</div>\n<div id='displayArea'>\n<div id='messageArea'></div>\n<div id='tiddlerDisplay'></div>\n</div>\n<!--}}}-->
/***\nPlace your custom CSS here\n***/\n/*{{{*/\n\n\n[[StyleSheetCommon]]\n/*}}}*/\n
<!--{{{-->\n<div class='toolbar' macro='toolbar closeTiddler closeOthers +editTiddler permalink references jump'></div>\n<div class='title' macro='view title'></div>\n<div class='subtitle'><span macro='view modifier link'></span>, <span macro='view modified date [[DD MMM YYYY]]'></span> (<span macro='message views.wikified.createdPrompt'></span> <span macro='view created date [[DD MMM YYYY]]'></span>)</div>\n<div class='tagging' macro='tagging'></div>\n<div class='tagged' macro='tags'></div>\n<div class='viewer' macro='view text wikified'></div>\n<div class='viewer topbutton' macro='top'></div>\n<br><br>\n<div class='viewer' macro='navigation tiddlers:{{store.getTiddlerText("PresentationIndex").readBracketedList()}}}'></div>\n<div class='tagClear'></div>\n<!--}}}-->
@@color(red):__''Axiomatic Set Theory''__@@\n(Spring 2011, ILLC, University of Amsterdam)\n\n@@color(blue):__''VERY IMPORTANT NOTE''__:@@ @@color(red): ''PLEASE PRESS THE `REFRESH' BUTTON __EVERY TIME__ YOU ACCESS THIS PAGE!!!''@@\n''Otherwise you will still see the old content (although the page IS periodically updated!).''\n\n\n__''Time''__\n\n\nTuesdays 13:00-15:00, Fridays 11:00-13:00\n\n\n__''Place''__\n\nROOM CHANGES!!!\nDue to lack of space, we will move to larger rooms. But they will differ from day to day and week to week!\nThe full room schedule is listed below, under //Course Plan// (and also in Datanose and Blackboard)\n\n\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistant (and Marker)''__\n\nThere are two assistents: \n ZHENHAO LI and SHENGYANG ZHONG.\nThey will be taking turns grading or explaining exercises in tutorial classes.\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures or in exercise classes, please always email them to BOTH my assistants:\nZhenhao Li, at //z.li@uva.nl// ,\nAND Shengyang Zhong, at //zhongshengyang@163.com//\nwith CC to me. Or come to see them during office hours. (Time and Place TBA.)\n\nIn case they cannot answer a question, please email me at //TheAlexandruBaltag@gmail.com// and, if necessary, make an appointment to see me.\n\n\n\n\n__''Format''__\n\nLectures, tutorial classes and office hours.\n\n__''Study materials''__\n\nThe //main textbook// for this course is\n\nK. Devlin, ''The Joy of Sets'', Springer-Verlag, 1993 (Second Edition).\n\nIn addition, I will use\n\nJ. Barwise and L. Moss, ''Vicious Circles'', //CSLI Lecture Notes// no. 60, CSLI Publications, 1996\n\nfor the last few lectures of the course (on non-wellfounded sets).\n\nFor more technical material, I //might// sometimes use \n\nK. Kuratowski and A. Mostowski, ''Set Theory'', //Studies in Logic and Foundations of Mathematics// vol. 86. North-Holland Publishing Company , 1976 (Second Edition)\n\nbut it is not necessary for students to look at this (unless they are really interested in acquiring more advanced technical knowledge of set theory, going beyond this course).\n\nFor a biography of Georg Cantor, click [[HERE|http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Cantor.html]] ,or look up \n\nJ. W. Dauben, ''Georg Cantor: His Mathematics and Philosophy of the Infinite'', Princeton University Press, 1979\n\nfor a more detailed biography and philosophical discussion. \n\nFor more on the philosophical foundations of Set Theory, see the excellent discussion in\n\nM. Hallett, ''Cantorian Set Theory and Limitation of Size'', Oxford University Press, 1984 (reprinted in paperback, 1986, 1988)\n\nor also\n\nM. Potter, ''Set Theory and Its Philosophy'', Oxford University Press, 2004 (reprinted, 2009).\n\nIn addition, I //may// occasionally have ''slides'' of some of the lectures. Though many of the lectures might just be based only on chalk and blackboard!\n\n\n\n__''Assessment''__\n\nThree homework exercises (worth in total 50% of the final grade), plus a final TAKE-HOME (worth the other 50% of the final grade). Both the exercises and the take-home exam are individual (i.e. NO COLLABORATION).\n\n__''COURSE PLAN''__\n\nThe plan below is ''tentative''. It will be adjusted depending on time, students' feedback and interest etc. Each week, after the lecture, a brief summary of what was actually covered will be given here, and if slides were used in lecture then they will be made available here.\n\n*February 7 (room D1-114): \nSUMMARY: //Naive Set Theory//: sets, set-theoretic operations, relations, functions, equipotence, partial and total orders, well-orders, cardinals and ordinals; Cantor, his background, Cantor's theorem, Cantor-Bendixson derivative.\n\n\n*February 10: \n//NO CLASS//! BUT you are all invited to attend Yurii Khomskii's PhD defense (in whose committee I am), as a ``set theory lesson". Look on ILLC news for time and place.\n\n*February 14 (room F1-02):\nSUMMARY: Cardinals: proofs of cardinal equivalencies and Cantor's theorem. Hilbert's hotel. Well-ordered sets and Induction. Ordinals: definition of von Neumann ordinals, successor and limit ordinals, properties, examples. Logicism, formalism and intuitionism. \nFrege's Comprehension Axiom. Russell's Paradox;\n\n\n\n\n*February 17 (room D1-115), \n//Naive Set Theory continued//: well-foundedness; the Mirimanoff paradox; the Burali-Forti paradox. Solutions to Paradoxes: Russell's Type Theory and the Iterative conception of sets; the Limitation of Size conception; other conceptions: sets-as-classes; the Structural conception of sets; the Topological conception of sets, //Axiomatic Systems of Set Theory//, and their names. The Cummulative hierarchy of sets. Axioms of the Zermelo-Fraenkel system ZFC. The language of set theory LAST. \n\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets1.pdf]] for the ''Slides of the first three lectures''.\n\n__''HOMEWORK 1''__ \n(''DUE Friday 24 February before 10:00 am. Please leave it in SHENGYANG ZHONG's mailbox at ILLC, or email to him at '': //zhongshengyang@163.com// . ''Late submissions will NOT be considered!! '')\n\n//Do the following exercises// from Devlin (//The Joy of Sets//, 1993 edition):\n\nExercise 2.1.1 (page 34), parts (ii), (iii), (v), (vi), (vii); \nExercise 2.2.1 (page 39); Exercise 2.2.3 (page 39); \nExercise 2.2.6 (page 39); Exercise 2.3.1 (page 40); \nExercise 2.3.6 (page 44); Exercise 2.3.8 (page 45).\n\n\n\n\n*February 21 (room F1-02): Classes in ZFC. Basic results on ordinals. Recursion on ordinals. \nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets4.pdf]] for the ''Slides of the fourth lecture''.\n\n. \n\n*February 24 (room C1-112): \n//exercise class//.\n\n\n*February 28 (room A1-04),\n*March 2 (room C1-110):\nOrdinal recursion continued. AC, Zorn's Lemma and Zermelo's Well-Ordering Theorem. Ordinal Arithmetic: ordinal addition and subtraction. Ordinal multiplication. Infinite sums. Division with remainder. Limits. Exponentiation. \nEssentially: ''until now we covered all the material in Chapters 1 and 2 from Devlin, as well in sections 3.1, 3.2, 3.3, 3.4, 3.5.''\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets5,6.pdf]] for the ''Slides of the fifth and sixth lecture''.\n\n__''HOMEWORK 2''__ \n(''DUE Friday 9 March before 10:00 am. Please leave it in ZHENHAO LI mailbox at ILLC, or email to him at '': Zhenhao Li, at //z.li@uva.nl// . ''Late submissions will NOT be considered!! '')\n\n//Do the following exercises// from Devlin (//The Joy of Sets//, 1993 edition):\n\nSection 2.8, page 63, problem 1 (A), (B), (C).\n\nSection 2.8, page 64, problem 3 (A).\n\nProve Lemma 3.3.2 (page 70), by defining an order isomorphism between the ordinals on the two sides of the equation.\n\nProve Lemma 3.5.1 (page 74), using the hit given as ``proof" in the book.\n\nExercise 3.5.1 (page 74).\n\nExercise 3.5.3 (page 75).\n\n\n\n*March 6 (room F1-02): \nContinuous functions. Normal operations. The fixed point theorem. ε numbers. Normal form. Cantor Normal form. \nPeano Arithmetic PA. Proving the consistency of PA in ZFC. Goodstein's theorem. \nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets7.pdf]] for the ''Slides of the seventh lecture''.\n\n\n*March 9 (room C1-112):\n//exercise class//.\n\n*March 13 (room F1-02):: Countability of ordinals and uncountable ordinals: omega1. Cardinals and their ordering. Schroder-Bernstein Theorem. Totality of the cardinal order depends on AC. Alephs. Cardinal Arithmetic: cardinal addition, multiplication and exponentiation. Their laws.\n\n(These slides are together with the ninth lecture, included below, in the March 20 slides.)\n\n*March 16 (room C0-110): \n//exercise class//.\n\n*March 20 (room F1-02): \nCardinal Arithmetic Continued. Cantor's theorem revisited. Cofinality. Singular and regular cardinals. Cardinal exponentiation. The Continuum Hypothesis (CH). The Generalized Continuum Hypothesis (GCH). \n\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets8,9.pdf]] for the ''Slides of the 8th and 9th lecture'' .\n\n\n*March 23 (room C1-112): //EXERCISE CLASS//.\n\n\n__''HOMEWORK 3''__ \n(''DEADLINE EXTENSION: DUE Friday 20 April before 10:00. You can return the solutions either by leaving them in ZHENHAO LI mailbox at ILLC, or emailing to him at '': Zhenhao Li, at //z.li@uva.nl// , or by giving them to them at the start of the exercise class on 20 April. ''Late submissions will NOT be considered!! '')\n\n//Do the following exercises// from Devlin (//The Joy of Sets//, 1993 edition):\n\nthe proof of Lemma 3.7.5 (page 84), \nthe proof of Lemma 3.7.6 (page 84).\nthe proof of Lemma 3.8.2 (page 89), \nthe proof of Lemma 3.8.4 (page 89),\nproblems 2.A and 2.B from Section 3.11 (page 99).\n\n*April 3: NO LECTURE!\n\n*April 10 (room B0-201): \n Reflection. Large Cardinals: (weakly and strongly) inaccessible cardinals. Connections to logic. Models of Set Theory. \n\n\n*April 13 (room B0-201): \n//exercise class//.\n\n*April 17 (room B0-201): \nTopics in Pure Set Theory: topologies, Boolean algebras, measurable spaces, Borel sets, Borel hierarchy, measure theory, Cantor spaces; trees, Konig Tree Lemma. Higher infinities: weakly compact cardinals, measurable cardinals, strongly compact cardinals etc.\n\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets10.pdf]] for the ''Slides of Lecture of the last two lectures''\n\n*April 20 (room B0-201): \n//exercise class//.\n\n*April 24 (room B0-201): \nModels of Set Theory: the Constructible Universe. Relative consistency of AC and (G)CH.\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets11.pdf]] for the ''Slides of Lecture 11''\n\n\n*May 4 (room B0-201): CANCELED. \n\n*May 8 (room B0-201): \nThe Ideas behind the Independence Proofs for AC and (G)CH. \nModels of Set Theory: forcing and Boolean-Valued Universes. \n\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/Sets12.pdf]]\n\n*May 11 (room F1-02): \nModels of Set Theory. Non-wellfounded Sets: AFA and ZFA. Modeling circularity, semantic paradoxes, games. Pointed graphs, bisimilarity. Co-recursion and co-induction. \n\n*May 15 (room A1-10): \nConnections to Modal Logic. Beyond limitation of size: the structural-topological set theory (STS) and the universal set. Set-theoretical paradoxes, revisited.\n\n\n__''Final Take-Home Exam''__ \n(''DUE 3 June before 12:00''): Click [[HERE|http://www.vub.ac.be/CLWF/SS/ExamSetTheory.pdf]]
Story.prototype.refreshTiddler_activelink = Story.prototype.refreshTiddler;\nStory.prototype.refreshTiddler = function (title,template,force)\n{\n var theTiddler = Story.prototype.refreshTiddler_activelink.apply(this,arguments);\n if (!theTiddler)\n return theTiddler\n var menu = document.getElementById("mainMenu");\n var links = menu.getElementsByTagName("a");\n for (var i=0; i<links.length; i++)\n {\n if (!links[i].getAttribute("tiddlyLink"))\n return;\n if (document.getElementById(this.idPrefix+(links[i].getAttribute("tiddlylink"))))\n addClass(links[i],"bold");\n else\n removeClass(links[i],"bold");\n }\n return theTiddler;\n}
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n''Mailing Address:''\nFNWI\nILLC\nUniversiteit van Amsterdam\nP.O. Box 94242\n1090 GE AMSTERDAM\n\n''Visiting Address'':\n\nRoom F2-42\nBuilding F\nScience Park 107\n1098 XG Amsterdam\n\n''Telephone'':\n\n+31 20 525 6925\n\n''E-mail Addresses'':\n\nTheAlexandruBaltag (at) gmail.com\n\nA.Baltag (at) uva.nl\n\n\n\n
Click here for the pdf file: [[CV|http://www.vub.ac.be/CLWF/SS/CV.pdf]]
I have been affiliated to: [[CWI|http://www.cwi.nl/]], (Dutch Center for Mathematics and Computer Science) & [[ILLC|http://www.illc.uva.nl/]] (Institute for Logic, Language and Computation), University of Amsterdam, NL; [[IU Department of Mathematics|http://www.math.indiana.edu/]], Indiana University; [[Institute of Mathematics of the Romanian Academy|http://www.imar.ro/]], Bucharest, Romania.\n
Background: #ffffff\nForeground: #000\nPrimaryPale: #ddccff\nPrimaryLight: #eeeeff\nPrimaryMid: #330066\nPrimaryDark: #000\nSecondaryPale: #ffc\nSecondaryLight: #fe8\nSecondaryMid: #db4\nSecondaryDark: #330066\nTertiaryPale: #ddccff\nTertiaryLight: #EEC591\nTertiaryMid: #000\nTertiaryDark: #8B7355
config.options.chkAnimate = false;\nconfig.options.chkSinglePageMode = true;\nconfig.options.chkTopOfPageMode = false;
''Contributed Talks to Conferences and Workshops''\n\n*Annual Conference of the Association for Symbolic Logic, Irvine University, California 1995. Presentation of contributed talk: "Modal Logic and Topology".\n*Annual Conference of the Association for Symbolic Logic, Madison, Wisconsin, 1996. Presentation of contributed talk: "Modal Characterizations for Sets and Kripke Structures".\n*The 10th //European Summer School in Logic,\nLanguage and Information// (ESSLLI'96), Prague 1996. Contributed Paper: "Multidimensional Epistemic Logic". My paper was presented by Martin de Rijke.\n*Annual Conference of the Association for Symbolic Logic, Boston Massachusetts, 1997. Presentation of contributed talk: "Interpolation and Preservation for Pebble Logics".\n*The 7th Conference on //Theoretical Aspects of Rationality and Knowledge// (TARK'98), Evanston, Illinois, July 22-24 1998.Contributed paper.\n*Second Conference on {\sem Advances in Modal Logic}, (AIML 98), Uppsala, Sweden, October 1998. Presentation of contributed paper.\n*Workshop on //Coalgebraic Methods in Computer Science// (CMCS'99), part of the ETAPS'99 Conference, Amsterdam, March 1999. Participant.\n*Summer School in //Logic and Computation//, Herriot - Watt University, Edinburgh, Great Britain, April 10-13 1999. Presentation of contributed paper.\n*Workshop on //Foundations and Applications of Collective Agent Based Systems//, part of the 11th European Summer School in Logic, Language and Information (ESLLI'99), Utrecht University, Utrecht, August 1999. Presentation of contributed talk.\n*Workshop on //Coalgebraic Methods in Computer Science// (CMCS'00), satellite of ETAPS'00, Berlin, March 2000. Presentation of contributed talk: "A Logic for Coalgebraic Simulation".\n*GLLC'00, University of Amsterdam, Amsterdam, April 14 2000. Presentation of contributed talk.\n*The Fourth Conference on //Logic and Foundations of Game Theory and Decision Theory// (LOFT'00), ICER, Torino, Italy, June 30-July 2 2000. Presentation of contributed talk.\n*The Fourth Workshop on //Games in Logic, Language and Computation// (GLLC'00), Groningen University, Groningen, NL, November 21 2000. Presentation of contributed talk.\n*//Logic Colloquim 2000// (LC'00), Paris, La Sorbonne, July 23-31 2000. Presentation of contributed talk.\n*The 6th //Barcelona Logic Meeting//, satellite of the Third European Congress of Mathematics, Barcelona, Spain, July 5-8 2000. Presentation of contributed talk.\n*The 4th International Workshop on //Coalgebraic Methods in Computer Science// (CMCS'01), satellite workshop of ETAPS 2001 Genova, Italy 6-7 April 2001. Presentation of contributed talk.\n*The 8th Conference on //Theoretical Aspects of Rationality and Knowledge// (TARK'01), Siena, Italy, July 2001. Presentation of contributed talk.\n*Workshop on //Coalgebraic Methods in Computer Science// (CMCS'02), satellite of ETAPS'02, Grenoble, France, April 2002. PC Member and participant.\n*LOGAMAS '02 (Symposium on //Logic in Games and Multi - Agent Systems//), University of Liverpool, 16-17 December 2002. Contributed Talk: "A Hoare Logic for Epistemic Programs".\n*NASSLLI'02 (The First //North - American Summer School in Logic, Language and Information//), Stanford University, July 2002. Participant and co-lecturer at the post-graduate course "Dynamic Epistemic Logic", taught by L. Moss.\n*CMCS'03 (Workshop on //Coalgebraic Methods in Computer Science//), satellite of ETAPS'03, Warsaw, Poland, April 2003. Contributed Talk: "A Coalgebraic Semantics for Epistemic Programs".\n*NASSLLI'03 (//The Second Summer School in Logic, Language and Information//), Indiana University, Bloomington, Indiana, July 2003. Speaker and course organizer: I gave a series of 5 lectures, as a post-graduate course on "Logics for Communication: reasoning about information flow in dialogue games". Course available [[online|http://www.indiana.edu/~nasslli]].\n*2nd LICS Workshop on //Quantum Programming Languages// (QPL'04), affiliated to LICS '04 (Turku, Finland 2004). My (joint) submission (with Sonja Smets) "A Dynamic Logic for Quantum Programming" was accepted and presented by Bob Coecke.\n*LICS Workshop on {\sit Resources, Processes and Programs} (LRPP'04), affiliated to LICS '04 (Turku, Finland 2004). My (joint) paper (with B. Coecke and M. Sadrzadeh) "Epistemic actions as resources" was accepted and presented by M. Sadrazadeh.\n*1st Workshop on {\sit Knowledge and Games} (KAG'04), Liverpool, July 2004. Contributed Talk: "Learning that you are being deceived".\n*//Quantum Structures '04//, the 8th Meeting of the Quantum Structures Association (//IQSA//), Denver, USA, July 2004. Contributed paper (joint work with S. Smets) "The Logic of Quantum Actions", presented by S. Smets.\n*Workshop on //Logic and Communication in Multi - Agent Systems// (LCMAS'04) affiliated to ESSLLI'04, Nancy, France, August 2004. Contributed paper (joint with B. Coecke and M. Sadrzadeh) "Algebra and Calculus for Epistemic Actions", presented by M. Sadrzadeh.\n*2nd European Workshop on Multi - Agent Systems (//EUMAS '04//), Barcelona, Spain, December 2004. Contributed paper ``Reasoning about Dynamic Epistemic Logic" (joint with B. Coecke and S. Smets), presented by M. Sadrzadeh.\n*Workshop on //Logic from Quantales//, Oxford University, January 2005. Talk: "Quantum Dynamic Algebra".\n*2nd Meeting on //Algebraic and Topological Methods in Non-classical Logics//, Barcelona, June 2005. Contributed talk: "The Logic of Quantum Information Flow".\n*Workshop on //Quantum Information, Computation and Logic: Exploring New Connections// (QICL'05), at the Perimeter Institute for Theoretical Physics, Waterloo (Ontario), Canada, July 2005. Joint mini - course (with S. Smets) in Quantum Computation: "Quantum Dynamic Logic".\n*3rd International Workshop on //Logic and Communication in Multi - Agent Systems// (LCMAS'05), affiliated to IJCAI'05 (19th International Joint Conference on Artificial Intelligence), Herriot - Watt University, Edinburgh, August 2005. Contributed paper (joint with B. Coecke and M. Sadrzadeh) "The Algebra of Multi - Agent Dynamic Belief Revision", presented by M. Sadrzadeh.\n*Workshop on //Belief Revision and Dynamic Logic//, affiliated to ESSLLI '05, Edinburgh, August 2005. Contributed paper (joint with B. Coecke and M. Sadrzadeh) "The Algebra of Multi - Agent Dynamic Belief Revision", presented by M. Sadrzadeh.\n*17th European Summer School in Logic, Language and Information (//ESSLLI 2005//), Herriot - Watt University, Edinburgh, August 2005. Contributed chapter (including slides for presentation) to the course on "Dynamic Epistemic Logic" taught by H. van Ditmarsch and B. Kooi. My contribution was presented by J. Gerbrandy.\n*Fifth European Congress for Analytic Philosophy (//ECAP 5//) University of Lisbon, Portugal, 27-31 August 2005. Participant.\n*Workshop on //Quantum Information: Logical and Epistemological Lessons//, affiliated to //ECAP 5//, University of Lisbon, Portugal, 29 - 30 August 2005. Participant and contributed talk. My joint paper (with S. Smets) "What can Logic Learn from Quantum Mechanics?" was presented by S. Smets.\n*18th //European Summer School in Logic Language and Information// (ESSLLI'06), University of Malaga, Spain, July - August 2006. Speaker and course organizer: I gave a series of 5 lectures, as a post-graduate course on "Logics for Quantum Information Flow". Joint work with S. Smets. Course available [[online|http://www.vub.ac.be/CLWF/SS/ESSLLI.html]].\n*Workshop on //Rationality and Knowledge// (RAK'06), affiliated with ESSLLI'06, University of Malaga, Spain, July - August 2006. Presentation of contributed talk.\n*The 7th Conference on //Logic and Foundations of Game Theory and Decision theory//(LOFT'06), University of Liverpool, July 2006. Presentation of contributed talk.\n*The 13th Workshop on //Logic, Language, Information and Computation// (WOLLIC'06), Stanford University, July 2006. Presentation of contributed talk.\n*13th International Congress of //Logic, Methodology and Philosophy of Science//, Tsinghua University, Beijing, China, August 9 - 15, 2007. Presentation of contributed talk.\n*The Ninth Conference on //Theoretical Aspects of Rationality and Knowledge// (TARK 9), June 25 - 27th, 2007, Brussels, Belgium. Presentation of two contributed talks.\n*Workshop on //Logic and Intelligent Interaction//, affiliated with ESSLLI'08, August 11 - 15, 2008 Hamburg. Contributed talk "Dynamic Rationality in Extensive Games" (joint work with S. Smets and J. Zvesper), presented by J. Zvesper.\n*The 8th Conference on //Logic and Foundations of Game Theory and Decision theory// (LOFT'08), University of Amsterdam, July 2008. Contributed paper "When All is Done and not (Yet) Said: Dynamic Rationality in Extensive Games" (joint work with S. Smets and J. Zvesper), presented by J. Zvesper.\n*//Quantum Structures '08//, the 9th Biennial Meeting of the Quantum Structures Association (//IQSA//), Sopot, Poland, July 2008. Contributed paper "The Logical Dynamics of Entanglement" (joint work with S. Smets), presented by S. Smets.\n* 16th workshop on // Logic, Language, Information and Computation//, WOLLIC, Tokyo, 21-24 juni 2009. Contributed paper "Learning by Questions and Answers: From Belief- Revision Cycles to Doxastic Fixed Points" (joint work with S. Smets).\n* Workshop on //Theoretical Aspects of Rationality and Knowledge//, TARK, Stanford, 6-8 July 2009. Contributed paper "Group Belief Dynamics under Iterated Revision: Fixed Points and Cycles of Joint Upgrades" (joint work with S. Smets).\n*//European Summer School for Logic, Language and Information//, ESSLLI 2009, Bordeaux 20-31 Juli, 2009. Post-graduate course given on "Dynamic Logics for Interactive Belief Revision". Joint work with S. Smets. \n*The //Second Multi -Agent Logics, Languages, and Organisations Federated Workshops (FAMAS)//, Turin, Italy, 7-10 September, 2009. Contibuted paper on "Talking Your Way into Agreement: Belief Merge by Persuasive Communication" (joint work with S. Smets).
[[CONTACT]]
\nSee it in action here: http://lewcid.googlepages.com/tots.html\n\n!!Editing this TW:\nOpen the TW with #author:true at the end of the url/file location to enable editing.\nPreview edits by using the "Presentation Mode" button in the MainMenu\n//(To make future editing easier, bookmark the file with #author:true at the end of the file name. One click and edit!)//\n\n!!Changing the content and order of the presentation:\nEdit the PresentationIndex tiddler to change the contents and order of the presentation.\n\n!! Customizing the default (viewing) interface.\nEdit the following tiddlers as needed:\n*PageTemplate\n*StyleSheet\n*ViewTemplate\n*EditTemplate\n*MainMenu\n\n!!Customizing the editing (author's) interface.\nEdit the following tiddlers as needed: //(Note that these files are optional, if any of them dont exist, the standard viewing one will be used instead. So if you only want to change the PageTemplate, you only need an AuthorPageTemplate tiddler.)//\n*AuthorPageTemplate\n*AuthorStyleSheet\n*AuthorViewTemplate\n*AuthorEditTemplate\n*AuthorMainMenu\n\n!!Using a different stylesheet or theme:\nUsing your own favorite stylesheet or theme is as simple as importing those tiddlers into this file.\nIf you are changing the presentation interface, just import the PageTemplate and StyleSheet. If you want to change the editing interface, you will need to copy over the PageTemplate and StyleSheet as AuthorPageTemplate and AuthorStyleSheet respectively.\n\n!!Other tips:\n* Use the tiddler StyleSheetCommon and include it using {{{[[StyleSheetCommon]]}}} in your StyleSheet and AuthorStyleSheet when making stlyesheet changes that you want applied to both the presentation and editing interface, to avoid having to type it out twice!\n*To provide easy control over the font-size, use the FontSizePlugin: http://lewcid.googlepages.com/lewcid.html#FontSizePlugin\n* If this presentation is going to be placed online, you might want to have a splash screen that displays while the TW is loading: http://lewcid.googlepages.com/lewcid.html#SplashScreenPlugin
!Dummy Tiddler 3\n\ndummy tiddler three
!DummyTiddler2\n\nThis is the second tiddler of your dummy presentation
''DYNAMIC EPISTEMIC LOGIC''\n\n(2015, ILLC, University of Amsterdam)\n\n@@VERY IMPORTANT NOTE: PLEASE PRESS THE `REFRESH' BUTTON EVERY TIME YOU ACCESS THIS PAGE!!!@@\nOtherwise you will still see the old content (although the page IS periodically updated!).\n\n__''Time and Place''__\n\n*Lectures: \n\nTuesdays 11:00-13:00 (locations vary, see Datanose)\nThursdays 11:00-13:00, and 13:00-15:00 (locations vary, see Datanose).\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistants (and Markers)''__\n\nZOE CHRISTOFF <zoe.christoff@gmail.com>\nPAOLO GALEAZZI <pagale87@gmail.com>\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures, please email them to me at ~TheAlexandruBaltag@gmail.com and, if necessary, make an appointment to see me.\n\n__''Objectives of Course''__\n\nFirst, to present to students the main concepts and formalism of Dynamic Epistemic Logic (DEL), including recent developments on connections to other fields (from Epistemology and Learning Theory to Bayesian theory, Game Theory, Social Software, Pragmatics of Natural Language etc). Second, to enable students to acquire some research experience, by discussing some of the outstanding conceptual challenges in the field, as well as more technical open questions, and giving them guidance and encouragement to tackle some of these issues in their final projects.\n\n__''Contents''__\n\nThis course is addressed to students and researchers interested in logics for reasoning about multi-agent belief revision, belief updates and knowledge updates induced by various forms of communication or interaction. We start by presenting the main concepts of "standard DEL" (as covered e.g. in the book ``Dynamic Epistemic Logic" and in several ESSLLI courses with the same name): multi-agent epistemic Kripke models, public announcements, epistemic event models, product update, and the corresponding dynamic logics. Then we present the more recent "belief-revision-friendly" version of DEL and its main concepts (plausibility models, the Action Priority Update), by combining the techniques of Dynamic Epistemic Logic with the insights and models from Belief Revision theory. We formalize various types of doxastic attitudes (belief, strong belief, safe belief, conditional belief, degrees of belief, group belief), notions of defeasible "knowledge", belief upgrades and belief-revision policies etc. We give some axiomatizations and apply these notions to communication strategies and the pragmatics of Natural Language, to rationality and strategic reasoning in Game Theory, to the formalization of key concepts in modern Epistemology, and to the analysis of various epistemic-doxastic paradoxes and puzzles (Fitch's knowability paradox, the Puzzle of the Perfect Believer, the Muddy Children, the Surprise Examination etc). Further, depending on time I might present various extensions of this setting (to Bayesian dynamics of probabilistic beliefs, dynamics of evidence and justification etc), as well as recent work at the interface of DEL with Learning Theory, Epistemology, Social Choice theory, social-informational dynamics, Secure Communication, pragmatics etc. We discuss some of the on-going conceptual challenges and the open technical questions encountered in the field, and we encourage and guide students to start tackling some of these problems. \n\n__''Recommended prior knowledge''__\n\nWe presuppose some (but very little) background knowledge in Logic: basically, the syntax and semantics of modal logic. This should be enough for understanding the course, though obviously having more prior knowledge can only lead to better final projects. Having some more advanced technical knowledge of Modal Logic theory could be very useful for tackling some of the open questions, but it is not required. Some familiarity with, or at least some interest in, any of the above-mentioned areas of intended application (Epistemology, Pragmatics, Game Theory, ~Multi-Agent Systems etc) would also be very welcome, and particularly useful for tackling some of the more conceptual challenges. Some basic knowledge of Probability Theory would also be useful for the understanding of some applications, but it is not really necessary for following the course More importantly, we assume that participants in the course possess both some degree of mathematical maturity (as can be expected from students in logic at a ~MSc level) and a live interest in interdisciplinary connections and applications of Logic. \n\n__''Format''__\n\n*Lectures.\n*Study materials\n\n*There is no main textbook for this course. The principal material consists in slides of lectures, which will be regularly made available on Blackboard after each lecture. In addition, I will refer to a number of textbooks and materials, among which the most important are: \n\nA. Baltag, H. P. van Ditmarsch and L.S. Moss, Epistemic logic and information update, in the Handbook of Philosophy of Information (Editors: P. Adriaans and J. van Benthem), part of the series Handbook of Philosophy of Science, vol. 8, pp. 361-455, Elsevier, 2008. Electronically available [[HERE|http://www.vub.ac.be/CLWF/SS/DELhandbookarticle.pdf]] \n\nJ. van Benthem, Logical Dynamics of Information and Interaction, Cambridge Univ Press, 2011.\n\nH. P. van Ditmarsch, W. van der Hoek and B. Kooi , Dynamic Epistemic Logic, Springer, 2007.\n\nR. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, Reasoning about Knowledge, MIT Press, Cambridge MA 1995.\n\nWe are also writing a new manual now: \n\nA. Baltag, J. van Benthem, J. van Eijck, S. Smets, Reasoning about Communication and Action. To appear. We will make available working drafts of chapters on this website.\n\n__''Assessment''__\n\nTwo or three homework exercises (worth in total 20% of the final grade), plus a final paper or project (worth 80% of the final grade) on one of the topics investigated in the course. The exercises are individual (i.e. no collaboration), while the final papers can be jointly written by teams. The homework exercises will be mostly mathematical-technical, while the final paper/project could be conceptual/philosophical, or more technical-mathematical, or even more applied (computational), depending on each student's choice and interests. \n\n__''COURSE PLAN''__\n\nThe plan below is tentative. It will be adjusted depending on time, students' feedback and interest etc. '' Each week (with some exceptions that will be explicitly noted) there will be 3 lectures'': Tuesday 11:00-13:00, Thursday 11:00-13:00 and Thursdays 13:00-15:00. ''After the lecture, the slides of the covered material will be made available on BLACKBOARD'', together with a brief summary of what was actually covered. \n\n''WEEK 1:''\n\n*LECTURE 1.1 (Tuesday, October 28, 11:00-13:00): Administration, Introduction: Motivation (philosophical, logical, computational etc). Main themes. Examples and Jokes. Epistemic Puzzles: the Coordinated Attack; 'To Learn is to Falsify': self-defeating truths, self-fulfilling falsehoods, and self-enabling falsehoods. Distributed knowledge and common knowledge. The Muddy Children Puzzle. From the Muddy Children to the cheating husbands. Breaking the rules: Sneaky Children and the dangers of mercy. \n\n\n*LECTURE 1.2 (Thursday, October 30, 11:00-13:00): Surprised children: the Surprise Examination paradox. The Lottery paradox. The Centipedes Game and the Backward Induction paradox. The Wisdom of the Crowds and group knowledge. The Madness of the Crowds: informational cascades; epistemic bandwagon and pluralistic ignorance. \n\n*LECTURE 1.3. (Thursday, October 30, 13:00-15:00): ~Single-Agent Epistemic/doxastic Logics: K, S5, S4, ~KD45. Sphere Models for knowledge and belief. Learning by removal of possibilities: update. A complete system of axioms for a basic single-agent epistemic-doxastic logic.\n\n\n''//Slides of all the lectures in Week 1 are now available on the course's Blackboard page.//''\n\n\n''WEEK 2 :''\n\n*LECTURE 2.1 (Tuesday): Kripke Models, Epistemic Models, Doxastic Models. The problem of Introspection. The problem of logical omniscience.\nMulti-agent Models. Common Knowledge and Common (true) Belief.\n\n*LECTURE 2.2 (Thursday 11:00-13:00): Distributed Knowledge. The problem of belief aggregation. Dynamics: updates. The problem of belief revision. Public Announcements. Fully Private Announcements. ~Fair-Game Announcements. Cheating, lying, misinformation. Secret interception of messages. \n\n*LECTURE 2.3 (Thursday 13:00-15:00): PDL versus DEL. Logics talking about model changes. Dynamic modalities for epistemic actions. Syntax, Semantics and Axiomatization of PAL (Public Announcement Logic). Reduction laws and their uses. Co-expressivity of PAL and EL. Increase in Succinctness. Closure of public announcements under composition.\n\n''//Slides of all the lectures in Week 2 are now available on the course's Blackboard page.//''\n\n\n''WEEK 3:'' \n\n*LECTURE 3.1 (Tuesday): Finish last week's slides: PAC (=PAL with common knowledge): its increased expressivity. Complete Axiomatizations of PAC. Application: formalizing Muddy Children. This weeks slides: OTHER EXTENSIONS OF PAL: PAL with distributed knowledge. ``Tell us all you know". The Logic of Fully Private Announcements.\n\n*LECTURE 3.2 (Thursday 11:00-13:00): ``STANDARD DEL": Epistemic Event Models and Product Update. Examples. Axiomatizations of DEL: Reduction Laws, the ~Action-Knowledge Axiom. Special cases: axioms for PAL and other announcement logics. EXTENSIONS OF DEL: Adding common knowledge to DEL: the problems for axiomatization, and ways to solve them. Composition of event models. Complete Axiomatization of DEL with common knowledge. The Action Rule. Example: the Private Announcement Rule. \n\n*LECTURE 3.3 (Thursday 13:00-15:00): OTHER EXTENSIONS OF DEL: Adding iteration (Kleene star). Iterated PAL and undecidability. Arbitrary Announcement Logic. ``Learnability" and ``knowability" Applications: Fitch's Paradox and Verificationism. Fact-Changing Events. \n\n''//First Homework will be put on the web this day (Thursday November 13). It will be due on 2 weeks from then (i.e. Thursday November 27).//''\n\n''WEEK 4 :''\n\n*LECTURE 4.1 (Tuesday): Belief Revision Theory ~AGM-style. Criticism. The AGM Postulates. Grove sphere models. Conditional beliefs. Connections to non-monotonic logics, conditional logics and default logics.\n\n\n*Thursday: NO LECTURE. You are all invited to attend the Synthese conference on Qualitative and Quantitative Methods in Formal Epistemology (20-21 November). See details [[HERE|http://www.illc.uva.nl/Synthese/]] \n\n\n\n''WEEK 5:''\n\n*LECTURE 5.1: Plausibility models, Spohn models. The logic of conditional beliefs. DYNAMICS: soft upgrades; ~dynamic-doxastic attitudes as belief-revision policies. Strong beliefs and lexicographic (``radical") upgrade. Simple belief and minimal (``conservative") upgrade. Positive, negative and mixed attitudes: examples, definitions etc.\n\n\n\n*LECTURE 5.2: Epistemology: the nature of knowledge and the Gettier challenge. The puzzle of the Perfect Believer. The Defeasibility Theory of Knowledge. Formalizing defeasible knowledge. \n\n*LECTURE 5.3: Epistemology Continued: the logic of the two ``knowledges". Other notions of knowledge: weak stability, knowledge as a fixed point. An 'Erlangen Program' for Epistemology. Long-term dynamics: iterated upgrades. Infinite cycles versus stabilization of beliefs. Fixed points. Solutions to the Surprise Exam Paradox.\n\n\n\n\n''WEEK 6:''\n\n*LECTURE 6.1: Formal Learning Theory. Learnability: coming to know with certainty (finite identifiability). Coming to defeasibly know: identifiability in the limit. Conditions for learnability: Topological Epistemology. Learning via belief revision: the universality of updates. The importance of prior beliefs: relevance, simplicity and Ockham's Razor. The ~learning-theoretic limits of the AGM paradigm: ~non-wellfoundedness and omega-inconsistency of beliefs. The problems posed by Computable Learning: failure of Rational Monotonicity.\n\n*LECTURE 6.2: Awareness, Justification and Evidence (without logical omniscience!): awareness models, Justification Logic and evidential dynamics. Evidence management and the need for the yesterday operator. Analysis of Gettier examples. Incorporating new evidence: the DEL of soft evidence and doxastic justification. Gettier examples continued. \n\n\n*LECTURE 6.3: Multi-agent plausibility models. Common attitudes and joint upgrades. Axiomatization of soft (non-monotonic) DEL. Formalizing ~Dynamic-Doxastic Attitudes. The Mutual Trust Graph. Types of Lying and Cheating. Sincerity, Honesty and Persuasiveness. From preference aggregation to belief merge and group rationality. Social Choice theory, Arrow's impossibility theorem and ways out. Parallel Merge, Lexicographic Merge and Relative Priority Merge. Notions of group knowledge. Dynamic merge: merging beliefs by communication. The Power of Agendas. Information dynamics as a form of belief merge. Event Plausibility Models and the Action Priority Update. \n\n\n''WEEK 7:''\n\n*LECTURE 7.1: Probabilistic reasoning: from Bayes to Popper. Probabilistic modeling of qualitative beliefs: the Lockean Thesis. The Lottery Paradox. Bayesian update and the problem of belief revision. Conditional probabilistic spaces, lexicographic probabilities and their relation to plausibility models. Extending Bayesian conditioning to conditional probabilistic spaces: quantitative analogues of update, radical upgrade and conservative upgrade. \n\n*LECTURE 7.2: Probabilistic analogues of defeasible knowledge. Degree of safety of a belief. Degree of strength and Leitgeb's stability theory of belief. Probabilistic DEL and probabilistic event models. Probabilistic Learning.\n\n*LECTURE 7.3: Applications to Game theory. Backward Induction, elimination of dominated strategies, Nash equilibria and other solution concepts: their epistemic justifications. Strategies as Conditional Beliefs. Common knowledge (common strong belief, common stable belief) of (substantive or dynamic) Rationality. Free Will and the Epistemic Openess of the Future. Optimistic versus Pessimistic Belief-Revision Strategies. \n\n''WEEK 8:''\n\n*LECTURE 8.1. Applications to Social Epistemology. Social knowledge and collective learning. The Wisdom and the Madness of the Crowds: Condorcet's Jury Theorem, informational cascades. From epistemic democracy to epistemic bandwagon effect.The Game-Theoretic approach to cascades.\n\n*LECTURE 8.2. Social networks. Friendship logic and other logics for social networks. Adoption rules and social influence. Cascades and clusters. From cascades to other info-storms: belief polarization, pluralistic ignorance etc.\n\n* LECTURE 8.3: Course Review and Discussion of Final Projects/\n\n \n\n@@Some Possible Topics for Final Projects in this Course@@\nThe largest component in your final grade is based on your final project. These projects should be pursued in small groups (2-3 students) or individually. No two groups can choose the same topic. The project work will consist in reading 2-4 papers on the topic, summarizing their technical content (together with all the needed background) in your own words, and discussing in writing EITHER the conceptual implications and philosophical issues, OR the technical open problems, arising from what you've read, OR BOTH. After you choose, I will provide you with some of the relevant papers, though finding new relevant papers and including an excellent bibliography is very much encouraged (and will be especially rewarded). AND (OF COURSE!), any new good ideas, new interesting settings or concepts, or new non-trivial technical developments, will be amply rewarded! But they are not absolutely necessary for getting a good grade. Here is a list of possible topics (though any other ideas concerning other topics are also welcome, provided that they are related to the course):\n\n1. Probabilistic reasoning versus qualitative learning.\n2. DEL and Game Theory (logical aspects of strategic reasoning, epistemic conditions for solution concepts etc)\n3. DEL-based approaches to Epistemology (concepts of knowledge and their relation to belief, belief dynamics, justification etc)\n4. Social Epistemology: Concepts of `group knowledge', belief aggregation and the dynamics of a group's beliefs. \n5. Epistemic Paradoxes (Fitch, Moore, Voorbraak, the Surprise Exam, Lottery Paradox etc)\n6. Interrogative DEL: the dynamics of questions and answers\n7. Logics for the dynamics of preferences, intentions and/or norms\n8. DEL and the problem of logical omniscience: the dynamics of inference and evidence.\n9. Connections between DEL and Learning Theory.\n10. Quantum DEL: dynamic logics for quantum information\n11. DEL and issues in the pragmatics of communication and argumentation (dialogues, honesty, sincerity, persuasion, Gricean implicature, connections with the Dynamic Semantics of natural language etc).\n12. Topological semantics for knowledge, belief, evidence and learning.
''Papers on Dynamic Quantum Logic''\n\n*A. Baltag, J. Bergfeld, K. Kishida, J. Sack, S. Smets and S. Zhong. Quantum Probabilistic Dyadic Second-Order Logic. In Wollic 2013 (proceedings in LNCS).\n*A. Baltag and S. Smets. "Correlated Information: A Logic for Multi- Partite Quantum Systems". To appear in //Electronic Notes in Theoretical Computer Science ENTCS//, 2010.\n*A. Baltag and S. Smets. [[“Quantum Logic as a Dynamic Logic"|http://www.vub.ac.be/CLWF/SS/BethPaper_Final.pdf]]. In: Theo Kuipers, Johan van Benthem and Henk Visser (eds.), //Synthese//, special issue. Online First October 2010.\n*A. Baltag and S. Smets. [[“Correlated Knowledge, An Epistemic-Logic View on Quantum Entanglement"|http://www.vub.ac.be/CLWF/SS/IQSA2009SmetsBaltag.pdf]], // International Journal of Theoretical Physics //, Online First July 2010.\n*A. Baltag and S. Smets. "Correlated Information: A Logic for Multi- Partite Quantum Systems". In //Proceedings of the sixth workshop on Quantum Physics and Logic//, Oxford 2009.\n*A. Baltag and S. Smets. [["LQP: The Dynamic Logic of Quantum Information"|http://www.vub.ac.be/CLWF/SS/LQP.pdf]]. //Mathematical Structures in Computer Science//, 16 (3): 491-525, 2006. Cambridge University Press. \n*A. Baltag and S. Smets. [["Complete Axiomatizations for Quantum Actions."|http://www.vub.ac.be/CLWF/SS/IQSA.pdf]] //International Journal of Theoretical Physics// 44 (12):2267-2282, 2005. Springer Publishers, NY.\n*A. Baltag. The logic of quantum information flow. (Abstract) //Proceedings of the 2nd Meeting on Algebraic and Topological Methods in Non-classical Logics//, 13-14, Barcelona, 2005.\n*A. Baltag, S. Smets. [["The Logic of Quantum Programs"|http://www.mathstat.dal.ca/%7Eselinger/qpl2004/proceedings.html]]. //Proceedings of QPL'04// (2nd LICS Workshop on Quantum Programming Languages), TUCS General Publication 33: 39-56, Turku, Finland 2004.
ESSLLI 2012 Course on ''Interactive learning, formal social epistemology and group belief dynamics: logical, probabilistic and game-theoretic models''\n\nAlexandru Baltag, Sonja Smets\n\n''Content of the course:''\n\nThis course is addressed to students and researchers interested in formal approaches to multi-agent belief change, interactive learning and doxastic group attitudes induced by various forms of inter-agent communication or interaction. In this sense, we present, compare and relate various models for group knowledge and group belief dynamics, developed by researchers in areas as different as Dynamic Epistemic Logic, Belief Revision theory, the Bayesian theory of rational belief change, Computational Learning Theory, Game theory, as well as Epistemology (especially the new areas of Formal Epistemology and Social Epistemology). We take the Logical perspective as fundamental, and look at ways to integrate within it the other mentioned approaches. We look at applications to: rationality and equilibria in games; epistemic paradoxes; the formalization of classical epistemological conceptions; the issue of tracking the truth by individual belief revision strategies or by pooling up information via merging strategies exploiting the “wisdom of the crowds”; as well as the apparently “irrational” aspects of epistemic group dynamics (informational cascades, epistemic bandwagon effect, pluralistic ignorance).\n\n''Timeliness and relevance to ESSLLI''\n\nThe field of Dynamic Epistemic Logic has rapidly developed in the last 12 years, successfully dealing with various forms of group learning, communication and interaction. In parallel, the new philosophical fields of Formal and Social Epistemology are currently thriving. On the other hand, Belief Revision Theory, Computational Learning theory, the Bayesian theory of probabilistic belief change and the Game- Theoretic study of interactive learning in repeated games are well-established fields, with clear relevance to ESSLLI and with a well-known set of classical results and open problems. \nCourses on Dynamic Epistemic Logic, as well as courses on Interactive Belief Revision, on Rational Agency, on Computational Learning and on Bayesian theory of belief update have already been given at several ESSLLI’s. But no ESSLLI course has touched all the approaches mentioned above, despite the fact that great progress in connecting and comparing each two of these different approaches has been registered in recent years (though a number of exciting conceptual challenges and technical open problems remain to be tackled). So we think it is timely to have such a course at ESSLLI.\n\n''Course Slides''\n\nLecture 1: [[Slides|http://www.vub.ac.be/CLWF/SS/esslli2012lecture1-Aug13.pdf]]\n\nLecture 2: [[Slides|http://www.vub.ac.be/CLWF/SS/esslli2012lecture2NEW.pdf]]\n\nLecture 3: [[Slides|http://www.vub.ac.be/CLWF/SS/esslli2012lecture3.pdf]]\n\nLecture 4: [[Slides|http://www.vub.ac.be/CLWF/SS/esslli2012lecture4.pdf]]\n\nLecture 5: [[Slides|http://www.vub.ac.be/CLWF/SS/esslli2012lecture5.pdf]]\n\n\n''Prerequisites''\n\nThis course is essentially self-contained. We presuppose some (but very little) background knowledge in Logic: basically, some previous familiarity with the syntax and semantics of modal logic, and maybe with the usual axioms of Epistemic Logic. This should be enough for understanding the course, though obviously having more prior knowledge, in particular of elementary notions of Probability theory, and/or the basic concepts of Game Theory, would be very welcome. More importantly, we assume that participants in the course possess both some degree of mathematical maturity (as can be expected from graduate students in Logic) and a live interest in interdisciplinary connections and applications of Logic.
ESSLLI'06 Course on ''Logics for Quantum Information Flow''\nBy Alexandru Baltag and Sonja Smets\n\nThis course is addressed to students interested in the logic of quantum information, and in particular in the use of modal (dynamic and epistemic) logics to reason about information flow in quantum computation. It is an advanced course, based on classical work in quantum logic and quantum computation, as well as on our own work on Quantum Dynamic- Epistemic Logic.\n\nSome prior familiarity with the most basic notions of multi-modal logic (PDL and epistemic logic), and with some basic algebraic notions (in Lattice Theory and Linear Algebra) would be very helpful; nevertheless, we will provide and briefly explain all the basic definitions, so the course is in principle self-contained. The course starts with an introduction to the basic concepts of Quantum Mechanics (in terms of Hilbert spaces, linear maps and tensor products), Quantum Computation (quantum-logic gates, quantum measurements, various quantum algorithms), then continues with a presentation of traditional Quantum Logic and of its algebraic and relational semantics; then we make the connection with dynamic modal logic, introducing Quantum Transition Systems as non-classical relational models for the (classical) language of PDL. We also give an equivalent algebraic semantics, in terms of Quantum Dynamic Algebras, and briefly present a Representation (and completeness) theorem for these structures. In the second part of the course, we introduce epistemic modalities, to express "knowledge" as localised information in a compound quantum system: any localised subsystem is taken as an "agent", whose "knowledge" is given by the information potentially available at that location. We use the resulting Quantum Dynamic- Epistemic Logic to characterise physical-computational properties, such as separation, entanglement, correlations between local measurements, various quantum-logical gates, Bell states etc. We present a proof system for this logic, which can capture important quantum-computational features. Finally, we use this logic to analyze and formally prove the correctness of some quantum programs, such as the famous Teleportation Protocol.\n\n[[ESSLLI'06 Course Slides]]\n[[ESSLLI'06 Course References]]
Course on ''Logics for Quantum Information Flow''\nBy Alexandru Baltag and Sonja Smets\n\nReferences:\n\nThe list of relevant material for our ESSLLI 06 Course is very large. Below we mention only the main textbooks in the field and some of our research papers on which the course material is based.\n\n''Our Research Papers:''\n\nA. Baltag and S. Smets: [["What can Logic Learn from Quantum Mechanics?"|http://www.vub.ac.be/CLWF/SS/ECAP.pdf]].\n\nA. Baltag and S. Smets: [["LQP: The Dynamic Logic of Quantum Information"|http://www.vub.ac.be/CLWF/SS/LQP.pdf]].\n\nA. Baltag and S. Smets: [["Complete Axiomatizations for Quantum Actions"|http://www.vub.ac.be/CLWF/SS/IQSA.pdf]].\n\n''Quantum Computation:''\n\nJ. Gruska. //Quantum Computing//, The Mc Graw- Hill Companies, England, 1999 \n\nM. A. Nielsen and I.L. Chuang: //Quantum Computation and Quantum Information//, Cambridge University Press, 2001.\n\n''Quantum Logic:''\n\nM. Dalla Chiara, R. Giuntini and R. Greechie, //Reasoning in Quantum Theory//, Kluwer Academic Publishers, 2004.\n\nC. Piron, //Foundations of Quantum Physics//, W.A. Benjamin Inc., Massachusetts (1976)\n\n''Modal Logic and Dynamic Logic:''\n\nP. Blackburn, M. de Rijke and Y. Venema, //Modal Logic// , Cambridge University Press, 2001.\n\nD. Harel, D. Kozen and J. Tiuryn, //Dynamic Logic//, MIT press, Massachusetts, 2000.\n\n[[ESSLLI'06 Course Description]]\n[[ESSLLI'06 Course Slides]]\n
ESSLLI'06 Course on ''Logics for Quantum Information Flow''\nBy Alexandru Baltag and Sonja Smets\n\n- [[Lecture1|http://www.vub.ac.be/CLWF/SS/WEB1.zip]]\n- [[Lecture2|http://www.vub.ac.be/CLWF/SS/WEB2.zip]]\n- [[Lecture3|http://www.vub.ac.be/CLWF/SS/WEB3.zip]]\n- [[Lecture4|http://www.vub.ac.be/CLWF/SS/WEB4.zip]]\n- [[Lecture5|http://www.vub.ac.be/CLWF/SS/WEB5.zip]]\n\n\n[[ESSLLI'06 Course Description]]\n[[ESSLLI'06 Course References]]
ESSLLI'09 Course on ''Dynamic Logics for Interactive Belief Revision''\nBy Alexandru Baltag and Sonja Smets\n\nThis course is addressed to students and researchers interested in logics for reasoning about multi-agent belief revision, belief updates and knowledge updates induced by various forms of communication or interaction. It is an advanced course, designed to present to students and researchers from other fields the work done in recent years by a number of researchers on integrating ideas from Belief Revision Theory within the DEL (Dynamic Epistemic Logic) paradigm. The course presupposes a background knowledge of the syntax and semantics of basic modal logic. Some familiarity with the standard modal logics for knowledge and belief, as well as with some basic issues of standard Belief Revision theory, would be most welcome (though not required) for an easier understanding of the material.\n\nWe start by presenting the main notions of "standard DEL", arguing that this logic is appropriate for updating "hard information" (unrevisable knowledge), but that it is inappropriate for "soft information" (possibly false beliefs or defeasible knowledge). We then present "belief-revision models", defining some important epistemic/doxastic notions, considering a number of logical languages for these models, and explaining the relevance of these notions to fundamental issues in contemporary Epistemology, in Computer Science and in the study of language and communication. We present various Belief Update operations and various belief-revision policies proposed by different authors, focusing on one particular proposal (the Action - Priority Update) of great generality and elegance. We present reduction laws (the "dynamic laws of Interactive Belief Revision"), complete axiomatizations, applications to dialogue games, belief merge, communication strategies, connections with other research areas and open problems.\n\n[[ESSLLI'09 Slides]]\n[[ESSLLI'09 References]]\n
Course on ''Dynamic Logics for Interactive Belief Revision''\nBy Alexandru Baltag and Sonja Smets\n\nReferences:\n\nThe list of relevant material for our ESSLLI 09 Course on Dynamic Logics for Interactive Belief Revision is very large. Below we mention only the main textbooks, some websites and some names of authors with relevant article contributions.\n\nA. Baltag, L.S. Moss and H.P. van Ditmarsch, "Epistemic Logic and Information Update". In (Eds) P. Adriaans and J. van Benthem", //Philosophy of\nInformation//, part of Handbook of the Philosophy of Science, vol. 8, pp. 361-465, Elsevier, 2008\n\nA. Baltag and S. Smets, [["A Qualitative Theory of Dynamic Interactive Belief Revision"|http://www.vub.ac.be/CLWF/SS/Ch1-Baltag.pdf]], in G. Bonanno, W. van der Hoek, M. Wooldridge (eds.), //Logic and the Foundations of Game and Decision Theory//, [[Texts in Logic and Games|http://www.illc.uva.nl/TLG/index.php?page=10_1_3_3]], Vol 3, pp.9-58, Amsterdam University Press, 2008\n\nH.P. van Ditmarsch, W. van der Hoek and B.P. Kooi, //Dynamic Epistemic Logic//, Synthese Library 337, Springer, 2007\n\nR. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, //Reasoning about Knowledge//, MIT Press, 1995\n\nP. Gardenfors, //Knowledge in Flux: Modelling the Dynamics of Epistemic States//, MIT Press, 1988\n\nP. Gardenfors and H. Rott, "Belief Revision". In //Handbook of Logic of AI and Logic Programming//, vol. 4, pp. 35-132, Oxford University Press, 1995.\n\nP. Gardenfors. //Belief Revision//. Cambridge University Press. 1992.\n\nP. Gochet and P. Gribomont, "Epistemic Logic". In (eds) D. M. Gabbay and J. Woods, //Handbook of the History of Logic//, vol. 7, pp. 99-195, Elsevier, 2006\n\nJ.Y. Halpern, //Reasoning about Uncertainty//, MIT Press, 2003\n\nS. O. Hansson. //A textbook in Belief Dynamics.// Dordrecht: Kluwer Academic Publishers. 1999.\n\nJ. Hintikka, //Knowledge and Belief//, Cornell University Press, 1962\n\nJ.-J.Ch. Meyer and W. van der Hoek, //Epistemic Logic for AI and Computer Science//, Cambridge Tracts in Theoretical Computer Science, nr. 41, Cambridge University Press, 1995.\n\n//Stanford Encyclopedia of Philosophy//: articles on "Defeasible Reasoning: Belief Revision" and "Logics of Belief Revision". \n\nBeliefrevision.org\n\nVarious articles and papers by: G. Aucher, A. Baltag, J. van Benthem, C. Boutilier, H. P. van Ditmarsch, J. van Eijk, P. Gardenfors, J. Gerbrandy, E. Gettier, P. Grove, Katsuno and Mendelzon, B.P. Kooi, K. Lehrer, D. Makinson, L.S. Moss, E. Pacuit, J. Plaza, H. Rott, A.C. Nayak, R. Stalnaker, S. Smets, W. Spohn, F.P.J.M. Voorbraak, E. Weidert etc.\n\n\n[[ESSLLI'09 Course Description]]\n[[ESSLLI'09 Slides]]\n\n\n
Course on ''Dynamic Logics for Interactive Belief Revision''\nBy Alexandru Baltag and Sonja Smets\n\nSlides:\n\n- [[Lecture1|http://www.vub.ac.be/CLWF/SS/D1.pdf]]\n- [[Lecture2|http://www.vub.ac.be/CLWF/SS/D2.pdf]]\n- [[Lecture3|http://www.vub.ac.be/CLWF/SS/D3.pdf]]\n- [[Lecture4+5|http://www.vub.ac.be/CLWF/SS/D4.pdf]]\n\n\n[[ESSLLI'09 Course Description]]\n[[ESSLLI'09 References]]\n
''Logics for Quantum Information Flow''\nBy Alexandru Baltag and Sonja Smets\n\nCourse at ESSLLI'06\n\nWelcome to our course on Logics for Quantum Information Flow\n\n[[ESSLLI'06 Course Description]]\n[[ESSLLI'06 Course Slides]]\n[[ESSLLI'06 Course References]]
''Dynamic Logics for Interactive Belief Revision''\nBy Alexandru Baltag and Sonja Smets\n\nCourse at ESSLLI'09 - section on "Logic and Computation"\n\nWelcome to our course on Dynamic Logics for Interactive Belief Revision:\n\n[[ESSLLI'09 Course Description]]\n[[ESSLLI'09 Slides]]\n[[ESSLLI'09 References]]\n
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n''EVENTS''\n\nI am the organizer of the [[Logic and Interactive Rationality (LIRa) seminar at ILLC| http://www.illc.uva.nl/lgc/seminar/]].\n\n''Selection of recent events:''\n* [[Studia Logica Trends VI December 2008|http://www.vub.ac.be/CLWF/TrendsVI/]]\n* [[ICALA 2009, Chennai January 2009|http://ali.cmi.ac.in/icla2009/social.html]]\n* [[Logics Inspired by Quantum Computation, Bloomington, May 2009|http://www.indiana.edu/~iulg/qliqc/]]\n* [[WOLLIC 2009, Tokyo June 2009|http://wollic.org/wollic2009/]] \n* [[ESSLLI July 2009|http://esslli2009.labri.fr/]] (course given on "Dynamic Logics for Interactive Belief Revision", joint with S. Smets).\n* [[TARK 2009, Stanford July 2009|http://ai.stanford.edu/~epacuit/tark09/]]\n* [[FAMAS 2009, Torino September 2009|http://www.mimuw.edu.pl/MAS/FAMAS2009/]]
''Papers on Epistemology, Philosophy of Information and Philosophy of Science''\n\n*A. Baltag and S. Smets, "The Dynamic Turn in Quantum Logic", Synthese, 186(3), 2012. [[Online at Springer|http://www.springerlink.com/content/k03425t3567175wg/]]\n*A. Baltag and S. Smets. [[ "Keep changing your beliefs and aiming for the truth"|http://www.vub.ac.be/CLWF/SS/FILEforBRTA4.pdf]], In T. Kuipers and G. Schurz (eds.), Erkenntnis, Workingpaper submitted. To appear in T. Kuipers and G. Schurz (eds.), //Erkenntniss//, 2010.\n*A. Baltag and S. Smets. [[“Quantum Logic as a Dynamic Logic"|http://www.vub.ac.be/CLWF/SS/BethPaper_Final.pdf]]. In: Theo Kuipers, Johan van Benthem and Henk Visser (eds.), //Synthese//, special issue. Online First October 2010.\n*A. Baltag, H. P. van Ditmarsch and L.S. Moss. [["Epistemic logic and information update"|http://www.vub.ac.be/CLWF/SS/DELhandbookarticle.pdf]]. Invited contribution to the //Handbook of Philosophy of Information// (Editors: P. Adriaans and J. van Benthem) in the series //Handbook of Philosophy of Science// (General Editors: D. Gabbay, P. Thagard, J. Woods), vol. 8, pp. 361-455, Elsevier, 2008. \n*A. Baltag, "An Interview on Epistemology" // in Vincent F. Hendricks (Editor), Duncan Pritchard (Editors), [[Epistemology: 5 Questions|http://www.vub.ac.be/CLWF/SS/baltagfivequestions.pdf]]//, Automatic Press/VIP, 2008.\n*A. Baltag and S. Smets. [["A dynamic - logical perspective on quantum behavior"|http://www.vub.ac.be/CLWF/SS/SL.pdf]]. L. Horsten and I. Douver (eds.), //Studia Logica// (Special Issue on ESF Exploratory Workshop on "Applied Logic in the Methodology of Science"), vol. 89: 185-209, 2008. \n*A. Baltag and S. Smets. [["What Can Logic Learn from Quantum Mechanics?"|http://www.vub.ac.be/CLWF/SS/ECAP.pdf]] (Extended Abstract) //Proceedings of ECAP 5// (5th European Congress for Analytic Philosophy), Lisbon, 2005.
function setFooter() {\n if (document.getElementById && document.getElementById("contentFooter") ) {\n var windowHeight=findWindowHeight();\n if (windowHeight>0) {\n var contentHeight= document.getElementById('mainMenu').offsetHeight + document.getElementById("header").offsetHeight + document.getElementById("contentFooter").offsetHeight;\n var menu= document.getElementById('mainMenu');\n //var footerHeight=footerElement.offsetHeight;\n if (windowHeight-(contentHeight)>=0) {\n menu.style.position='relative';\n menu.style.marginBottom=(windowHeight-(contentHeight))+'px';\n }\n else {\n menu.style.position='';\n menu.style.marginBottom='';\n }\n }\n }\n}\nwindow.onresize = function() {\n setFooter();\n}\n\nStory.prototype.refreshTiddler_footerhack=Story.prototype.refreshTiddler;\nStory.prototype.refreshTiddler = function (title,template,force)\n{ \nvar theTiddler = Story.prototype.refreshTiddler_footerhack.apply(this,arguments);\nsetFooter();\n return theTiddler;}
''Papers on Games''\n\n*A. Baltag, S. Smets and J. A. Zvesper.[["Keep ‘hoping’ for rationality: a solution to the backward induction paradox"|http://www.springerlink.com/content/70536q6t155r3234/]]. In: //Synthese//. Volume 169, Number 2 / July, pp. 301-333, 2009\n*A. Baltag, S. Smets and J.A. Zvesper. "Keep 'Hoping' for rationality: A solution to the backward induction paradox." In L. Kurzen and F. Velazquez- Quesada (eds.), Dynamics Yearbook 2008, Seminar: Logics for Dynamics of Information and Preferences, pp.84-123, 2008.\n*A. Baltag, S. Smets and J. Zvesper, [["When all is done but not (yet) said: Dynamic rationality in extensive games"|http://ai.stanford.edu/~epacuit/LaII/proceedings.html]]. In J. van Benthem and E. Pacuit (eds.), //Proceedings of the Workshop on Logic and Intelligent Interaction//, ESSLLI 2008, pp.58-73, 2008. \n*A. Baltag. "A Logic for Suspicious Players: Epistemic Actions and Belief Update in Games". //[[Bulletin of Economic Research, 54 (1): 1-46, 2002|http://www.vub.ac.be/CLWF/SS/BER.pdf]]//. [[Abstract|http://ideas.repec.org/a/bla/buecrs/v54y2002i1p1-45.html]]\n\n''Editorial Work''\n\n*A. Baltag, M. Pauly (eds.). "Proceedings of the ILLC Workshop on Logic and Games" (Amsterdam, November 19-20, 1999). \n
To get started with this blank TiddlyWiki, you'll need to modify the following tiddlers:\n* SiteTitle & SiteSubtitle: The title and subtitle of the site, as shown above (after saving, they will also appear in the browser title bar)\n* MainMenu: The menu (usually on the left)\n* DefaultTiddlers: Contains the names of the tiddlers that you want to appear when the TiddlyWiki is opened\nYou'll also need to enter your username for signing your edits: <<option txtUserName>>
INFO
Under Construction
//{{{\nconfig.macros.def ={};\nconfig.macros.def.handler = function(place,macroName,params,wikifier,paramString,tiddler)\n{\n var sliceName = params[1]? params[1].toLowerCase() : params[0].toLowerCase();\n var def = store.getTiddlerSlice("InfoDefinitions",sliceName);\n if (def == undefined)\n {\n wikify(params[0],place);\n return false;\n }\n var theClass = params[2]? params[2] : "info";\n var container = createTiddlyElement(place,"span",null,theClass);\n wikify(params[0],container);\n if (document.all)\n {\n container.onmouseover = function(){addClass(this,"infoover");};\n container.onmouseout = function(){removeClass(this,"infoover");};\n }\n var tooltip = createTiddlyElement(container,"span",null,null);\n wikify(def, tooltip);\n\n}\n\nconfig.macros.note ={};\nconfig.macros.note.handler = function(place,macroName,params,wikifier,paramString,tiddler)\n{\n var sliceName = params[1]? params[1].toLowerCase() : params[0].toLowerCase();\n var def = store.getTiddlerSlice("InfoDefinitions",sliceName);\n if (def == undefined)\n {\n wikify(params[0],place);\n return false;\n }\n var theClass = params[2]? params[2] : "note";\n var container = createTiddlyElement(place,"span",null,theClass);\n wikify("^^"+params[0]+"^^",container);\n if (document.all)\n {\n container.onmouseover = function(){addClass(this,"noteover");};\n container.onmouseout = function(){removeClass(this,"noteover");};\n }\n var tooltip = createTiddlyElement(container,"span",null,null);\n wikify(def, tooltip);\n\n}\n\n//}}}\n
@@color(red):__''INTRODUCTION TO MODAL LOGIC 2011''__@@\n(Autumn 2011, ILLC, University of Amsterdam)\n\n@@color(blue):__''VERY IMPORTANT NOTE''__:@@ @@color(red): ''PLEASE PRESS THE `REFRESH' BUTTON __EVERY TIME__ YOU ACCESS THIS PAGE!!!''@@\n''Otherwise you will still see the old content (although the page IS periodically updated!).''\n\n\n__''Time''__\n\n\nTuesdays and Wednesdays 15:00-17:00.\n\n\n__''Place''__\n\nIn the second part of the term, the lectures and classes will take place in ''room C1.112''\n in Science Park (EXCEPT for December 14, when the room will be G2.10)\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistant (and Marker)''__\n\nYURII KHOMSKII\n\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures or in exercise classes, please email them to my assistant Yurii Khomskii\nat //yurii@deds.nl// or come to see him during his office hourse on Mondays 10:00-14:00 in C-3.119N.\n\nIn case he cannot answer a question, please email me at //TheAlexandruBaltag@gmail.com// and, if necessary, make an appointment to see me.\n\n\n__''Objectives of Course''__\n\nTo learn to understand the basic techniques of modal logic and its most important applications.\n\n__''Contents''__\n\nThe course covers the basic notions of modal logic: syntax, relational semantics, models and frames, bisimulations, model theoretic and frame theoretic constructions, completeness. More advanced topics include expressive power and intelligent agency.\n\n\n__''Recommended prior knowledge''__\n\nKnowledge of first order logic (syntax and semantics) and elementary mathematical knowledge and skills.\n\n__''Registration at''__\n\nRegistration via Studieweb before 8 August 2011 is mandatory.\n\n__''Format''__\n\nLectures and exercise classes.\n\n__''Study materials''__\n\nThe ''main textbook'', to be referred as ''BRV'', is\n\nPatrick Blackburn, Maarten de Rijke and Yde Venema, ''Modal Logic'', Cambridge University Press, 2002\n\n\nIn addition, I may sometimes use material, referred to as ''JVB'', from \n\nJohan Van Benthem, ''Modal Logic for Open Minds'', CSLI Publications, Stanford, 2010.\n\n\n__''Assessment''__\n\nMidterm take-home work, and a final exam. The final mark is determined only on the basis of these two.\n\n__''Collaboration''__\n\n''No'' collaboration between students is allowed in the midterm take-home exam or the final exam. If two exam papers are too similar, then they will both receive a failing grade. \n\nIn the interest of receiving accurate feedback, the students are advised not to collaborate on solving the weekly exercises either.\n\n__''Exercise Classes''__\n\nFrom time to time, at intervals of either one or two weeks (depending on the material), there will be exercise classes (on some Wednesdays, instead of the lecture), to be announced in advance on this page. During exercise classes, the assistant will discuss with the students the solutions to the optional (weekly) homework exercises (see below) and (time-permitting) to other exercises.\n\n\n__''COURSE PLAN''__\n\n*WEEK 1 (September 6,7): ''Basic Concepts'' (Chapter 1 from ''BRV'')\n\nSUMMARY OF WEEK 1: This week we covered operations on relations (union, composition, iteration; intersection, converse; diagonal of a set; diamond and box of a set along a relation), modal languages (Basic Modal Logic, general modal logics for a given modal signature, temporal logic, Propositional Dynamic Logic, Arrow Logic), models and frames: essentially, sections 1.1.,1.2 and part of 1.3 from ''BRV'' and some additional material.\n\n\n*WEEKS 2,3 (September 13,14,20,21): ''Models'' (Chapter 2 from ''BRV'')\n\nSUMMARY OF WEEK 2: We finished 1.3., and covered sections 1.5 and 1.6 from ''BRV''. (We'll skip 1.4 and 1.7.) \nThen we went to chapter 2, covering large parts of 2.1: Disjoint Unions of Models, Generated Submodels and the corresponding Invariance results.\n\nSUMMARY OF WEEK 3 is: \nWe finished 2.1 (covering Bounded Morphisms). We covered 2.2,2.4, and the first half of 2.5 (proving that m-saturation implies the Hennessy-Milner property, but NOT covering ultrafilter extensions). \n(We also skipped 2.3.)\n\n*WEEK 4 : \nSeptember 27:// no lecture//; \nSeptember 28: //exercise class//.\n\n*WEEK 5 (October 4,5): ''Finite Model Property and Van Benthem's Modal Characterization Theorem''\n\n\nSUMMARY OF WEEK 5 is: We covered section 2.3 of ''BRV'' (Finite Model Property and Strong Finite Model Property, the Selection method, n-bisimulation, the Filtration method), explaining how these results imply the decidability of (basic) modal logic. We presented some related material not in the book, such as the games for bisimulation and n-bisimulations. We started the proof of the Van Benthem Characterization (section 2.6 of ''BRV'', and also section 25.1 in ''JVB''), defining elementary extensions and omega-saturation, and proving that every model has an elementary extension which is omega-saturated. (This is part of the proof of Lemma 2.66 in ''BRV'', and more precisely the proof of the ''Fact'' on page 294 of ''JVB''.)\n\n\n*WEEK 6 (October 11,12): ''Strong Completeness and Canonicity''\n\nSUMMARY OF WEEK 6: In the first hour, finished the proof of Van Benthem's Theorem (i.e. section 25.1 in ''JVB'', or the first half of section 2.6 of ''BRV''). Then we proceeded to Chapter 4 of ''BRV'', covering sections 4.1 (Preliminaries') and 4.2 (Canonical Models).\n\n\n*WEEK 7 (October 18,19): ''Canonicity''\n\nSUMMARY: We presented section 4.3 (``Aplications") of ''BRV''.\n\nOctober 19: //exercise class//.\n\n*WEEK 8: //Mid-term Break//, with ''Take Home Exam''.\n\n*WEEK 9 (November 1,2): ''Completeness for PDL''.\n\nSUMMARY: We presented section 4.8 of ''BRV'' (Finitary Methods) and other types of completeness proofs.\n\n*WEEK 10: \nNovember 8: //external lecture// (Johan van Benthem); \nNovember 9: //exercise class//\n\n*WEEK 11 (November 15,16) ''Frame Definability and Correspondence Theory'' \n\nSUMMARY: We presented sections 3.1,3.2 from ''BRV'' , then moved to sections 3.5 and 3.6 from ''BRV''.\n\n*WEEK 12:\n\nNovember 22://NO LECTURE!//\nNovember 23: //EXERCISE CLASS//\n\n \n\n*WEEK 13 (November 29,30):\n ''Decidability and Complexity'' (Chapter 6 from ''BRV'')\n\nSUMMARY: We presented sections 6.1,6.2, 6.3, from ''BRV'' (on decidability) and section 6.5. from ''BRV'' (on undecidability via tiling.)\n\n*WEEK 14 (December 6,7): ''Various advanced topics '': \n \nDecember 6: //Applications to philosophical logic//' (epistemic logic, dynamic epistemic logic, conditional logic etc),\nsee chapters 12,13,15 and 23 from ''JVB''.\n\nDecember 7://EXERCISE CLASS//\n\n*WEEK 15 (December 13,14): ''More advanced topics and course review'': \n\nDecember 13: //More applications to epistemology.//\n CLICK [[HERE|http://www.vub.ac.be/CLWF/SS/DELminicourse.pdf]] for the slides of the material presented in week 14 and 15.\n\nDecember 14: //COURSE REVIEW (exercise class)//\n\n*WEEK 16: ''FINAL EXAM'': It will be a take-home exam, due on December 23, at noon. See details below.\n\n\n
@@color(red):__''INTRODUCTION TO MODAL LOGIC 2012''__@@\n(Autumn 2012, ILLC, University of Amsterdam)\n\n@@color(blue):__''VERY IMPORTANT NOTE''__:@@ @@color(red): ''PLEASE PRESS THE `REFRESH' BUTTON __EVERY TIME__ YOU ACCESS THIS PAGE!!!''@@\n''Otherwise you will still see the old content (although the page IS periodically updated!).''\n\n\n__''Time''__\n\n\n''Lectures'': Tuesdays 15:00-17:00, and ''some'' Wednesdays 15:00-17:00.\n\n''Classes'': ''some'' (but NOT all) Wednesdays 15:00-17:00\n\n__''Place''__\n\nBoth the lectures and classes will take place in ''room C1.112'' in Science Park.\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistant (and Marker)''__\n\nJORT BERGFELD\n\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures or in exercise classes, please come to see my assistant Jort Bergfeld during his office hours on Mondays 14:00-16:00 and on Thursdays 10:30-12:30 in his office (room C3.119L in Science Park). \n\nAlternatively, you can email him your questions (or to ask for an appointment) at\n//jort.bergfeld@gmail.com// \n\nIn case he cannot answer a question, please email me at //TheAlexandruBaltag@gmail.com// and, if necessary, make an appointment to see me.\n\n\n__''Objectives of Course''__\n\nTo understand the basic techniques of modal logic and its most important applications.\n\n__''Contents''__\n\nThe course covers the basic notions of modal logic: syntax, relational semantics, models and frames, bisimulations, model theoretic and frame theoretic constructions, completeness. More advanced topics include expressive power and intelligent agency.\n\n\n__''Recommended prior knowledge''__\n\nKnowledge of first order logic (syntax and semantics) and elementary mathematical knowledge and skills.\n\n__''Registration at''__\n\nRegistration via Studieweb is mandatory.\n\n__''Format''__\n\nLectures and exercise classes.\n\n__''Study materials''__\n\nThe ''main textbook'', to be referred as ''BRV'', is\n\nPatrick Blackburn, Maarten de Rijke and Yde Venema, ''Modal Logic'', Cambridge University Press, 2002\n\n\nIn addition, I will sometimes use material, referred to as ''JVB'', from \n\nJohan Van Benthem, ''Modal Logic for Open Minds'', CSLI Publications, Stanford, 2010.\n\nBesides this, I may occasionally use additional material, in the form of slides, which will be made available on the website after the lecture.\n\n__''Assessment''__\n\nMidterm take-home work, and a final exam. The final mark is determined only on the basis of these two.\n\n__''Homeworks''__\n\nThere will be 3 or 4 homework exercise sets. The homework exercises are ''mandatory'': //without doing all of them,you cannot pass this course//.\nHowever, the homeworks' grades will NOT count towards the final grade: they are just meant as a feedback to the students.\n\n__''Collaboration''__\n\n''No'' collaboration between students is allowed in the midterm take-home exam or the final exam. If two exam papers are too similar, then they will both receive a failing grade. \n\nIn the interest of receiving accurate feedback, the students are advised not to collaborate on solving the weekly exercises either.\n\n__''Exercise Classes''__\n\nFrom time to time, at intervals of either one or two weeks (depending on the material), there will be exercise classes (on some Wednesdays, instead of the lecture), to be announced in advance on this page. During exercise classes, the assistant will present to the students the correct solutions to the homework exercises and (time-permitting) will discuss other exercises from the textbbook.\n\n\n\nThe following lecture plan is ''tentative''. Depending on time and students' requests, it may change. After each lecture, I will put here a summary of what material was actually covered in the lecture, and will update accordingly the plan for the subsequent lectures.\n\n__''COURSE PLAN''__\n\n*WEEK 1: ''Basic Concepts'' (Chapter 1 from ''BRV'', sections 1.2, 1.3., 1.4, 1.5, 1.6)\n\nSUMMARY: We cover most (though not all) material from sections 1.1, 1.2 and 1.3 from ''BRV'': relational structures; operations on relations (union, composition, iteration; intersection, converse; diagonal of a set); modal languages (Basic Modal Logic, general modal logics for a given modal signature, temporal logic); complexity of a modal formula; models and frames; satisfaction relation; special classes of frames/models: bidirectional ones etc\n\n\n*WEEK 2: ''Basic Concepts'' continued (sections 1.4, 1.5, 1.6) and ''Models'' (part of section 2.1)\n\nSUMMARY. Continue with Chapter 1: Propositional Dynamic Logic, Arrow Logic, global and local truth, validity, general frames, global and local consequence relations. \n\n__''HOMEWORK 1''__\n(due //Wednesday 19 September at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following exercises from ''BRV'':\n1.1.1 and 1.1.2 (from Section 1.1), 1.3.2 (a),(b),(d),(e),(f), 1.3.3 (a),(b), 1.3.5 and 1.3.6 (from Section 1.3).\n\nYou may return your answers either as a //hardcopy//, left in //Jort Bergfeld's mailbox// at ILLC or //brought to the exercise class// on Wednesday 19 September at 3:00 pm, or //electronically// by attaching it to an email sent (BEFORE Wednesday 19 September at 3:00 pm) to Jort at the address //jort.bergfeld@gmail.com//, with CC to myself at //TheAlexandruBaltag@gmail.com//.\n\n\n\n*WEEK 3: ''Models'' continued (Chapter 2 from ''BRV'', sections 2.1, 2.2, 2.4, part of 2.5)\n\n\nTUESDAY 18 September. SUMMARY. Finish Chapter 1: Normal modal logics. The minimal normal logic K.\n\nWEDNESDAY 19 September: EXERCISE CLASS! Jort will explain you the solutions to Homework 1.\n\n\n*WEEK 4 (Tuesday and Wednesday): PLAN: Do Chapter 2, sections 2.1 and 2.2. Operations with Models and Invariance Results: disjoint unions, generated submodels, bounded morphisms, bisimulations.\n\n\n__''HOMEWORK 2''__ \n(due //Wednesday 3 October at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following exercises from ''BRV'':\n1.4.2 (from Section 1.4), 1.5.3 (from Section 1.5), 1.6.1 (from Section 1.6), 2.1.1 and 2.1.2 (from section 2.1), 2.2.1 and 2.2.6 (from Section 2.2).\n\nPLEASE NOTE that, in some editions of the book, exercise 1.5.3 is wrongly stated, containing the phrase "let F the class of all frames". The correct formulation is "let M the class of all models". So, if you have the wrong edition, please replace F by M, and ``frames'' by ``models'' everywhere in this exercise!\n\nYou may return your answers either as a //hardcopy//, left in //Jort Bergfeld's mailbox// at ILLC or //brought to the exercise class// on Wednesday 3 October at 3:00 pm, or //electronically// by attaching it to an email sent to Jort at the address //jort.bergfeld@gmail.com//, with CC to myself at //TheAlexandruBaltag@gmail.com//.\n\n\n*WEEK 5. PLAN:\n\nTUESDAY 2 October: Continue Bisimulations (section 2.2): Hennessy-Milner Theorem; Bisimulation Game; Algebra of Bisimulations. Section 2.4: The Standard Translation. \n\n\nWEDNESDAY 3 October: EXERCISE CLASS! Jort will explain the solutions to Homework 2.\n\n\n\n\n__''HOMEWORK 3''__ \n(due //Wednesday 10 October at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following exercises from ''BRV'':\n2.2.7, 2.2.8 (from Section 2.2), 2.4.1 (from Section 2.4).\n\n\n*WEEK 6. PLAN: Finish sections 2.1 and 2.4.. Continue with sections 2.3 and 2.6, then move to Chapter 4.\n\nTUESDAY : Section 2.4: Standard translation using only two variables. Finish 2.1.: unraveling. Section 2.6 (very briefly summarized): Van Benthem's Modal Characterization Theorem. \n\n\nWEDNESDAY: ''Completeness '' (chapter 4 of ''BRV''): covering section 4.1 (Preliminaries').\n\n\n__''HOMEWORK 4''__ \n(due //Wednesday 17 October at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following exercises from ''BRV'':\n2.4.2, 2.4.3, 2.4.4, 2.4.6 (a) and (b).\n\n*WEEK 7: ''Canonicity''\n\nTUESDAY 16 October: We covered sections 4.1 and 4.2 (Canonicity) and just started section 4.3 (``Aplications") of ''BRV''.\n\nWEDNESDAY 17 October: EXERCISE CLASS. Jort will explain the solutions to HW3 and HW4, and (time-permitting) cover more material from section 4.3.\n\n.\n*WEEK 8: //Mid-term Break//, with ''Take Home Exam'':\n\n\n''MID TERM EXAM''\n(due //Wednesday 7 November at 3:00 pm//)\n\nPlease do the following exercises from BRV:\n\n1.4.6,\n1.6.3, \n2.1.5 (in its corrected version, please see below!)\n2.2.4 (Additional Hint: consider the formula U(q,p)),\n4.1.3,\n4.2.4,\n4.3.1,\n4.3.2.\n\n''IMPORTANT WARNING/CORRECTION CONCERNING EXERCISE 2.1.5'':\nExercise 2.1.5 was MISPRINTED in ALL editions, although in different creative ways in each edition. PLEASE CLICK [[HERE|http://www.vub.ac.be/CLWF/SS/exercise2.1.5.pdf]] FOR THE CORRECT VERSION OF EXERCISE 2.1.5. \n \n''PROCEDURE FOR RETURNING EXAM ANSWERS'': \nThey can be either handed to Jort at the start of the Wednesday (7 November) class, or else emailed to him BEFORE the deadline. The first option is the preferred one: if you DO come to class, please hand in written answers. But if you are unable to come to come to class that day, you may send it by email, in which case please ask for a confirmation of receipt of your email. Emails sent after 3:00 pm November 7 will NOT be taken into consideration as valid exam answers!\n\n''NEW: OTHER CORRECTIONS/EXPLANATIONS OF EXAM QUESTIONS'':\n\na) In ''Exercise 4.1.3'', the definition of infimum contains a small typo: the line before last line should read \sLambda' \ssubseteq \sLambda, so that \sLambda becomes the greatest lower bound. \n\nb) In ''Exercise 4.2.4'' you are asked to prove the Truth Lemma and the Canonical Model Theorem for languages of arbitrary similarity type. My interpretation of this is that the whole canonical model construction should be done for arbitrary similarity types: first, define (the analogue of) canonical models (for arbitrary types); then, prove their properties (i.e. analogues of Lemma 4.19, the Existence Lemma, the Truth r Lemma and the Canonical Model Theorem for arbitrary types). Well, I guess you may skip the proof of (the analogue of) Lemma 4.19, since it is trivial (but that lemma should be explicitly stated for arbitrary types, before being used to prove the Existence Lemma).\n\n\n*WEEK 9: '' Canonicity, Finite Model Property, Selection Method'' \n\nTUESDAY: Finish 4.3, cover 4.5.\n\nWEDNESDAY: We went back and started Section 2.3 (Finite Model Property and Strong Finite Model Property. N-bisimulation. The Selection Method. Weak completeness with respect to finite models, tree models, finite tree models.).\n\n\n*WEEK 10 (6 November): '' Filtration Method'' \n\nTUESDAY 6 November: We finished section 2.3 (Filtrations).\n\nWEDNESDAY 7 November: EXERCISE CLASS. Jort explained the solutions to the mid-term exam.\n\n\n__''HOMEWORK 5''__ \n(due //Wednesday 14 November at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following exercises from ''BRV'':\n2.3.5, 2.3.6, 2.3.7, 4.3.4. (NOTE: In 4.3.4, a relation R is said to have the Church-Rosser property if, for all states x,y,z we have that: xRy and xRz imply that there exists a state w such that yRw and zRw.)\n\n*WEEK 11: ''Completeness via Finite Models''\n\nCONTENT: We covered section 4.8 of ''BRV'' (completeness proof for PDL).\n\n\n__''HOMEWORK 6''__ \n(due //Wednesday 21 November at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following exercises from ''BRV'':\n4.8.2, 4.8.6, 4.8.7, 4.8.8.\n''PLEASE NOTE'' that in some editions of the book there is a typo in (the last sentence of the Hint) in exercise 4.8.7: you are (wrongly) asked to make use of the fact that the formula \nBox Box phi -> Box phi is provable in GL (and promised a bonus point if you prove this yourself), but what is meant is actually the formula Box phi -> Box Box phi. So please replace the wrong formula above by this last formula. \n''ALSO NOTE'' that, in 4.8.6., PDL with tests is just the extension of PDL that allows for test programs. The syntax of this logic is described in section 1.2 of ''BRV'' (Example 1.15, on pages 12-13) and the semantics on regular models in section 1.3 (Example 1.26, pages 22-23). The axiomatic system is not given, but it obviously all the axioms of PDL without test, i.e. all the axioms of the logic in definition 4.78. However, you need to add one more axiom, that deals with the diamond for test programs, capturing their behavior in the sane way in which, say, the composition axiom captures the behavior of programs obtained by composition. Part of this exercise is to find this axiom yourself, and then ''sketch'' the proof of weak completeness. \n ''WARNING '': Do NOT spend much time trying to prove the //Bonus point// part of exercise 4.8.7. Proving it purely axiomatically is a very tricky, tedious derivation of no deeper significance and no relevance to this course!\n\n*WEEK 12: ''Decidability and Complexity'' (Chapter 6 from ''BRV'')\n\nTUESDAY: PLAN: We will cover sections 6.1 and section 6.3 from ''BRV'' (on decidability via interpretations).\n\nWEDNESDAY: Exercise Class. Jort will explain the solutions to Homeworks 5 and 6.\n\n\n*WEEK 13: ''Decidability, Undecidability and Correspondence Theory'' (Chapter 6 from ''BRV', and Chapter 3 from ''BRV', )\n\nTUESDAY: We will cover section 6.2 (decidability via finite model property) and then section 6.5. from ''BRV'' (on undecidability via tiling).\n\nWEDNEDSDAY: We cover sections 3.1, 3.2 and part of 3.5 (on correspondence theory)\n\n__''HOMEWORK 7''__ \n(due //Wednesday 4 November at 3:00 pm//)\n\n//Please type in capital letters on the first page of your answers the following//: your full name (both first name and family name), and your program (MoL, BSc in Math etc).\n\nPlease do the following two exercises from ''BRV'':\n6.3.3 and 6.5.1 \n\n\n*WEEK 14: ''Advanced Topics and Course Review''\n\nTUESDAY: We cover section 3.6 (on Sahlquist formulas) and (time-permitting) provide a brief course review\n\nWEDNESDAY: Exercise Class. Jort will explain the solutions to Homework 7.\n\nWEEKS 15,16: *''FINAL EXAM'': \nTAKE-HOME exam, to be given in week 14 (on December 3), due December 23. Details to follow. \n\n''FINAL EXAM'' (due 23 December):\nPlease click [[HERE|http://www.vub.ac.be/CLWF/SS/exam2012-13.pdf]] for the questions of the final exam. ''IMPORTANT NOTE'' (made on 04/12/12 at 20:41): In the initial version, question 11 was mistyped (as exercise 4.8.6 from ''BRV''), when the correct question is exercise 4.8.4. The file available at the above link has now been corrected, so please download now the corrected version.\n
@@color(red):__''INTRODUCTION TO MODAL LOGIC 2013''__@@\n(Autumn 2013, ILLC, University of Amsterdam)\n\n\n@@color(blue):__''VERY IMPORTANT NOTE''__:@@ @@color(red): ''PLEASE PRESS THE `REFRESH' BUTTON __EVERY TIME__ YOU ACCESS THIS PAGE!!!''@@\n''Otherwise you will still see the old content (although the page IS periodically updated!).''\n\n\n__''Time''__\n\n\n''Lectures'': Wednesdays 13:00-15:00, and ''some'' Wednesdays 17:00-19:00.\n\n''Tutorial Classes'': ''some'' (but NOT all) Wednesdays 17:00-19:00\n\n__''Place''__\n\n''room B0.201'' in Science Park.\n\n\n__''Instructor''__\n\nALEXANDRU BALTAG (Email //TheAlexandruBaltag@gmail.com//)\n\n__''Teaching Assistants (and Markers)''__\n\n\nFACUNDO CARREIRO \n(Email //fcarreiro@dc.uba.ar//, Website [[http: glyc.dc.uba.ar/facu/| http://glyc.dc.uba.ar/facu/ ]]\nGIOVANNI CINA \n(Email //giovanni.cina88@gmail.com//)\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures or in exercise classes, please come to see my assistants Facundo and/or Giovanni. Alternatively, you can email them your questions (or to ask for an appointment) at the above email addresses (with CC to me).\n\nIn case he cannot answer a question, please email me at //TheAlexandruBaltag@gmail.com// and, if necessary, make an appointment to see me.\n\n\n__''Objectives of Course''__\n\nTo understand the basic techniques of modal logic and its most important applications.\n\n__''Contents''__\n\nThe course covers the basic notions of modal logic: syntax, relational semantics, models and frames, bisimulations, model theoretic and frame theoretic constructions, completeness. More advanced topics include expressive power and intelligent agency.\n\n\n__''Recommended prior knowledge''__\n\nKnowledge of first order logic (syntax and semantics) and elementary mathematical knowledge and skills.\n\n__''Registration at''__\n\nRegistration via Studieweb is mandatory.\n\n__''Format''__\n\nLectures and exercise classes.\n\n__''Study materials''__\n\nThe ''main textbook'', to be referred as ''BRV'', is\n\nPatrick Blackburn, Maarten de Rijke and Yde Venema, ''Modal Logic'', Cambridge University Press, 2002\n\n\nIn addition, I will sometimes use material, referred to as ''JVB'', from \n\nJohan Van Benthem, ''Modal Logic for Open Minds'', CSLI Publications, Stanford, 2010.\n\nBesides this, I may occasionally use additional material, in the form of slides, which will be made available on the website after the lecture.\n\n__''Assessment''__\n\nHomework exercises (20%), midterm take-home exam (40%), and final take-home exam (40%). \n\n__''Homeworks''__\n\nThere will be 3 or 4 homework exercise sets. In total, the homework will be worth 20% of the final grade.\n\n__''Collaboration''__\n\n''No'' collaboration between students is allowed in answering homeworks, the midterm take-home exam or the final exam. \n\n__''Tutorial Classes''__\n\nFrom time to time, at intervals of either one or two weeks (depending on the material), there will be exercise classes (on some Wednesdays, instead of the lecture), to be announced in advance on this page. During exercise classes, the assistant will present to the students the correct solutions to the homework exercises and (time-permitting) will discuss other exercises from the textbbook.\n\n\n__''Course Plan''__\nThe following lecture plan is ''tentative''. Depending on time and students' requests, it may change. After each lecture, I will put here a summary of what material was actually covered in the lecture, and will update accordingly the plan for the subsequent lectures.\n\n__''COURSE PLAN''__\n\n*WEEK 1 (4 September): ''Basic Concepts'' (Chapter 1 from ''BRV''): Today we actually covered sections 1.1, 1.2 and part of 1.3., 1.4, 1.5, 1.6)\n\n*WEEKS 2 (11 September): Finish Sections 1.3, and continue with sections 1.4, 1.5 and 1.6, Start ''Models'' (Chapter 2 from ''BRV'', section 2.1)\n\n__''HOMEWORK 1''__\n//due Wednesday 25 September by 1:00 pm. This deadline is sharp!//\nYou may return your answers preferably electronically, by emailing them to Facundo Carreiro at //fcarreiro@dc.uba.ar//, with CC to me (at TheAlexandruBaltag@gmail.com), or else bring hardcopies to the class at 1:00 pm, or else return hardcopies in Facundo's Carreiro's mailbox at ILLC.\n\nPlease do the following exercises from BRV:\n1.1.1 and 1.1.2 (from Section 1.1), 1.3.2 (a),(b),(d),(e),(f), 1.3.3 (a),(b), 1.3.5 and 1.3.6 (from Section 1.3), 1.5.3 (from Section 1.5) and 1.6.1 (from Section 1.6).\n\n@@color(red):''WARNING''@@: PLEASE NOTE that, in some editions of the book, exercise 1.5.3 is wrongly stated, containing the phrase "let F the class of all frames". The correct formulation is "let M the class of all models". So, if you have the wrong edition, please replace F by M, and ``frames'' by ``models'' everywhere in this exercise!\n\n\n*WEEKS 3 (18 September): ''Models'' (Chapter 2 from ''BRV''): Continue section 2.1, then go to 2.2 (Bisimulations).\n\n*WEEK 4 (Wednesday 25 September, ONLY 1:00-3:00): ''Models'' (Chapter 2 from ''BRV''): Finish section 2.2 (Hennessy-Milner Theorem, Bisimulation Game), continue with 2.4 (Standard Translation) and (very briefly) part of 2.6 (Van Benthem's Modal Characterization Theorem).\n\nWEDNESDAY (25 September) 5:00-7:00: WERKCOLLEGE (TUTORIAL CLASS): Facundo will present solutions to Homework 1.\n\n\n__''HOMEWORK 2''__\n//due Wednesday 16 October by 5:00 pm. This deadline is sharp!//\nYou may return your answers preferably electronically, by emailing them to Facundo Carreiro at //fcarreiro@dc.uba.ar//, with CC to me (at TheAlexandruBaltag@gmail.com), or else bring hardcopies to the lecture at 1:00 pm (and hand them to my replacement Joshua Sack, or else bring hardcopies to the tutorial class at 5:00 pm, or else return hardcopies in Facundo's Carreiro's mailbox at ILLC by 5:00 pm.\n\n\nPlease do the following exercises from BRV:\n2.1.1, 2.2.1, 2.2.6, 2.2.8, 2.4.1, 2.4.4, 4.1.4.\n\n\n@@color(red):''WARNING''@@: PLEASE NOTE that the material needed for doing the last two exercises will only be covered next week (on Wednesday 2 October). But in the meantime you can of course try the others!\n\n*WEEK 5 (2 October, 1:00-3:00 and 5:00-7:00): ''Completeness via the Canonical Model'': sections 4.1 and 4.2. \n\n\n*WEEK 6 (9 October, 1:00-3:00 and 5:00-7:00): ''Canonicity and Applications'': section 4.3 (``Applications") and starting 4.5\n\n*WEEK 7 (WEDNESDAY 16 October, LECTURE 1:00-3:00 only): ''Transforming the Canonical Model'': Finishing section 4.5.\n\n''WERKCOLLEGE (TUTORIAL CLASS)'' (WEDNESDAY, 16 October, 5:00-7:00): \nFacundo will present solutions to Homework 2. ''In addition, he will help you prepare for exam, by presenting solutions to a few exercises from section 4.3.''\n\n\n__''MID-TERM EXAM (Take-Home)''__\n//This is a take-home exam, that you may start working at any time, and it is due on 6 NOVEMBER at 13:00. This deadline is sharp.//\n\nPlease do the following exercises from BRV:\n\n1.6.3, \n2.1.5 (in its corrected version, please see below), \n2.2.4 (Additional Hint: consider the formula U(q,p)), \n4.1.3, \n4.3.2, \n4.3.3, \n4.3.6.\n\n\n''IMPORTANT WARNING/CORRECTION CONCERNING EXERCISE 2.1.5'':\nExercise 2.1.5 was MISPRINTED in ALL editions, although in different creative ways in each edition. PLEASE CLICK [[HERE|http://www.vub.ac.be/CLWF/SS/exercise2.1.5.pdf]] FOR THE CORRECT VERSION OF EXERCISE 2.1.5. \n\n\nAs with the homeworks, the exam can be either sent by email to Facundo Carreiro at //fcarreiro@dc.uba.ar//, with CC to me (at TheAlexandruBaltag@gmail.com), \nor else bring hardcopies to the class at 1:00 pm, or else return hardcopies in Facundo's Carreiro's mailbox at ILLC.\n\n@@color(red):''MORE CORRECTIONS (NEW!!!)''@@::\n\n(a) In ''Exercise 4.1.3'', there is a typo in the definition of the infimum. The correct definition is:\nAn ''infimum'' of a family of (normal modal) logics \sLambda_i (with i in I) \nis a (normal modal) logic \sLambda such that:\n(1) \sLamba is included in each \sLambda_i (for every i in I), and\n(2) for every other logic \sLambda' having property (1), we have that ''\sLambda' is included in \sLambda''.\n\n(This last bold-faced phrase was the one stated the other way around, i.e. wrong, in the book. Also, please note that to show the existence of the infimum, you have to construct \sLamba, show that it has properties (1) and (2), and show that it is a normal modal logic!)\n\n(b) In the //second part// of ''Exercise 4.3.3'', axioms for transitivity (in the case of K4.3) and for transitivity and reflexivity (in the case of S4.3) should be added!\n\n(c) In ''Exercise 4.3.6'', there is a typo in the definition of ''globally related frames''. The correct definition is: A frame (W,R) is ''globally related'' iff we have Rwv (i.e., to use a different notation wRv) for all worlds w and v in W.\n\n@@color(red):''HINT FOR EXERCISE 4.3.3''@@::\nFor the first part of 4.3.3: You need to use axiom .3 to show that the canonical model has no branching to the right. Assume towards a contradiction that there exist three (maximally consistent theories) w, u, v, such that wRu and wRv, but such that we DON'T have uRv, NOR vRu, NOR u=v. Take three sentences phi, psi and theta that witness the failure of the last three statements (e.g. theta is in v but (not-Diamond theta) is in u, etc). Write down everything that you can deduce as being true at u in one big conjunctive formula C, and everything that is true at v in one big formula D. Show that (Diamond C and Diamond D) is true at w, and then apply axiom .3 (with p substituted with C and q with D). Reach a contradiction by showing that each of the disjuncts in the conclusion of axiom .3 (with p and q substituted as above) is inconsistent.\n\n\n*WEEK 8: //Mid-term Break//:\n \n*WEEK 9 (30 October, 1:00-3:00 and 5:00-7:00): '' Finite Model Property, Selection and Filtration Methods''. Start Section 2.3 (Finite Model Property and Strong Finite Model Property. N-bisimulation. The Selection Method. Weak completeness with respect to finite models, tree models, finite tree models. Definition of filtrations).\n\n*WEEK 10 (6 November, 1:00-3:00 and 5:00-7:00 pm): '' Filtration, Finite Canonical Models and Completeness of Propositional Dynamic Logic''.Continue Section 2.3 (examples of filtrations, the Filtration Theorem, Finite Model Property Theorem, transitive filtration) and go on to Section 4.8 (completeness of PDL).\n\n__''HOMEWORK 3''__\n//due Wednesday 20 November by 5:00 pm. This deadline is sharp!//\nYou may return your answers preferably electronically, by emailing them to Giovanni Cina at //giovanni.cina88@gmail.com//, with CC to me (at TheAlexandruBaltag@gmail.com), or else bring hardcopies to the lecture at 1:00 pm, or else bring hardcopies to the tutorial class at 5:00 pm, or else return hardcopies in Giovanni Cina's mailbox at ILLC by 5:00 pm.\n\nPlease do the following exercises from BRV:\n2.3.5, 2.3.6, 2.3.7, 4.8.2, 4.8.3, 4.8.4.\n\n\n*WEEK 11 (13 November, 1:00-3:00 only): ''Completeness of PDL'': We finished Section 4.8. \n\n\n''WERKCOLLEGE (TUTORIAL CLASS)'' (13 November, 5:00-7:00): \nGiovanni will present solutions to Mid-Term Exam.\n\n\n*WEEK 12 (20 November, 1:00-3:00 only): ''Decidability'' (Chapter 6 from ''BRV''): Sections 6.1 and section 6.2 from ''BRV'' (on decidability via finite models). \n\n\n\n''WERKCOLLEGE (TUTORIAL CLASS)'' (20 November, 5:00-7:00): \nGiovanni will present solutions to Homework 3.\n\n\n\n__''HOMEWORK 4''__\n//due Wednesday 4 December by 5:00 pm. This deadline is sharp!//\nYou may return your answers preferably electronically, by emailing them to Giovanni Cina at //giovanni.cina88@gmail.com//, with CC to me (at TheAlexandruBaltag@gmail.com), or else bring hardcopies to the lecture at 1:00 pm, or else bring hardcopies to the tutorial class at 5:00 pm, or else return hardcopies in Giovanni Cina's mailbox at ILLC by 5:00 pm.\n\nPlease do the following exercises from ''BRV'' (after first taking a look at the corrections and warnings below):\n4.8.6, 4.8.7, 4.8.8, 6.2.1.\n\n''PLEASE NOTE'' that in some editions of the book there is a typo in (the last sentence of the Hint) in exercise 4.8.7: you are (wrongly) asked to make use of the fact that the formula \nBox Box phi -> Box phi is provable in GL (and promised a bonus point if you prove this yourself), but what is meant is actually the formula Box phi -> Box Box phi. So please replace the wrong formula above by this last formula. \n''ALSO NOTE'' that, in 4.8.6., PDL with tests is just the extension of PDL that allows for test programs. The syntax of this logic is described in section 1.2 of ''BRV'' (Example 1.15, on pages 12-13) and the semantics on regular models in section 1.3 (Example 1.26, pages 22-23). The axiomatic system is not given, but it obviously all the axioms of PDL without test, i.e. all the axioms of the logic in definition 4.78. However, you need to add one more axiom, that deals with the diamond for test programs, capturing their behavior in the sane way in which, say, the composition axiom captures the behavior of programs obtained by composition. Part of this exercise is to find this axiom yourself, and then ''sketch'' the proof of weak completeness. \n ''WARNING '': Do NOT spend much time trying to prove the //Bonus point// part of exercise 4.8.7. Proving it purely axiomatically is a very tricky, tedious derivation of no deeper significance and no relevance to this course!\n\n\n\n*WEEK 13 (27 November,Con 1:00-3:00 only) ''Decidability and Undecidability'' : Do Section 6.3 (decidability via interpretations), and start Section 6.5. from ''BRV'' (on undecidability via tiling). \n\n5:00-7:00: NO CLASS.\n\n\n\n*WEEK 14 (4 December, 1:00-3:00 only): ''Undecidability and Correspondence Theory'': \nFinish Section 6.5, and briefly summarize Sections 3.1 and 3.2 (the basics of Correspondence Theory).\n\n\n''WERKCOLLEGE (TUTORIAL CLASS)'' (4 December, 5:00-7:00): \nGiovanni will present solutions to Homework 4..\n\n\n''FINAL EXAM'' (take-home: please return either hardcopies due //December 20// at 17:00, or electronic submissions due //December 27// at 17:00). If sending electronic submissions (via email), please send pdf's of typed text, or else clearly visible scans of legible handwritten text. (Please check its readability by sending a CC to yourself, and trying to read the version you received!)\n\nClick [[HERE|http://www.vub.ac.be/CLWF/SS/exam2013-14.pdf]] for the questions of the final exam. NOTE that the deadline mentioned in the attached file refers only to submissions of hardcopies (20 December), but as mentioned above electronic versions can still be sent by 27 December.
''Invited Keynote Lectures at International Conferences and Meetings''\n\n*The Synthese Conference on ``Epistemology and Economics", Columbia University, New York 15-16 April 2010.\n* The Workshop on ``Formal Models of Norm Change 2", University of Amsterdam, 18-19 January 2010.\n*The Workshop “Alternative Approaches to Belief Change”, part of ISLA 2010 (the Third Indian School on Logic and its Applications), university of Hyderabad, Gachibowli, India, January 2010.\n*Workshop on //"Logical methods for social concepts (LMSC'09)"//, part of European Summer School on Logic, Language and Information ESSLLI 2009, 20-25 July, France, Bordeaux 2009.\n*Workshop on //"Quantum Logic Inspired by Quantum Computation"//, Indiana University, Bloomington 11-12 Mei, 2009. \n*The Workshop on “Logic and Social Interaction”, part of ICLA 2009 (The Third Indian Conference on Logic and its Applications), Chennai, India, January 2009.\n*Studia Logica International Conference on //``Logic and the foundations of physics: space, time and quanta" (Trends in Logic VI)//. Brussels, Belgium, 11-12 December 2008.\n*International Colloquium on //``Logic of change, change of logic"//. Prague, Czech Republic, 10-14 September 2008.\n*1st European Workshop on //Correlations in Computer Science//. Vielsalm, Belgium, 6-7 August 2008.\n*International Workshop //``Epistemology Meets Logic,Informally"//. Stanford University, May 31- June 1, 2008.\n*Workshop on //Decisions and Games//. Indiana University, Bloomington, Indiana. May 2008.\n*The 15th Workshop on //Games in Logic, Language and Computation// (GLLC - 15). University of Amsterdam, Amsterdam, The Netherlands. February, 2008.\n*International Symposium on //Logic and Physics//, Utrecht University, Utrecht, The Netherlands. January 2008.\n*The First International Workshop on the //Philosophy of Information and Logic// (PIL'07). Oxford University, Oxford, United Kingdom. 3-4 November 2007.\n*International Dagstuhl Seminar on //Formal Models of Belief Change in Rational Agents// (Dagstuhl Seminar no. 07351). Dagstuhl, Germany. 26-30 August 2007.\n*International Workshop on //Logic, Rationality and Interaction// (LORI'07). Beijing, China. 5-9 August 2007.\n*International conference on //Dynamic Logics for Social Agents: new trends in Philosophical research//. Montreal, Canada. 19-22 June 2007.\n*International Colloquim on //New Perspectives on Games and Interaction//. Netherlands' Royal Academy of Sciences, Amsterdam, The Netherlands. 5-7 January 2007.\n*International Colloquim on //Games, Action and Social Software//. Lorentz Center, Leiden University, Leiden, The Netherlands. 30 Oct.-3 Nov. 2006.\n*International Workshop on //Modal Logic, Stone Duality and Coalgebras//. Leicester University, Leicester, UK. 12-13 June 2006.\n*Series of invited lectures at the Workshop on //Quantum Information, Computation and Logic:\nExploring New Connections// (QICL'05). Perimeter Institute for Theoretical Physics, Waterloo, Ontario, Canada. July 2005.\n*Workshop on //Philosophical Logic meets Mathematical Logic: from Classical to Quantum// (PML'04), Free University of Brussels, Brussels, 5-7 February 2004.\n* //Seminar on Logic and Informatics// (SLI - 2003), Free University of Brussels, Brussels, March 31, 2003.\n*//Second International Symposium on the Logic of Real - World Interactions// (LORWI'03) National Japan Institute of Informatics, Tokyo, March 17-18, 2003.\n*//Logic Colloquium// (LC 2003, the //main European Annual Meeting of the Association of Symbolic Logic//), Helsinki, Finland, August 2003.\n*The First Workshop on //Logic and Communication in Multi - Agent Systems// ( LCMAS 2003, a satellite of ICALP 2003), Eindhoven, The Netherlands, June 2003.\n*The 7th Workshop on //Games in Logic, Language and Computation// ( GLLC'7 ),University of Amsterdam, The Netherlands, November 28, 2002.\n*The //Euro Conference// on "Applications of Mathematical Logic in Philosophy and Linguistics" (Foundations of the Formal Sciences II), Bonn, Germany, Nov 10-13, 2000.\n*The First South African Summer School on //Logic, Universal Algebra and Theoretical Computer Science//, (LUATCS'99), Rand Afrikaans University, Johannesburg, South Africa, December 1999. Series of Invited Lectures.
/***\n|''Name:''|LegacyStrikeThroughPlugin|\n|''Description:''|Support for legacy (pre 2.1) strike through formatting|\n|''Version:''|1.0.1|\n|''Date:''|Jul 21, 2006|\n|''Source:''|http://www.tiddlywiki.com/#LegacyStrikeThroughPlugin|\n|''Author:''|MartinBudden (mjbudden (at) gmail (dot) com)|\n|''License:''|[[BSD open source license]]|\n|''CoreVersion:''|2.1.0|\n|''Browser:''|Firefox 1.0.4+; Firefox 1.5; InternetExplorer 6.0|\n\n***/\n\n//{{{\n\n// Ensure that the LegacyStrikeThrough Plugin is only installed once.\nif(!version.extensions.LegacyStrikeThroughPlugin)\n {\n version.extensions.LegacyStrikeThroughPlugin = true;\n\nconfig.formatters.push(\n{\n name: "legacyStrikeByChar",\n match: "==",\n termRegExp: /(==)/mg,\n element: "strike",\n handler: config.formatterHelpers.createElementAndWikify\n});\n\n} // end of "install only once"\n//}}}\n
''Papers on Logics for Communication, Information Update and Multi -Agent Belief Revision''\n\n*A. Baltag, B. Renne and S. Smets. [[The Logic of Justified Belief, Explicit Knowledge and Conclusive Evidence|http://www.vub.ac.be/CLWF/SS/brs-ConclusiveEvidence.pdf]]. To appear in APAL, 2013.\n*A. Baltag, N. Bezhanishvili, A. Ozgun, S. Smets. [[The Topology of Belief, Belief Revision and Defeasible Knowledge|http://www.vub.ac.be/CLWF/SS/TOPOLOGY.pdf]]. Proceedings of the LORI conference, 2013. In print.\n*A. Baltag, Z. Christoff, J.U. Hansen and S. Smets. [[Logical Models of Informational Cascades|http://www.vub.ac.be/CLWF/SS/CASCADES-COLLEGE.pdf]]. In Studies in Logic. College Publications, 2013.\n*A. Baltag, V. Fiutek and S. Smets. [[DDL as an “Internalization” of Dynamic Belief Revision|http://www.vub.ac.be/CLWF/SS/DDLfinalfinal.pdf]]. Invited contribution for the first volume in the series //Outstanding Contributions to Logic. Volume in honor of K. Segerberg, subseries of Trends in Logic //, Springer, 2012, in print.\n*A. Baltag and S. Smets, [[Protocols for Belief Merge: Reaching Agreement via Communication|http://www.vub.ac.be/CLWF/SS/baltagsmetsfamasjournalPUBLISHEDv4.pdf]], //Logic Journal of the IGPL //, in print.\n*A. Baltag, B. Rodenhaeuser and S. Smets. Doxastic Attitudes as Belief Revision Policies. Online [[pre-proceedings of LBP 2012|http://www.ninagierasimczuk.com/LBP2012/accepted.html]] (the //ESSLLI special Workshop on “Strategies for Learning, Belief revision and Preference change” //), Opole, Poland, August 2012.\n*A. Baltag, B. Renne and S. Smets. [[The Logic of Justified Belief Change, Soft Evidence and Defeasible Knowledge|http://bryan.renne.org/docs/brs-jbc-wollic2012.pdf]]. In //Lecture Notes in Computer Science //, Vol. 7456, pp. 168-190 (volume of the 19th Workshop on Logic, Language, Information and Computation), 2012.\n*A. Baltag and S. Smets. [["A Semantic View on Ramsey's Test|http://www.vub.ac.be/CLWF/SS/RamseyTestSmetsBaltagFinal.pdf]], Xabier Arrazola and Marıa Ponte (eds.) //Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication, and Action. //Log//KCA//-//10//, In Press, 2010.\n*A. Baltag and S. Smets.[["Talking Your Way into Agreement: Belief Merge by Persuasive Communication"|http://www.vub.ac.be/CLWF/SS/famaspaperCEURPROCEEDINGS.pdf]]. [[CEUR Workshop Proceedings|http://sunsite.informa, 2007.tik.rwth-aachen.de/Publications/CEUR-WS/Vol-494/]], Vol. 494, Proceedings of the Second Multi- Agent Logics, Languages, and Organisations Federated Workshops Turin, Italy, September 7-10, 2009. pp. 129 - 141. 2009\n*A. Baltag and S. Smets. [["Group Belief Dynamics under Iterated Revision: Fixed Points and Cycles of Joint Upgrades"|http://www.vub.ac.be/CLWF/SS/tark09final.pdf]]. In A. Heifetz (ed.) //Proceedings of Theoretical Aspects of Rationality and Knowledge TARK 2009//, pp. 41-50, 2009\n*A. Baltag and S. Smets, [["Learning by Questions and Answers: From Belief- Revision Cycles to Doxastic Fixed Points"|http://www.vub.ac.be/CLWF/SS/wollic2009postfinal.pdf]]. In: Makoto Kanazawa, Hiroakira Ono, en Ruy de Queiroz (eds.) //LNAI Lecture Notes in Computer Science//. pp. 124-139. Volume 5514. 2009\n*P. Balbiani, A. Baltag, H. van Ditmarsch, T. Hoshi and T. de Lima. "Arbitrary Announcement Logic". (Abstract of the 2007 annual conference of the Australasian Association for Logic). //The Bulletin of Symbolic Logic// 14(3), pp. 438-439, 2008.\n* P. Balbiani, A. Baltag, H. van Ditmarsch, A. Herzig, T. de Lima and T. Hoshi. "Knowable" as "known after and announcement". //Review of Symbolic Logic//, Vol. 1, nr.3, pp. 305-334, 2008.\n*A. Baltag and S. Smets. "Probabilistic Dynamic Belief Revision". in //Synthese//, Vol. 165, Nr 2, pp.179-202, 2008. [[Abstract|http://www.springerlink.com/content/au10h11601g815u4/?p=decb51997cad48a9bb6c7774dd82abd9&pi=2]]\n*A. Baltag and S. Smets. [["The Logic of Conditional Doxastic Actions"|http://www.vub.ac.be/CLWF/SS/action.pdf]]. In R. van Rooij and K. Apt (eds.), //Texts in Logic and Games//, Special Issue on New Perspectives on Games and Interaction, Volume 4, pp. 9–31, Amsterdam University Press, 2008. \n*A. Baltag and S. Smets. [["A Qualitative Theory of Dynamic Interactive Belief Revision"|http://www.vub.ac.be/CLWF/SS/Ch1-Baltag.pdf]]. in G. Bonanno, W. van der Hoek, M. Woolridge (eds.), //Texts in Logic and Games//, Vol 3, pp.9-58, Amsterdam University Press, 2008. \n*A. Baltag, B. Coecke and M. Sadrzadeh. [["Epistemic Actions as Resources"|http://http://www.pps.jussieu.fr/~mehrs/JLC2.pdf]] // Journal of Logic and Computation// 17 (3): 555-585, 2007. \n*A. Baltag, B. Coecke and M. Sadrzadeh. [["Algebra and Sequent Calculus for Epistemic Actions"|http://eprints.ecs.soton.ac.uk/11809/1/esslliPUB.pdf]]. (Extended Abstract) //Proceedings of LCMAS'04// (Workshop on Logic and Communication in Multi - Agent Systems), 60-78, Nancy 2004.\n*M. Sadrzadeh, A. Baltag and B. Coecke. "Reasoning about Dynamic Epistemic Logic".//Proceedings of EUMAS'02// (The 2nd European Workshop on Multi - Agent Systems), 605-614, Barcelona 2004.\n*A. Baltag, L. S. Moss. [["Logics for Epistemic Programs"|http://www.vub.ac.be/CLWF/SS/BaltagMoss.pdf]]. J. Symons, J. Hintikka. (eds.), W. van der Hoek (special section editor), //Synthese// ("An International Journal for Epistemology, Methodology and Philosophy of Science"), 139 (2): 165-224, 2004. Kluwer Academic Press. [[Abstract|http://www.springerlink.com/content/pl34758l87u0u292/]]\n*A. Baltag, B. Coecke, M. Sadrzadeh. "Epistemic actions as resources". //Proceedings of LRPP'04// (LICS Workshop for Resources, Processes and Programs), 29-42, Turku, Finland 2004.\n*A. Baltag. "Logics for Insecure Communication". J. van Benthem (ed.), //Proceedings of TARK'01// (Eighth Conference on Rationality and Knowledge), Morgan Kaufmann, Los Altos, 111-122, 2001. [[Abstract|http://portal.acm.org/citation.cfm?id=1028128.1028142]]\n*A. Baltag. [["A Logic of Epistemic Actions"|http://www.let.uu.nl/esslli/Courses/hoek/baltag.ps]]. in Wiebe van der Hoek, J. J. Meyer & C. Witteveen (eds.), //Proceedings of FACAS'99// (ESSLLI Workshop on "Foundations and Applications of Collective Agent Based Systems"), ESLLI'99, Utrecht University, 1999. \n*A. Baltag, L.S. Moss, S. Solecki. "The Logic of Public Announcements, Common Knowledge and Private Suspicions". //Proceedings of TARK'98// (Seventh Conference on Theoretical Aspects of Rationality and Knowledge), 43-56. 1998. Morgan Kaufmann Publishers. [[Abstract|http://portal.acm.org/citation.cfm?id=671885]]\n
[[WELCOME]]\n[[RESEARCH INTERESTS]]\n[[RESEARCH VISION]]\n[[RESEARCH PROFILE]] \n[[PUBLICATIONS]]\n[[RESEARCH TALKS]]\n[[TEACHING]]\n[[NASSLLI 2014]]\n[[ESSLLI 2012]]\n[[EVENTS]]\n[[CONTACT]]\n\n\n<<author>>\n
''Papers on Modal Logic for Set Theory and Coalgebra''\n\n*A. Baltag. A Coalgebraic Semantics for Epistemic Programs. //Proceedings of CMCS '03// (Coalgebraic Methods in Computer Science, satellite of ETAPS '03, Warsaw, Poland), //ENTCS//: 82 (1):315-335, 2003. [[Abstract|http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4DDWK62-GB&_user=10&_coverDate=07%2F31%2F2003&_alid=828836090&_rdoc=4&_fmt=high&_orig=search&_cdi=13109&_sort=d&_docanchor=&view=c&_ct=5&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=c01aed88721b40294ee7fc2feaea049b]]\n*A. Baltag. "A Structural Theory of Sets". //Advances in Modal Logic, vol 2, CSLI Publications// 119: 1-34. 2000. [[Volume Table of Contents|http://www.aiml.net/volumes/volume2/]] \n*A. Baltag. "A Logic for Coalgebraic Simulation". H. Reichel (ed.), //Proceedings of CMCS'00// (Third Workshop on "Coalgebraic Methods in Computer Science", Berlin). //ENTCS// 33: 41-60, 2000. Elsevier Science B.V [[Abstract|http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4G1PCXN-J&_user=10&_coverDate=12%2F31%2F2000&_alid=828836090&_rdoc=5&_fmt=high&_orig=search&_cdi=13109&_sort=d&_docanchor=&view=c&_ct=5&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=71b399a0e3bd920cf2f3b3b2546dcf89]]\n*A. Baltag. STS: A Structural Theory of Sets. Dov Gabbay (ed.), //Logic Journal of the IGPL// 7 (4):481-515. 1999. Oxford University Press. [[Abstract|http://jigpal.oxfordjournals.org/cgi/content/abstract/7/4/481]]\n*A. Baltag. "A Structural Theory of Sets. Extended Abstract.",//Proceedings of AIML'98// (Advances in Modal Logic), 32-41. Uppsala, Sweden, 1998.\n*//A. Baltag's Theorems//. Chapter in //[[Vicious Circles|http://csli-publications.stanford.edu/site/1575860082.html]]//. Jon Barwise & Larry Moss, CSLI Publications, Stanford 1996.\n*A. Baltag. //STS: A Structural Theory of Sets//. Ph. D. Thesis. Indiana University. Bloomington, Indiana USA. 1998. \n* A. Baltag //STS: A Structural Theory of Sets//. CWI Technical Report 1998 [[ SEN-R9842| http://db.cwi.nl/rapporten/abstract.php?abstractnr=1150]]\n\n
Welcome to our NASSLLI 2014 Course.\n\nClick here for a link to our [[Slides|https://www.dropbox.com/sh/eg4hdd6kbv9m44c/AABI-2I1emx7zy90pfkXTEd1a]]
Welcome to the NASSLLI'10 Course on Multi - Agent Belief Dynamics by A. Baltag and S. Smets:\n\n[[Lecture 1|http://www.vub.ac.be/CLWF/nasslli2010lecture1.pdf]]\n[[Lecture 2|http://www.vub.ac.be/CLWF/nasslli2010lecture2.pdf]]\n[[Lecture 3|http://www.vub.ac.be/CLWF/nasslli2010lecture3.pdf]]\n[[Lecture 4|http://www.vub.ac.be/CLWF/nasslli2010lecture4.pdf]]\n[[Lecture 5|http://www.vub.ac.be/CLWF/nasslli2010lecture5.pdf]]
// Resolves a Tiddler reference or tiddler title into a tiddler title string, or null if it doesn't exist\nresolveTitle = function(t)\n{\n if (t instanceof Tiddler) t = t.title;\n return store.tiddlerExists(t) ? t : null;\n}\n\nconfig.macros.navigation = {};\nconfig.macros.navigation.handler = function(place,macroName,params,wikifier,paramString,tiddler)\n{\n\n if (!store.tiddlerExists(tiddler.title))\n return false;\n var e = createTiddlyElement(place,"span",null,"nav");\n e.setAttribute("refresh","macro");\n e.setAttribute("macroName",macroName);\n e.setAttribute("params",paramString);\n e.setAttribute("tiddler",tiddler.title)\n this.refresh(e,paramString);\n}\n\nconfig.macros.navigation.refresh = function(place,params)\n{\n var tiddler = store.getTiddler(place.getAttribute("tiddler"));\n removeChildren(place);\n\n\n var params = place.getAttribute("params").parseParams("tiddlers",null,true);\n//alert(store.getTiddlerText(getParam(params,"index",undefined)).parseParams("tiddlers",null,false))\n var tiddlers = getParam(params,"tiddlers",undefined);\nif (typeof tiddlers == 'string')\n tiddlers = tiddlers.readBracketedList();\n if (tiddlers == undefined)\n alert("no source tiddlers defined for navigation");\n var contents = [];\n for (var i=0;i<tiddlers.length;i++)\n {\n var title = resolveTitle(tiddlers[i]);\n contents.push(title);\n}\n var navIndex = contents.indexOf(tiddler.title);\n if (navIndex == -1)\n return false;\n \n if (contents[navIndex-1])\n {\n wikify("[[<< Previous|"+contents[navIndex-1]+"]]",place);\n place.lastChild.className += " navPrev";\n }\n if (contents[navIndex+1])\n {\n wikify("[[Next >>|"+contents[navIndex+1]+"]]",place);\n place.lastChild.className += " navNext";\n }\n\n var theTable = createTiddlyElement(place,"table",null,"nav");\n var theBody = createTiddlyElement(theTable,"tbody");\n var theRow = createTiddlyElement(theBody,"tr");\n for (var i=0; i<contents.length; i++)\n {\n var box = createTiddlyElement(theRow,"td",null,"navlinkcell"," ");\n box.onclick = onClickTiddlerLink;\n box.setAttribute("tiddlyLink",contents[i]);\n box.title = (contents[i]);\n if (contents[i] ==tiddler.title)\n box.className += " activenav";\n }\n}\n\nsetStylesheet(\n".navNext {float:right;}\sn"+\n".navPrev, .navPrevious{float:left;}\sn"+\n".nav .tiddlyLink {color:#000; background:transparent;border:none;padding:0;margin:0;}\sn"+\n".nav {padding:0;margin:0;}\sn"+\n".nav table {margin:0 auto !important; border:0px solid #000;padding:0;border-collapse:separate;}\sn"+\n".nav table tr{padding:0; margin:0;border-spacing: 1px;}\sn"+\n".nav table td {padding:4px; border:1px solid #000; border-spacing: 0px;cursor:pointer;cursor:hand}\sn"+\n".nav .activenav{background:#000 !important;}\sn","NavigationPluginStyles");
The tiddler 'New Tiddler' doesn't yet exist. Double-click to create it
[[PC Member]]\n[[Awards and Grants]]\n[[Editor]]\n[[Conference Participation]]
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n[[Logics for Communication, Information Update and Multi-Agent Belief Revision]]\n\n[[Modal Logics for Set Theory and Coalgebras]]\n\n[[Dynamic Quantum Logic]]\n\n[[Games]]\n\n[[Pebble Logics]]\n\n[[Epistemology, Philosophy of Information and Philosophy of Science]]
<!--{{{-->\n<div id="header" class='header'>\n <div class='gradient' macro='gradient vert #0000cc #8B7355 '>\n\n\n<div class='titleLine' >\n<p>\n\n<span class='siteTitle' refresh='content' tiddler='SiteTitle'></span>\n<span class='siteSubtitle' refresh='content' tiddler='SiteSubtitle'></span>\n</p>\n</div>\n\n </div>\n\n</div>\n<div id='bodywrapper'>\n\n<div id='mainMenu' refresh='content' tiddler='MainMenu'></div>\n<div id='displayArea'>\n <div id='messageArea'></div>\n <div id='tiddlerDisplay'></div>\n</div>\n<div id='contentFooter' refresh='content' tiddler='contentFooter'></div>\n</div>
''Papers on Pebble Logics'' \n\n*A. Baltag. "Interpolation and Preservation for Pebble Logics". //Journal of Symbolic Logic//, 64 (2):
\n\n
//{{{\nTiddlyWiki.prototype.removeNotification = function(title,fn) {\n for (var i=0;i<this.namedNotifications.length;i++)\n if((this.namedNotifications[i].name == title) && (this.namedNotifications[i].notify == fn))\n this.namedNotifications.splice(i,1);\n}\n \n//checks to see if a tiddler exists in store or as a shadow.\nTiddlyWiki.prototype.isTiddler= function (title)\n {return store.tiddlerExists(title) || store.isShadowTiddler(title)}\n\n// Refresh all tiddlers in the Story\nStory.prototype.lewcidrefreshAllTiddlers = function()\n{\n var place = document.getElementById(this.container);\n var e = place.firstChild;\n if(!e) return;\n this.refreshTiddler(e.getAttribute("tiddler"),null,true);\n while((e = e.nextSibling) != null)\n this.refreshTiddler(e.getAttribute("tiddler"),null,true);\n}\n\nconfig.presentationPlugin ={\n};\n\nconfig.presentationPlugin.defaults = [\n {name: "StyleSheet", notify: refreshStyles},\n {name: "PageTemplate", notify: refreshPageTemplate}\n ];\n\nwindow.presentationMode='';\n\nfunction applyPresentationMode (oldMode,Mode)\n{\n presentationMode = Mode;\n var defaults = config.presentationPlugin.defaults;\n var oldStyleElement = document.getElementById(oldMode+"StyleSheet");\n if (oldStyleElement)\n {\n oldStyleElement.parentNode.removeChild(oldStyleElement);\n }\n for (var i=0; i<defaults.length; i++)\n {\n var def = defaults[i]["name"];\n var newMode = store.isTiddler(Mode + def)? Mode + def : def;\n store.removeNotification(oldMode + def, defaults[i]["notify"]);\n store.addNotification(newMode,defaults[i]["notify"]);\n store.notify(newMode); //just one do blanket notify instead?\n }\n story.lewcidrefreshAllTiddlers();\n}\n\nconfig.macros.author={};\nconfig.macros.author.handler= function (place,macroName,params,wikifier,paramString,tiddler) {\n var e = createTiddlyElement(place,"div");\n e.setAttribute("refresh","macro");\n e.setAttribute("macroName","author");\n e.setAttribute("params",paramString);\n this.refresh(e,paramString);\n}\n\nconfig.macros.author.refresh = function(place,params){\n if (window.lewcideditmode== false)\n return false;\n removeChildren(place);\n var oldMode = window.presentationMode;\n var newMode = (oldMode == "Author")?"":"Author";\n var label = (oldMode == "Author")? "Presentation Mode":"Author Mode";\n var tooltip = label;\n createTiddlyButton(place,label,tooltip,function() {\n applyPresentationMode(oldMode,newMode);\n });\n};\n\nStory.prototype.chooseTemplateForTiddler_old_presentation = Story.prototype.chooseTemplateForTiddler;\n\nStory.prototype.chooseTemplateForTiddler = function(title,template)\n{\n if (!template)\n template = DEFAULT_VIEW_TEMPLATE;\n var mode = presentationMode;\n if (template == DEFAULT_VIEW_TEMPLATE)\n {\n if (store.isTiddler(mode+"ViewTemplate"))\n return mode+"ViewTemplate";\n }\n else if (template == DEFAULT_EDIT_TEMPLATE)\n {\n if (store.isTiddler(mode+"EditTemplate"))\n return mode+"EditTemplate";\n }\n return this.chooseTemplateForTiddler_old_presentation(title,template);\n}\n\nwindow.lewcideditmode = false;\nconfig.paramifiers.author = {\n onstart: function(v) {\n if (v!="true")\n return false;\n applyPresentationMode("","Author");\n window.lewcideditmode = true;\n if (config.options.chkSinglePageMode)\n config.options.chkSinglePageMode = false;\n refreshDisplay();\n }\n};\n//}}}
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n\n*modal logic, dynamic logic, epistemic logic, temporal logic;\n*models for multi-agent information flow and information merge (learning, belief revision, communication, persuasion, belief agreggation);\n*quantum logic and quantum information flow;\n*coalgebras, non-well-founded sets, Universal Set Theory, models for self-reference, circularity and fixed-points;\n*rationality and action in Game Theory;\n*formal epistemology, philosophy of information and philosophy of science.
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\nClick here for the pdf file: [[Research Profile|http://www.vub.ac.be/CLWF/SS/ResearchProfile.pdf]]\n\n
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n[[Invited Lectures at International Conferences and Meetings]]\n\n[[Contributed Talks to Conferences and Workshops]]
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\nClick here for the pdf file: [[Research Vision|http://www.vub.ac.be/CLWF/SS/ResearchVision.pdf]]\n
/***\n|''Name:''|SinglePageModePlugin|\n|''Source:''|http://www.TiddlyTools.com/#SinglePageModePlugin|\n|''Author:''|Eric Shulman - ELS Design Studios|\n|''License:''|[[Creative Commons Attribution-ShareAlike 2.5 License|http://creativecommons.org/licenses/by-sa/2.5/]]|\n|''~CoreVersion:''|2.0.10|\n\nNormally, as you click on the links in TiddlyWiki, more and more tiddlers are displayed on the page. The order of this tiddler display depends upon when and where you have clicked. Some people like this non-linear method of reading the document, while others have reported that when many tiddlers have been opened, it can get somewhat confusing.\n\n!!!!!Usage\n<<<\nSinglePageMode allows you to configure TiddlyWiki to navigate more like a traditional multipage web site with only one item displayed at a time. When SinglePageMode is enabled, the title of the current tiddler is automatically displayed in the browser window's titlebar and the browser's location URL is updated with a 'permalink' for the current tiddler so that it is easier to create a browser 'bookmark' for the current tiddler.\n\nEven when SinglePageMode is disabled (i.e., displaying multiple tiddlers is permitted), you can reduce the potential for confusion by enable TopOfPageMode, which forces tiddlers to always open at the top of the page instead of being displayed following the tiddler containing the link that was clicked.\n<<<\n!!!!!Configuration\n<<<\nWhen installed, this plugin automatically adds checkboxes in the AdvancedOptions tiddler so you can enable/disable the plugin behavior. For convenience, these checkboxes are also included here:\n\n<<option chkSinglePageMode>> Display one tiddler at a time\n<<option chkTopOfPageMode>> Always open tiddlers at the top of the page\n<<<\n!!!!!Installation\n<<<\nimport (or copy/paste) the following tiddlers into your document:\n''SinglePageModePlugin'' (tagged with <<tag systemConfig>>)\n^^documentation and javascript for SinglePageMode handling^^\n\nWhen installed, this plugin automatically adds checkboxes in the ''shadow'' AdvancedOptions tiddler so you can enable/disable this behavior. However, if you have customized your AdvancedOptions, you will need to ''manually add these checkboxes to your customized tiddler.''\n<<<\n!!!!!Revision History\n<<<\n''2006.07.04 [2.2.1]'' in hijack for displayTiddlers(), suspend TPM as well as SPM so that DefaultTiddlers displays in the correct order.\n''2006.06.01 [2.2.0]'' added chkTopOfPageMode (TPM) handling\n''2006.02.04 [2.1.1]'' moved global variable declarations to config.* to avoid FireFox 1.5.0.1 crash bug when assigning to globals\n''2005.12.27 [2.1.0]'' hijack displayTiddlers() so that SPM can be suspended during startup while displaying the DefaultTiddlers (or #hash list). Also, corrected initialization for undefined SPM flag to "false", so default behavior is to display multiple tiddlers\n''2005.12.27 [2.0.0]'' Update for TW2.0\n''2005.11.24 [1.1.2]'' When the back and forward buttons are used, the page now changes to match the URL. Based on code added by Clint Checketts\n''2005.10.14 [1.1.1]'' permalink creation now calls encodeTiddlyLink() to handle tiddler titles with spaces in them\n''2005.10.14 [1.1.0]'' added automatic setting of window title and location bar ('auto-permalink'). feature suggestion by David Dickens.\n''2005.10.09 [1.0.1]'' combined documentation and code in a single tiddler\n''2005.08.15 [1.0.0]'' Initial Release\n<<<\n!!!!!Credits\n<<<\nThis feature was developed by EricShulman from [[ELS Design Studios|http:/www.elsdesign.com]].\nSupport for BACK/FORWARD buttons adapted from code developed by Clint Checketts\n<<<\n!!!!!Code\n***/\n//{{{\nStory.prototype.displayTiddler = function(srcElement,title,template,animate,slowly)\n{\n var place = document.getElementById(this.container);\n var theTiddler = document.getElementById(this.idPrefix + title);\n if(theTiddler)\n this.refreshTiddler(title,template);\n else\n {\n var before = this.positionTiddler(srcElement);\n theTiddler = this.createTiddler(place,before,title,template);\n }\n if(srcElement && typeof srcElement !== "string")\n {\n if(anim && config.options.chkAnimate && (animate == undefined || animate == true))\n anim.startAnimating(new Cascade(title,srcElement,theTiddler,slowly),new Scroller(theTiddler,slowly));\n else\n window.scrollTo(0,0);\n }\n}\n\n\n\nversion.extensions.SinglePageMode= {major: 2, minor: 2, revision: 1, date: new Date(2006,7,3)};\n\nconfig.options.chkSinglePageMode=true;\n\nif (config.options.chkSinglePageMode==undefined) config.options.chkSinglePageMode=false;\nconfig.shadowTiddlers.AdvancedOptions += "\sn<<option chkSinglePageMode>> Display one tiddler at a time";\n\nif (config.options.chkTopOfPageMode==undefined) config.options.chkTopOfPageMode=false;\nconfig.shadowTiddlers.AdvancedOptions += "\sn<<option chkTopOfPageMode>> Always open tiddlers at the top of the page";\n\nconfig.SPMTimer = 0;\nconfig.lastURL = window.location.hash;\nfunction checkLastURL()\n{\n if (!config.options.chkSinglePageMode)\n { window.clearInterval(config.SPMTimer); config.SPMTimer=0; return; }\n if (config.lastURL == window.location.hash)\n return;\n var tiddlerName = convertUTF8ToUnicode(decodeURI(window.location.hash.substr(1)));\n tiddlerName=tiddlerName.replace(/\s[\s[/,"").replace(/\s]\s]/,""); // strip any [[ ]] bracketing\n if (tiddlerName.length) story.displayTiddler(null,tiddlerName,1,null,null);\n}\n\nif (Story.prototype.SPM_coreDisplayTiddler==undefined) Story.prototype.SPM_coreDisplayTiddler=Story.prototype.displayTiddler;\nStory.prototype.displayTiddler = function(srcElement,title,template,animate,slowly)\n{\n if (config.options.chkSinglePageMode) {\n window.location.hash = encodeURIComponent(String.encodeTiddlyLink(title));\n config.lastURL = window.location.hash;\n document.title = wikifyPlain("SiteTitle") + " - " + title;\n story.closeAllTiddlers();\n if (!config.SPMTimer) config.SPMTimer=window.setInterval(function() {checkLastURL();},1000);\n }\n if (config.options.chkTopOfPageMode) { story.closeTiddler(title); window.scrollTo(0,0); srcElement=null; }\n this.SPM_coreDisplayTiddler(srcElement,title,template,animate,slowly)\n}\n\nif (Story.prototype.SPM_coreDisplayTiddlers==undefined) Story.prototype.SPM_coreDisplayTiddlers=Story.prototype.displayTiddlers;\nStory.prototype.displayTiddlers = function(srcElement,titles,template,unused1,unused2,animate,slowly)\n{\n // suspend single-page mode when displaying multiple tiddlers\n var saveSPM=config.options.chkSinglePageMode; config.options.chkSinglePageMode=false;\n var saveTPM=config.options.chkTopOfPageMode; config.options.chkTopOfPageMode=false;\n this.SPM_coreDisplayTiddlers(srcElement,titles,template,unused1,unused2,animate,slowly);\n config.options.chkSinglePageMode=saveSPM; config.options.chkTopOfPageMode=saveTPM;\n}\n//}}}
PERSONAL WEBSITE
Alexandru Baltag's
\n\n/***\nPlace your custom CSS here\n***/\n/*{{{*/\n\n\n[[SideBarWG]]\n\n/***\n!Top Menu Styles\n***/\n/*{{{*/\n#topMenu br {display:none; }\n#topMenu { background: #000 ; color:#fff;padding: 1em 1em;}\n/*}}}*/\n\n/***\n!General\n***/\n/*{{{*/\nbody {\n background: #444;\n margin: 0 auto;\n}\n\n #contentWrapper{\n background: #fff;\n border: 0;\n margin: 0 1em;\n\n padding:0;\n}\n\n/*}}}*/\n\n/***\n!Header rules\n***/\n/*{{{*/\n.titleLine{\nmargin: 68px 3em 0em 0em;\nmargin-left:1.7em;\nmargin-bottom: 28px;\n padding: 0;\n text-align: left;\n color: #fff;\n}\n\n.siteTitle {\n font-size: 2em;\n font-weight: bold;\n}\n\n.siteSubtitle {\n font-size: 1.1em;\n display: block;\n margin: .5em auto 1em;\n}\n\n.gradient {margin: 0 auto; border-bottom:1px solid #000;}\n\n\n\n.header {\n background: #fff; \n margin: 0 0em;\n padding:0 12px;\n\n}\n/*}}}*/\n\n/***\n!Display Area\n***/\n/*{{{*/\n#bodywrapper {margin:0 12px; padding:0;background:#fff; height:1%}\n\n#displayArea{\n margin: 0em 16em 0em 14em;\n text-align: left;\n}\n\n.tiddler {\n padding: 1em 1em 0em 0em;\n}\n\nh1,h2,h3,h4,h5 { color: #000; background: transparent; padding-bottom:2px; border-bottom: 1px dotted #666; }\n.title {color:black; font-size:1.8em; border-bottom:1px solid #333; padding-bottom:0.3px;}\n.subtitle { font-size:90%; color:#ccc; padding-left:0.25em; margin-top:0.1em; }\n\n.shadow .title {\n color: #aaa;\n}\n\n.tagClear{\n clear: none; \n}\n\n* html .viewer pre {\n margin-left: 0em;\n}\n\n* html .editor textarea, * html .editor input {\n width: 98%;\n}\n\n.tiddler {margin-bottom:1em; padding-bottom:0em;}\n\n\n.toolbar .button {color:#bbb; border:none;}\n.toolbar .button:hover, .toolbar .highlight, .toolbar .marked, .toolbar a.button:active {background:transparent; color:#111; border:none; text-decoration:underline;}\n\n#sidebar .highlight, #sidebar .marked {background:transparent;}\n\n.tagging, .tagged {\n border: 1px solid #eee;\n background-color: #F7F7F7;\n}\n\n.selected .tagging, .selected .tagged {\n background-color: #eee;\n border: 1px solid #bbb;\n}\n\n .tagging .listTitle, .tagged .listTitle {\n color: #bbb;\n}\n\n.selected .tagging .listTitle, .selected .tagged .listTitle {\n color: #222; \n}\n\n\n.tagging .button:hover, .tagged .button:hover {\n border: none; background:transparent; text-decoration:underline; color:#000;\n}\n\n.tagging .button, .tagged .button {\n color:#aaa;\n}\n\n.selected .tagging .button, .selected .tagged .button {\n color:#000;\n}\n\n.viewer blockquote {\n border-left: 3px solid #000;\n}\n\n.viewer pre, .viewer code {\n border: 1px dashed #ccc;\n background: #eee;}\n\n.viewer hr {\n border: 0;\n border-top: solid 1px #333;\n margin: 0 8em;\n color: #333;\n}\n\n.highlight, .marked {background:transparent; color:#111; border:none; text-decoration:underline;}\n\n.viewer .highlight, .viewer .marked {text-decoration:none;}\n\n#sidebarTabs .highlight, #sidebarTabs .marked {color:#000; text-decoration:none;}\n\n.tabSelected {\n color: #000;\n background: #fff;\n border-top: solid 1px #ccc;\n border-left: solid 1px #ccc;\n border-right: solid 1px #ccc;\n border-bottom: none;\n}\n\n.viewer .tabSelected:hover{color:#000;}\n\n.viewer .tabSelected {font-weight:bold;}\n\n.tabUnselected {\n color: #999;\n background: #eee;\n border-top: solid 1px #ccc;\n border-left: solid 1px #ccc;\n border-right: solid 1px #ccc;\n border-bottom: solid 1px #ccc;\n padding-bottom:1px;\n}\n\n.tabContents {\n background: #fff;\n color: #000;\n}\n/*}}}*/\n/***\n!!!Tables\n***/\n/*{{{*/\n.viewer table {\n border: 1px solid #000;\n}\n\n.viewer th, thead td {\n background: #000;\n border: 1px solid #000;\n color: #fff;\n}\n\n.viewer td, .viewer tr {\n border: 1px solid #111; padding:4px;\n}\n/*}}}*/\n\n\n/***\n!!!Editor area\n***/\n/*{{{*/\n.editor input, .editor textarea {\n border: 1px solid #ccc;\n}\n\n.editor {padding-top:0.3em;}\n\n.editor textarea:focus, .editor input:focus {\n border: 1px solid #333;\n}\n/*}}}*/\n\n/***\n!Sidebar\n***/\n/*{{{*/\n#sidebar{\nposition:relative;\nfloat:right;\nmargin-bottom:1em;\ndisplay:inline;\nwidth: 16em;\n}\n\n#sidebarOptions .sliderPanel {\n background: #eee; border:1px solid #ccc;\n}\n\n/*}}}*/\n\n/***\n!Body Footer rules\n***/\n/*{{{*/\n#contentFooter {\n text-align: center;\n clear: both;\n color:#fff;\n background: #000;\n padding: 1em 2em;\nfont-weight:bold;\n}\n\n/*}}}*/\n/***\n!Link Styles\n***/\n/*{{{*/\na{\n color: #000;\n}\n\na:hover{\n color: #ED700B;\n background:#fff;\n}\n\n\n.button {\n color: #000;\n border: 1px solid #fff;\n}\n\n.button:hover {\n color: #fff;\n background: #ED700B;\n border-color: #000;\n}\n\n.button:active {\n color: #fff;\n background: #ED700B;\n border: 1px solid #000;\n}\n\n.tiddlyLink {border-bottom: 1px dotted #000;}\n.tiddlyLink:hover {border-bottom: 1px dotted #ED700B;} \n\n.titleLine a {border-bottom: 1px dotted #FF9900;}\n\n.titleLine a:hover {border-bottom: 1px dotted #fff;}\n\n.siteTitle a, .siteSubtitle a{\n color: #fff;\n}\n\n.viewer .button {border: 1px solid #ED700B; font-weight:bold;}\n.viewer .button:hover, .viewer .marked, .viewer .highlight{background:#ED700B; color:#fff; font-weight:bold; border: 1px solid #000;}\n\n#topMenu .button, #topMenu .tiddlyLink {\n margin-left:0.5em; margin-right:0.5em;\n padding-left:3px; padding-right:3px;\n color:white; font-weight:bold;\n}\n#topMenu .button:hover, #topMenu .tiddlyLink:hover { background:#000; color:#FF8814}\n\n#topMenu a{border:none;}\n/*}}}*/\n\n/***\n!Message Area /%=================================================%/\n***/\n/*{{{*/\n#messageArea {\n border: 4px dotted #ff8614;\n background: #000;\n color: #fff;\n font-size:90%;\n}\n\n#messageArea .button {\n padding: 0.2em;\n color: #000;\n background: #fff;\n text-decoration:none;\n font-weight:bold;\n border:1px solid #000; \n}\n\n#messageArea a {color:#fff;}\n\n#messageArea a:hover {color:#ff8614; background:transparent;}\n\n#messageArea .button:hover {background: #FF8614; color:#fff; border:1px solid #fff; }\n\n/*}}}*/\n\n/***\n!Popup /%=================================================%/\n***/\n/*{{{*/\n.popup {\n background: #ff8814;\n border: 1px solid #333;\n}\n\n.popup hr {\n color: #333;\n background: #333;\n border-bottom: 1px;\n}\n\n.popup li.disabled {\n color: #333;\n}\n\n.popup li a, .popup li a:visited {\n color: #eee;\n border: none;\n}\n\n.popup li a:hover {\n background: #ff8614;\n color: #fff;\n border: none;\n text-decoration:underline;\n}\n\n.searchBar {float:right; font-size:1em;}\n.searchBar .button {display:block; border:none; color:#ccc; }\n.searchBar .button:hover{border:none; color:#eee;}\n\n.searchBar input{\n border: 1px inset #000; background:#EFDFD1; width:10em; margin:0;\n}\n\n.searchBar input:focus {\n border: 1px inset #000; background:#fff;\n}\n\n*html .titleLine {margin-right:1.3em;}\n\n*html .searchBar .button {margin-left:1.7em;}\n\n .HideSideBarButton {float:right;} \n/*}}}*/\n\n.blog h2, .blog h3, .blog h4{\n margin:0;\n padding:0;\nborder-bottom:none;\n}\n.blog {margin-left:1.5em;} \n\n\n.blog .excerpt {\n margin:0;\nmargin-top:0.3em;\n padding: 0;\n margin-left:1em;\n padding-left:1em;\n font-size:90%;\n border-left:1px solid #ddd;\n}\n\n#tiddlerWhatsNew h1, #tiddlerWhatsNew h2 {border-bottom:none;}\ndiv[tags~="RecentUpdates"], div[tags~="lewcidExtension"] {margin-bottom: 2em;}\n\n#hoverMenu .button, #hoverMenu .tiddlyLink {border:none; font-weight:bold; background:#f37211; color:#fff; padding:0 5px; float:right; margin-bottom:4px;}\n#hoverMenu .button:hover, #hoverMenu .tiddlyLink:hover {font-weight:bold; border:none; color:#f37211; background:#000; padding:0 5px; float:right; margin-bottom:4px;}\n\n#topMenu .fontResizer {float:right;}\n\n#topMenu .fontResizer .button{border:1px solid #000;}\n#topMenu .fontResizer .button:hover {border:1px solid #f37211; color:#fff;}\n#sidebarTabs .txtMainTab .tiddlyLinkExisting {\n font-weight: normal;\n font-style: normal;\n}\n\n#sidebarTabs .txtMoreTab .tiddlyLinkExisting {\n font-weight: bold;\n font-style: normal;\n}\n\n\n\n\n\n#displayArea {margin-right:1em;}\n\n.headerShadow {\n position: relative;\n padding: 2.5em 0em 1em 1em;\n left: -1px;\n top: -1px;\n}\n\n.headerForeground {\n position: absolute;\n padding: 2.5em 0em 1em 1em;\n left: 0px;\n top: 0px;\n}\n\n.siteTitle {\n font-size: 2.5em;\n}\n\n.siteSubtitle {\n font-size: 1.2em;\n}\n\n#mainMenu {float:left; position:relative;}\n\n\n.viewer .button {border: 1px solid #ED700B; font-weight:bold;}\n.viewer .button:hover, .viewer .marked, .viewer .highlight{background:#ED700B; color:#fff; font-weight:bold; border: 1px solid #ED700B;}\n[[StyleSheetCommon]]\n#contentFooter .tiddlyLink {\n color:#fff;\n}\n/*}}}*/\n\n
.centre {text-align:center; margin:0;}\n.centre img {margin:0 auto;}\n\n.title, h1 {font-size: 1.6em; font-weight:bold; background:transparent; margin-top:0;margin-bottom:0; color:#000;}\n\nh2 {font-size: 1.45em; font-weight:bold; background:transparent; margin-top:0;margin-bottom:0; color:#000;}\n\n#mainMenu {width:14em;}\n#displayArea {margin-left:18em;}\n\n.left {float:left; margin-right:1em;}\n.bold {font-weight:bold;}\n\n\n\n.topbutton button, .topbutton{float:right;}\n\n.note{\n position:relative; /*this is the key*/\n z-index:24; background:#ccc;\n color:#000;\n text-decoration:none}\n\n.note:hover, .noteover{z-index:25; background-color:#FFB865;cursor:help;}\n\n.note span{display: none;}\n\n.note:hover span, .noteover span{ /*the span will display just on :hover state*/\n display:block;\n position:absolute;\n top:2em; left:2em; width:15em;\n border:1px solid #000;\n background-color:#FFB35A; color:#000;\n padding:0.5em;}\n\n\n\n.info{\n position:relative; /*this is the key*/\n z-index:24; background:#ccc;\n color:#000;\n text-decoration:none}\n\n.info:hover, .infoover{z-index:25; background-color:#FFB865;cursor:help;}\n\n.info span{display: none}\n\n.info:hover span, .infoover span{ /*the span will display just on :hover state*/\n display:block;\n position:absolute;\n top:2em; left:2em; width:15em;\n border:1px solid #000;\n background-color:#FFB35A; color:#000;\n padding:0.5em;}\n\n.bold {font-weight: bold !important;}
<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n''Courses I am currently teaching at ILLC:''\n\n[[Dynamic Epistemic Logic 2014-2015]]\n\n\n''Courses previously taught at University of Amsterdam:''\n\n\n[[Topics in Dynamic Epistemic Logic 2013-2014]]\n[[Introduction to Modal Logic 2013-2014]]\n[[Topics in Dynamic Epistemic Logic 2012-2013]]\n[[Introduction to Modal Logic 2012-2013]]\n[[Introduction to Modal Logic 2011-2012]]\n[[Axiomatic Set Theory 2011-2012]]\n[[Topics in Dynamic Epistemic Logic 2011-2012]]\n\n\n''Other courses I taught in previous years at Oxford University:''\n\n*[[Intelligent Systems II|http://web.comlab.ox.ac.uk/teaching/courses/2009-2010/intelligent2/]]\n*[[Computers in Society|http://web.comlab.ox.ac.uk/teaching/courses/2009-2010/CIS/]]\n*“[[Logic of Multi- Agent Information Flow|http://web.comlab.ox.ac.uk/teaching/courses/2009-2010/multiagent/]]”: a graduate course that I created, essentially a course on my main research area (Dynamic Epistemic Logic). This year the lecturer of this course is my former student M. Sadrzadeh.\n*“[[Logic and Proof|http://web.comlab.ox.ac.uk/teaching/courses/2009-2010/logicandproof/]]”: a introduction to logic for undergraduate students in Computer Science. \n*“[[Data Structures and Algorithms|http://web.comlab.ox.ac.uk/teaching/courses/2009-2010/adsa/]]” . \n\n''Courses in Logic taught at international summer schools:''\n\n*"Interactive learning, formal social epistemology and group belief dynamics: logical, probabilistic and game-theoretic models" at ESSLLI 2012 (European Summer School in Logic, Language and Information). Joint course with S. Smets \n*"Multi- Agent Belief Dynamics" at NASSLLI 2010 (North American Summer School in Logic, Language and Information), Indiana University June 21-25, 2010. Joint course with S. Smets. [[Slides on-line|NASSLLI10 COURSE]]\n*“Dynamic Logics for Interactive Belief Revision” at ESSLLI’ 09 (European Summer School in Logic, Language and Information), Bordeaux 2009. Joint course with S. Smets. [[Slides on-line|ESSLLI09 COURSE]]\n*"Logics for Quantum Information Flow” at ESSLLI’ 06 (European Summer School in Logic, Language and Information), Malaga 2006. Joint course with S. Smets. [[Slides on-line|ESSLLI06 COURSE]]\n*“Logics for Communication: reasoning about information flow in dialogue games” at NASSLLI’ 03 (North- American Summer School in Logic, Language and Information), Bloomington Indiana, 2003.\n*“Dynamic Epistemic Logic” at NASSLLI’ 02, Stanford University, 2002. Joint course with L. Moss.\n*A course on “Logic and Games” at The First South African Summer School on Logic, Universal Algebra and Theoretical Computer Science, (LUATCS’99), Rand Afrikaans University, Johannesburg, South Africa, December 1999.\n\n''Invited courses taught at other universities:''\n\n*Course at the Workshop on Formal Epistemology. Northern Institute of Philosophy, the University of Aberdeen, June 14-18, 2010. Joint course with S. Smets.\n*A course on "Dynamic Quantum Logic" at Perimeter Institute for Theoretical Physics, Waterloo, Ontario, Canada. July 2005. Joint course with S. Smets.\n*"Logics for Communication": invited course at the Department of Artificial Intelligence of the //Universidad Politécnica de Madrid//, Madrid, March 2004.\n*A course on "dynamic modal logic" at the //Foundations of the Formal Sciences II//, Bonn, Germany, November 2000.\n*During my post-doctoral stage at ILLC (University of Amsterdam), I taught the course “Modal Logic”, as a co-lecturer with Y. Venema.\n
Tiddler.prototype.getSubtitle = function()\n{\n return(this.title);\n}
config.macros.top={};\nconfig.macros.top.handler=function(place,macroName)\n{\n createTiddlyButton(place,"^","jump to top",this.onclick);\n}\nconfig.macros.top.onclick=function()\n{\n window.scrollTo(0,0);\n};
@@color(red):__''TOPICS IN DYNAMIC EPISTEMIC LOGIC''__@@\n(Spring 2011, ILLC, University of Amsterdam)\n\n@@color(blue):__''VERY IMPORTANT NOTE''__:@@ @@color(red): ''PLEASE PRESS THE `REFRESH' BUTTON __EVERY TIME__ YOU ACCESS THIS PAGE!!!''@@\n''Otherwise you will still see the old content (although the page IS periodically updated!).''\n\n\n\n__''Time''__\n\n\nMondays 13:00-15:00.\n\n\n__''Place''__\n\n''ROOM CHANGE''!!!:\nAs of Monday of week 2, and for the rest of the ''first part'' of the term (Feb 6 -- March 19), the lectures will take place in ''room G5-29'' (NOT in ''room G2.13'' where we were on the first Monday!) in Science Park. This is BIGGER!\n\nIn the second part of the term (April 2 -- May 21), the lectures and classes will take place in ''room D1.114''\nin Science Park.\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistant (and Marker)''__\n\nBEN RODENHAUSER\n\n\n__''Exercise (Tutorial) Classes''__\n\nFrom time to time, Ben will give 1-hour tutorial classes, in which he will explain the solutions to homeworks and (time-permitting) answer other questions. ''Time: Mondays 11:00-13:00, ROOM: A1-08, though NOT every week''. Specific dates TBA. However: the room for tutorials fits only 20 people, so I advise you to divide in twp groups, some coming only 11:00-12:00, and the others only 12:00-13:00. \n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures or in exercise classes, please email them to my assistant Ben Rodenhauser at //b.rodenhaeuser@gmail.com// or make an appointment to see him. However, please keep in mind that his office is small and doesn't fit more than two students at a time, and that it is not sound-proof: you may want to go to the meeting room, or find another room.\n\nIn case he cannot answer a question, please email me at //TheAlexandruBaltag@gmail.com// and, if necessary, make an appointment to see me.\n\n\n__''Objectives of Course''__\n\nFirst, to present to students the main concepts and formalism of Dynamic Epistemic Logic (DEL), including recent developments on connections to other fields (from Epistemology and Learning Theory to Game Theory, Social Software, Pragmatics, Quantum Information etc). Second, to enable students to acquire some research experience, by discussing some of the outstanding conceptual challenges in the field, as well as more technical open questions, and giving them guidance and encouragement to tackle some of these issues in their final projects.\n\n\n__''Contents''__\n\n\nThis course is addressed to students and researchers interested in logics for reasoning about multi-agent belief revision, belief updates and knowledge updates induced by various forms of communication or interaction. We start by presenting the main concepts of "standard DEL" (as covered e.g. in the book ``Dynamic Epistemic Logic" and in several ESSLLI courses with the same name): multi-agent epistemic Kripke models, public announcements, epistemic event models, product update, and the corresponding dynamic logics. Then we present the more recent "belief-revision-friendly" version of DEL and its main concepts (plausibility models, the Action-Priority Update), by combining the techniques of Dynamic Epistemic Logic with the insights and models from Belief Revision theory. We formalize various types of doxastic attitudes (belief, strong belief, safe belief, conditional belief, degrees of belief, group belief), notions of defeasible "knowledge", belief upgrades and belief-revision policies etc. We give some axiomatizations and apply these notions to communication strategies and the pragmatics of Natural Language, to rationality and strategic reasoning in Game Theory, to the formalization of key concepts in modern Epistemology, and to the analysis of various epistemic-doxastic paradoxes and puzzles (Fitch's knowability paradox, the Puzzle of the Perfect Believer, the Muddy Children, the Surprise Examination etc). Further, we present various extensions of this setting (to dynamics of probabilistic beliefs, dynamics of evidence and justification etc), as well as recent work at the interface of DEL with Learning Theory, Epistemology, Social Choice theory, Quantum Information, Secure Communication etc. We discuss some of the on-going conceptual challenges and the open technical questions encountered in the field, and we encourage and guide students to start tackling some of these problems. \n\n\n\n__''Recommended prior knowledge''__\n\nWe presuppose some (but very little) background knowledge in Logic: basically, the syntax and semantics of modal logic. This should be enough for understanding the course, though obviously having more prior knowledge can only lead to better final projects. Having some more advanced technical knowledge of Modal Logic theory would be very useful for tackling some of the open questions, but it is not required. Some familiarity with, or at least some interest in, any of the above-mentioned areas of intended application (Epistemology, Pragmatics, Game Theory, Multi-Agent Systems etc) would also be very welcome, and particularly useful for tackling some of the more conceptual challenges. More importantly, we assume that participants in the course possess both some degree of mathematical maturity (as can be expected from students in logic at a MSc level) and a live interest in interdisciplinary connections and applications of Logic.\n\n__''Registration at''__\n\nRegistration for courses is mandatory, but will be done by the Education Service Centre for the 1st year MSc students for courses of the first semester. See also http://www.student.uva.nl and choose your master and then 'New procedure 'Registration for courses Faculty of Science'. \n\n\n\n__''Format''__\n\nLectures and office hours.\n\n__''Study materials''__\n\nThere is //no main textbook// for this course. The principal material consists in ''slides'' of lectures, which will be regularly made available after each lecture. In addition, I will refer to a number of textbooks and materials, among which the most important are: \n\nA. Baltag, H. P. van Ditmarsch and L.S. Moss, ''Epistemic logic and information update'', in the //Handbook of Philosophy of Information// (Editors: P. Adriaans and J. van Benthem), part of the series Handbook of Philosophy of Science, vol. 8, pp. 361-455, Elsevier, 2008. Electronically available [[HERE|http://www.vub.ac.be/CLWF/SS/DELhandbookarticle.pdf]] \n\nJ. van Benthem, ''Logical Dynamics of Information and Interaction'', Cambridge Univ Press, 2011.\n\nH. P. van Ditmarsch, W. van der Hoek and B. Kooi , ''Dynamic Epistemic Logic'', Springer, 2007.\n\nR. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, ''Reasoning about Knowledge'', MIT Press, Cambridge MA 1995.\n\n\n\n__''Assessment''__\n\nHomework exercises (worth in total 30% of the final grade), plus a final paper or project (worth 70% of the final grade) on one of the topics investigated in the course. The exercises are individual (i.e. no collaboration), while the final papers can be jointly written by teams. The homework exercises will be mostly mathematical, while the final paper/project should be mostly conceptual. \n\n\n__''COURSE PLAN''__\n\nThe plan below is ''tentative''. It will be adjusted depending on time, students' feedback and interest etc. Each week, after the lecture, the slides of the covered material will be made available here, together with a brief summary of what was actually covered.\n\n*LECTURE 1 (February 6): SUMMARY OF LECTURE: Administration, Introduction: Examples, Stories and Puzzles. \n\n*LECTURE 2 (February 13): SUMMARY OF LECTURE: More Puzzles. Single-Agent Epistemic/doxastic Logics: K, S5, S4, KD45. Sphere Models. Kripke Models, Epistemic Models, Doxastic Models. The problem of Introspection. The problem of logical omniscience.\n\n\n*LECTURE 3 (February 20): SUMMARY OF LECTURE: Multi-agent Models. Common Knowledge and Common (true) Belief. Distributed Knowledge. The problem of belief aggregation. Dynamics: updates. Public Announcements. Fully Private Announcements. Fair-Game Announcements. Cheating, lying, mis-information. Secret interception of messages. \n\n*LECTURE 4 (February 27): PDL versus DEL. Logics talking about model changes. Dynamic modalities for epistemic actions. Syntax, Semantics and Axiomatization of PAL (Public Announcement Logic). Reduction laws and their uses. Co-expressivity of PAL and ML. Increase in Succinctness. Closure of public announcements under composition. PAC (=PAL with common knowledge): its increased expressivity; how to axiomatize it?\n\n*LECTURE 5 (March 5): Complete Axiomatizations of PAC. Application: formalizing Muddy Children. OTHER EXTENSIONS OF PAL: PAL with distributed knowledge. ``Tell us all you know". The Logic of Fully Private Announcements. ``STANDARD DEL": Epistemic Event Models and Product Update. Axiomatizations: Reduction Laws, the Action-Knowledge Axiom. Special cases: axioms for PAL and other announcement logics. \n\n@@color(red): ''HOMEWORK 1''@@ (due on //Monday 19 March before 12:00 noon//)\n\n ''ADDITIONAL INFO '': The material presented in the course until now is covered in more depth in the Chapter [[''Epistemic logic and information update'', from the Handbook of Philosophy of Information|http://www.vub.ac.be/CLWF/SS/DELhandbookarticle.pdf]]. In particular, see Sections 2, 2.1, 2.2, 2.3, 3, 3.1, 3.2, 3.5, 3.8, 4, 4.1, 4.2, 4.3, 4.4, 4.5, 4.6, 4.9 of this Chapter for more information on //epistemic-doxastic logics//, examples and motivation etc; and see Sections 5, 5.1, 5.2, 5.3, 5.4, 5.5 of the same Chapter for more information and examples on //PAL, event models and Product Update //. Regarding these last topics, see also my paper [[''The Logic of Epistemic Programs ''|http://www.vub.ac.be/CLWF/SS/BaltagMoss.pdf]].\n\n\n\n*LECTURE 6 (March 12): EXTENSIONS OF DEL: Adding common knowledge to DEL: the problems for axiomatization, and ways to solve them. Composition of event models. Complete Axiomatization of DEL with common knowledge. The Action Rule. Example: the Private Announcement Rule. OTHER EXTENSIONS OF DEL: Adding iteration (Kleene star). Iterated PAL and undecidability. Arbitrary Announcement Logic. ``Learnability" and ``knowability" Applications: Fitch's Paradox and Verificationism. The problem of belief revision, revisited. Belief Revision Theory, AGM-style. Criticism. \n\n\n*March 19: \n12:00-13:00: EXERCISE CLASS (in room A1-08)\n13:00-15:00: LECTURE 7 (in the usual lecture room: G5-29)\nThe AGM Postulates. Grove spheres, plausibility models, Spohn models, onion models. Conditional belief logic. Connections to non-monotonic logics, conditional logics and default logics. The logic of conditional beliefs. \n\n\n\n*April 2: NO LECTURE!\n\n ''IMPORTANT ANNOUNCEMENT'': In this second part of term, the lecture room (for Mondays 13:00-15:00) is changed to room ''D1-114''. In addition, the Werkcollege room (for exercise classes, or also occasional lectures, on Mondays 12:00-13:00) is changed to room ''D1-110 ''. \n\n*April 16: \n12:00-13:00: LECTURE 8 (in the NEW Werkcollege room, D1-110)\n13:00-15:00: LECTURE 8 continued (in the NEW Hoorcollege room: D1-114). \nDynamics: soft upgrades; dynamic-doxastic attitudes as belief-revision policies. Strong beliefs and lexicographic (``radical") upgrade. Simple belief and minimal (``conservative") upgrade. Positive, negative and mixed attitudes: examples, definitions etc.\n\n\n@@color(red): ''Possible Topics for Final Projects in this Course''@@\nThe largest component in your final grade is based on your final project. These projects should be pursued in groups of minimum 2 students, and in fact preferably 3 or maximum 4 students. No two groups can choose the same topic. You have until May 1 to negotiate the topics among you, form the groups and choose one topic per group. I will leave this negotiation to yourself. The deadline for completing these projects is ''June 1''. The project work will consist in reading 2-4 papers on the topic, summarizing their technical content (together with all the needed background) in your own words, and discussing in writing either the conceptual implications and philosophical issues, OR the technical open problems, arising from what you've read. After you choose, I will provide you with some of the relevant papers, though finding new relevant papers and including an excellent bibliography is very much encouraged (and will be especially rewarded). AND (OF COURSE!), any new good ideas, new interesting settings or concepts, or new non-trivial technical developments, will be amply rewarded! But they are not absolutely necessary for getting a good grade. Here is the list of possible topics (though any other ideas concerning other topics are also welcome, provided that I agree with them, they are related to the course they are adopted by 2-4 students):\n\n1. Probabilistic DEL (and its possible uses in applications, philosophy etc)\n2. DEL and Game Theory (logical aspects of strategic reasoning, epistemic conditions for solution concepts etc)\n3. DEL and Epistemology (concepts of knowledge)\n4. DEL and Paradoxes (Fitch, Moore, Voorbrak, the Surprise Exam etc)\n5. Interrogative DEL: the dynamics of questions and answers\n6. DEL-type logics for the dynamics of preferences, intentions and/or norms\n7. DEL and the problem of logical omniscience: the dynamics of inference and evidence; \napproaches to this based either on neighborhood semantics for DEL, and/or combinations of DEL with awareness logics or Justification Logic.\n8. Connections of DEL and Learning Theory, and their epistemological relevance.\n9. Quantum DEL: dynamic logics for quantum information\n10. DEL and issues in the pragmatics of communication and argumentation (dialogues, honesty, sincerity, persuasion, Gricean implicature, connections with the Dynamic Semantics of natural language etc).\n\n\n*April 23: \nEpistemology: the nature of knowledge and the Gettier challenge. The puzzle of the Perfect Believer. Strong beliefs and defeasible knowledge. The logic of the two ``knowledges". Other notions of knowledge.\n\n\n@@color(red): ''HOMEWORK 2''@@ (due on //Monday 7 May before 13:00 //)\n\n*May 7: Iterated upgrades. Infinite cycles versus stabilization of beliefs. Fixed points. The fixed-point conception of knowledge. Solution to the surprise exam paradox. \n\n*May 14: \n12:00-13:00: LECTURE 11 (in the NEW Werkcollege room, D1-110)\n13:00-15:00: LECTURE 11 continued (in the NEW Hoorcollege room: D1-114). \n\nMulti-agent plausibility models. Joint upgrades. Private learning and forms of lying. From preference aggregation to belief merge. Social Choice theory, Arrow's impossibility theorem and ways out. Parallel Merge, Lexicographic Merge and Relative Priority Merge. Event Plausibility Models and the Priority Update (lexicographic product). Axiomatization of soft (non-monotonic) DEL. \n\n\n\n*May 21: Long-term dynamics and truth-tracking: connections with Learning Theory and with Topological Epistemology. The importance of prior beliefs: relevance, simplicity and Ockham's Razor. The learning-theoretic limits of the AGM paradigm: non-wellfoundedness and omega-inconsistency of beliefs. The problems posed by Computable Learning: failure of Rational Monotonicity. Applications to decision theory and Game theory. Monty Hall. Backward Induction, elimination of dominated strategies, Nash equilibria, trembling hand and other solution concepts; their epistemic justifications; belief-revision strategies; puzzles and open problems: from epistemic democracy to the epistemic bandwagon effect; pluralistic ignorance, vicious doxastic cycles and informational cascades. Other topics in brief: Topological and neighborhood semantics for knowledge. PAL/DEL on topological/neighborhood models; logical omniscience revisited; awareness models, Justification Logic (Artemov) and the dynamics of evidence; counterfactuals and their dynamics; the causal-counterfactual conception of knowledge (Nozik, Dretske etc) and its dynamics; imprecise knowledge (Williamson etc) and its dynamics: vagueness, Sorites puzzle, ``safety" of knowledge and the ``margin for error". Correlated knowledge and ``Quantum DEL". The dynamics of preferences: voting, belief aggregation, social epistemology and group rationality. \nDynamic merge versus dynamic-as-merge. Voting paradoxes. Probabilistic reasoning: from Bayes to Popper. The Lottery Paradox. Lexicographic probabilities and their relation to plausibility models. Probabilistic DEL: monotonic (Bayesian) and non-monotonic (Popperian) versions. Axioms and Open Questions.\n\n
@@color(red):__''TOPICS IN DYNAMIC EPISTEMIC LOGIC''__@@\n(Spring 2013, ILLC, University of Amsterdam)\n\n@@color(blue):__''VERY IMPORTANT NOTE''__:@@ @@color(red): ''PLEASE PRESS THE `REFRESH' BUTTON __EVERY TIME__ YOU ACCESS THIS PAGE!!!''@@\n''Otherwise you will still see the old content (although the page IS periodically updated!).''\n\n\n\n__''Time''__\n\n\nTuesdays and Wednesdays 13:00-15:00;\nFridays 11:00-13:00.\n\n\n__''Place''__\n\nScience Park, in the following rooms: \n\nTuesdays: room G4-15\nWednesdays: room D1-114\nFridays: room F1-02\n\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistant (and Marker)''__\n\nSHENGYANG ZHONG \n\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures, please email them to me at //TheAlexandruBaltag@gmail.com// and, if necessary, make an appointment to see me.\n\n\n__''Objectives of Course''__\n\nFirst, to present to students the main concepts and formalism of Dynamic Epistemic Logic (DEL), including recent developments on connections to other fields (from Epistemology and Learning Theory to Game Theory, Social Software, Pragmatics, Quantum Information etc). Second, to enable students to acquire some research experience, by discussing some of the outstanding conceptual challenges in the field, as well as more technical open questions, and giving them guidance and encouragement to tackle some of these issues in their final projects.\n\n\n__''Contents''__\n\n\nThis course is addressed to students and researchers interested in logics for reasoning about multi-agent belief revision, belief updates and knowledge updates induced by various forms of communication or interaction. We start by presenting the main concepts of "standard DEL" (as covered e.g. in the book ``Dynamic Epistemic Logic" and in several ESSLLI courses with the same name): multi-agent epistemic Kripke models, public announcements, epistemic event models, product update, and the corresponding dynamic logics. Then we present the more recent "belief-revision-friendly" version of DEL and its main concepts (plausibility models, the Action-Priority Update), by combining the techniques of Dynamic Epistemic Logic with the insights and models from Belief Revision theory. We formalize various types of doxastic attitudes (belief, strong belief, safe belief, conditional belief, degrees of belief, group belief), notions of defeasible "knowledge", belief upgrades and belief-revision policies etc. We give some axiomatizations and apply these notions to communication strategies and the pragmatics of Natural Language, to rationality and strategic reasoning in Game Theory, to the formalization of key concepts in modern Epistemology, and to the analysis of various epistemic-doxastic paradoxes and puzzles (Fitch's knowability paradox, the Puzzle of the Perfect Believer, the Muddy Children, the Surprise Examination etc). Further, depending on time I might present various extensions of this setting (to dynamics of probabilistic beliefs, dynamics of evidence and justification etc), as well as recent work at the interface of DEL with Learning Theory, Epistemology, Social Choice theory, social-informational dynamics, Quantum Information, Secure Communication etc. We discuss some of the on-going conceptual challenges and the open technical questions encountered in the field, and we encourage and guide students to start tackling some of these problems. \n\n\n\n__''Recommended prior knowledge''__\n\nWe presuppose some (but very little) background knowledge in Logic: basically, the syntax and semantics of modal logic. This should be enough for understanding the course, though obviously having more prior knowledge can only lead to better final projects. Having some more advanced technical knowledge of Modal Logic theory would be very useful for tackling some of the open questions, but it is not required. Some familiarity with, or at least some interest in, any of the above-mentioned areas of intended application (Epistemology, Pragmatics, Game Theory, Multi-Agent Systems etc) would also be very welcome, and particularly useful for tackling some of the more conceptual challenges. Some basic knowledge of Probability Theory would also be useful for the understanding of some applications, but it is not really necessary for following the course More importantly, we assume that participants in the course possess both some degree of mathematical maturity (as can be expected from students in logic at a MSc level) and a live interest in interdisciplinary connections and applications of Logic. \n\n\n\n__''Format''__\n\nLectures.\n\n__''Study materials''__\n\nThere is //no main textbook// for this course. The principal material consists in ''slides'' of lectures, which will be regularly made available after each lecture. In addition, I will refer to a number of textbooks and materials, among which the most important are: \n\nA. Baltag, H. P. van Ditmarsch and L.S. Moss, ''Epistemic logic and information update'', in the //Handbook of Philosophy of Information// (Editors: P. Adriaans and J. van Benthem), part of the series Handbook of Philosophy of Science, vol. 8, pp. 361-455, Elsevier, 2008. Electronically available [[HERE|http://www.vub.ac.be/CLWF/SS/DELhandbookarticle.pdf]] \n\nJ. van Benthem, ''Logical Dynamics of Information and Interaction'', Cambridge Univ Press, 2011.\n\nH. P. van Ditmarsch, W. van der Hoek and B. Kooi , ''Dynamic Epistemic Logic'', Springer, 2007.\n\nR. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, ''Reasoning about Knowledge'', MIT Press, Cambridge MA 1995.\n\n\n\n__''Assessment''__\n\nTwo or three homework exercises (worth in total 30% of the final grade), plus a final paper or project (worth 70% of the final grade) on one of the topics investigated in the course. The exercises are individual (i.e. no collaboration), while the final papers can be jointly written by teams. The homework exercises will be mostly mathematical-technical, while the final paper/project could be mostly conceptual or philosophical (though may of course contain mathematical-logical parts). \n\n\n__''COURSE PLAN''__\n\nThe plan below is ''tentative''. It will be adjusted depending on time, students' feedback and interest etc. Each week, after the lecture, the slides of the covered material will be made available here, together with a brief summary of what was actually covered.\n\n ''WEEK 1'':\n\n*LECTURE 1.1 (February 5): Administration, Introduction: Motivation (philosophical, logical, computational etc). Main themes. Examples and Jokes. \n\n*LECTURE 1.2 (February 6): Epistemic Puzzles: the Coordinated Attack; 'To Learn is to Falsify': self-defeating truths, self-fulfilling falsehoods, and self-enabling falsehoods; the Muddy Children and the cheating husbands; breaking the rules: Sneaky Children and the dangers of mercy; surprised children: the Surprise Examination paradox; the Lottery paradox; the Centipedes Game and the Backward Induction paradox; the Wisdom of the Crowds and group knowledge; the Madness of the Crowds: informational cascades; epistemic bandwagon and pluralistic ignorance; the puzzle of the Perfect Stock Market Predictor.\n\n*LECTURE 1.3 (February 8): Single-Agent Epistemic/doxastic Logics: K, S5, S4, KD45. Sphere Models. Kripke Models, Epistemic Models, Doxastic Models. The problem of Introspection. The problem of logical omniscience.\n\n ''WEEK 2 '':\n\n*LECTURE 2.1 (February 12): Multi-agent Models. Common Knowledge and Common (true) Belief. Distributed Knowledge. The problem of belief aggregation. Dynamics: updates. Public Announcements. Fully Private Announcements. Fair-Game Announcements. Cheating, lying, mis-information. Secret interception of messages. \n\n*LECTURE 2.2 (February 13): PDL versus DEL. Logics talking about model changes. Dynamic modalities for epistemic actions. Syntax, Semantics and Axiomatization of PAL (Public Announcement Logic). Reduction laws and their uses. Co-expressivity of PAL and ML. Increase in Succinctness. Closure of public announcements under composition. PAC (=PAL with common knowledge): its increased expressivity; how to axiomatize it? \n\n*LECTURE 2.3 (February 15): Complete Axiomatizations of PAC. Application: formalizing Muddy Children. OTHER EXTENSIONS OF PAL: PAL with distributed knowledge. ``Tell us all you know". The Logic of Fully Private Announcements. \n\n\n ''WEEK 3'':\n\n*LECTURE 3.1 (February 19): ``STANDARD DEL": Epistemic Event Models and Product Update. Axiomatizations: Reduction Laws, the Action-Knowledge Axiom. Special cases: axioms for PAL and other announcement logics. EXTENSIONS OF DEL: Adding common knowledge to DEL: the problems for axiomatization, and ways to solve them. Composition of event models. \n\n*LECTURE 3.2 (February 20): Complete Axiomatization of DEL with common knowledge. The Action Rule. Example: the Private Announcement Rule. Extebsions of DEL: Adding iteration (Kleene star). Iterated PAL and undecidability. Arbitrary Announcement Logic. ``Learnability" and ``knowability" Applications: Fitch's Paradox and Verificationism. OTHER EXTENSIONS OF DEL: Fact-Changing Events. The problem of belief revision, revisited. \n\n*LECTURE 3.3 (February 22): Belief Revision Theory, AGM-style. Criticism. The AGM Postulates. Grove spheres, plausibility models, Spohn models. Conditional beliefs. Connections to non-monotonic logics, conditional logics and default logics. \n\n\n\n\n ''WEEK 4 '':\n\n*LECTURE 4.1 (February 26): The logic of conditional beliefs. DYNAMICS: soft upgrades; dynamic-doxastic attitudes as belief-revision policies. Strong beliefs and lexicographic (``radical") upgrade. Simple belief and minimal (``conservative") upgrade. Positive, negative and mixed attitudes: examples, definitions etc.\n\n*LECTURE 4.2 (February 27): EPISTEMOLOGY 1: the nature of knowledge and the Gettier challenge. The puzzle of the Perfect Believer. The Defeasibility Theory of Knowledge. Formalizing defeasible knowledge.\n\n*LECTURE 4.3 (March 1): The logic of the two ``knowledges". Other notions of knowledge: weak stability, knowledge as a fixed point. An 'Erlangen Program' for Epistemology. Long-term dynamics 1: iterated upgrades. Infinite cycles versus stabilization of beliefs. Fixed points. \n\n\n\n ''WEEK 5'':\n\n*LECTURE 5.1 (March 5): Solutions to the Surprise Exam Paradox. \n\n*LECTURE 5.2 (March 6): Multi-agent plausibility models. Common attitudes and joint upgrades. Axiomatization of soft (non-monotonic) DEL. Formalizing Dynamic-Doxastic Attitudes. The Mutual Trust Graph. Types of Lying and Cheating. Sincerity, Honesty and Persuasiveness. \n\n\n*LECTURE 5.3 (March 8): From preference aggregation to belief merge and group rationality. Social Choice theory, Arrow's impossibility theorem and ways out. Parallel Merge, Lexicographic Merge and Relative Priority Merge. Notions of group knowledge. Dynamic merge: merging beliefs by communication. The Power of Agendas.\n\n\n\n ''WEEK 6'':\n\n*LECTURE 6.1 (March 12): Information dynamics as a form of belief merge. Event Plausibility Models and the Action Priority Update. //Probabilistic reasoning//: from Bayes to Popper. Probabilistic modeling of qualitative beliefs: the Lockean Thesis. The Lottery Paradox. Bayesian update and the problem of belief revision. \n\n*LECTURE 6.2 (March 13): Conditional probabilistic spaces, lexicographic probabilities and their relation to plausibility models. Extending Bayesian conditioning to conditional probabilistic spaces: quantitative analogues of update, radical upgrade and conservative upgrade. Degree of safety of a belief.\n\n\n\n\n*LECTURE 6.3 (March 15): Probabilistic DEL. Dealing with evidence without logical omniscience: awareness models, Justification Logic and evidential dynamics. Evidence management and the need for the //yesterday// operator. Analysis of Gettier examples.\n\n ''WEEK 7'':\n\n*LECTURE 7.1 (March 19): Continuation of lecture on dynamics of Justification. Incorporating new evidence: the DEL of soft evidence and doxastic justification. Gettier examples continued.\n\n\n*LECTURE 7.2 (March 20): //Applications to Game theory//. Backward Induction, elimination of dominated strategies, Nash equilibria and other solution concepts: their epistemic justifications. Strategies as Conditional Beliefs. Common knowledge (common strong belief, common stable belief) of (substantive or dynamic) Rationality. Free Will and the Epistemic Openess of the Future. Optimistic versus Pessimistic Belief-Revision Strategies.\n\n*Lecture 7.3 (March 22): VARIOUS OTHER TOPICS:\n//Connections with Learning Theory//. Learnability: coming to know with certainty (finite identifiability). Coming to defeasibly know: identifiability in the limit. Conditions for learnability: Topological Epistemology. Learning via belief revision: the universality of updates. The importance of prior beliefs: relevance, simplicity and Ockham's Razor. The learning-theoretic limits of the AGM paradigm: non-wellfoundedness and omega-inconsistency of beliefs. The problems posed by Computable Learning: failure of Rational Monotonicity. //Probabilistic Learning. Social Learning and applications to Social Epistemology//. Social networks: from epistemic democracy to epistemic bandwagon effect. The Wisdom and the Madness of the Crowds: Condorcet's Jury Theorem, informational cascades, belief polarization, pluralistic ignorance. \n\n@@color(red): ''Possible Topics for Final Projects in this Course''@@\nThe largest component in your final grade is based on your final project. These projects should be pursued in groups or individually. No two groups can choose the same topic. The project work will consist in reading 2-4 papers on the topic, summarizing their technical content (together with all the needed background) in your own words, and discussing in writing EITHER the conceptual implications and philosophical issues, OR the technical open problems, arising from what you've read, OR BOTH. After you choose, I will provide you with some of the relevant papers, though finding new relevant papers and including an excellent bibliography is very much encouraged (and will be especially rewarded). AND (OF COURSE!), any new good ideas, new interesting settings or concepts, or new non-trivial technical developments, will be amply rewarded! But they are not absolutely necessary for getting a good grade. Here is a list of possible topics (though any other ideas concerning other topics are also welcome, provided that they are related to the course):\n\n1. Probabilistic belief dynamics and probabilistic DEL (and its possible uses in applications, philosophy etc)\n2. DEL and Game Theory (logical aspects of strategic reasoning, epistemic conditions for solution concepts etc)\n3. DEL and Epistemology (concepts of knowledge and their relation to belief, belief dynamics, justification etc)\n4. Concepts of `group knowledge', belief aggregation and the dynamics of a group's beliefs. \n5. DEL and Paradoxes (Fitch, Moore, Voorbrak, the Surprise Exam etc)\n6. Interrogative DEL: the dynamics of questions and answers\n7. Logics for the dynamics of preferences, intentions and/or norms\n8. DEL and the problem of logical omniscience: the dynamics of inference and evidence; \napproaches to this based either on neighborhood semantics for DEL, and/or combinations of DEL with awareness logics or Justification Logic.\n9. Connections of DEL and Learning Theory, and their epistemological relevance.\n10. Quantum DEL: dynamic logics for quantum information\n11. DEL and issues in the pragmatics of communication and argumentation (dialogues, honesty, sincerity, persuasion, Gricean implicature, connections with the Dynamic Semantics of natural language etc).\n\n\n
''TOPICS IN DYNAMIC EPISTEMIC LOGIC''\n\n(Spring 2014, ILLC, University of Amsterdam)\n\n@@VERY IMPORTANT NOTE: PLEASE PRESS THE `REFRESH' BUTTON EVERY TIME YOU ACCESS THIS PAGE!!!@@\nOtherwise you will still see the old content (although the page IS periodically updated!).\n\n__''Time and Place''__\n\n*Lectures: \n\nTuesdays 15:00-17:00 (SP room D1.114)\nThursdays 15:00-17:00 (SP room D1.114) and 17:00-19:00 (SP room D1.115).\n\n__''Instructor''__\n\nALEXANDRU BALTAG\n\n__''Teaching Assistants (and Markers)''__\n\nGiovanni Cina and Zoe Christoff.\n\n__''Office Hours and Email Inquiries''__\n\nIf you have any questions that were not answered in lectures, please email them to me at ~TheAlexandruBaltag@gmail.com and, if necessary, make an appointment to see me.\n\n__''Objectives of Course''__\n\nFirst, to present to students the main concepts and formalism of Dynamic Epistemic Logic (DEL), including recent developments on connections to other fields (from Epistemology and Learning Theory to Bayesian theory, Game Theory, Social Software, Pragmatics of Natural Language etc). Second, to enable students to acquire some research experience, by discussing some of the outstanding conceptual challenges in the field, as well as more technical open questions, and giving them guidance and encouragement to tackle some of these issues in their final projects.\n\n__''Contents''__\n\nThis course is addressed to students and researchers interested in logics for reasoning about multi-agent belief revision, belief updates and knowledge updates induced by various forms of communication or interaction. We start by presenting the main concepts of "standard DEL" (as covered e.g. in the book ``Dynamic Epistemic Logic" and in several ESSLLI courses with the same name): multi-agent epistemic Kripke models, public announcements, epistemic event models, product update, and the corresponding dynamic logics. Then we present the more recent "belief-revision-friendly" version of DEL and its main concepts (plausibility models, the Action Priority Update), by combining the techniques of Dynamic Epistemic Logic with the insights and models from Belief Revision theory. We formalize various types of doxastic attitudes (belief, strong belief, safe belief, conditional belief, degrees of belief, group belief), notions of defeasible "knowledge", belief upgrades and belief-revision policies etc. We give some axiomatizations and apply these notions to communication strategies and the pragmatics of Natural Language, to rationality and strategic reasoning in Game Theory, to the formalization of key concepts in modern Epistemology, and to the analysis of various epistemic-doxastic paradoxes and puzzles (Fitch's knowability paradox, the Puzzle of the Perfect Believer, the Muddy Children, the Surprise Examination etc). Further, depending on time I might present various extensions of this setting (to Bayesian dynamics of probabilistic beliefs, dynamics of evidence and justification etc), as well as recent work at the interface of DEL with Learning Theory, Epistemology, Social Choice theory, social-informational dynamics, Secure Communication, pragmatics etc. We discuss some of the on-going conceptual challenges and the open technical questions encountered in the field, and we encourage and guide students to start tackling some of these problems. \n\n__''Recommended prior knowledge''__\n\nWe presuppose some (but very little) background knowledge in Logic: basically, the syntax and semantics of modal logic. This should be enough for understanding the course, though obviously having more prior knowledge can only lead to better final projects. Having some more advanced technical knowledge of Modal Logic theory could be very useful for tackling some of the open questions, but it is not required. Some familiarity with, or at least some interest in, any of the above-mentioned areas of intended application (Epistemology, Pragmatics, Game Theory, ~Multi-Agent Systems etc) would also be very welcome, and particularly useful for tackling some of the more conceptual challenges. Some basic knowledge of Probability Theory would also be useful for the understanding of some applications, but it is not really necessary for following the course More importantly, we assume that participants in the course possess both some degree of mathematical maturity (as can be expected from students in logic at a ~MSc level) and a live interest in interdisciplinary connections and applications of Logic. \n\n__''Format''__\n\n*Lectures.\n*Study materials\n\n*There is no main textbook for this course. The principal material consists in slides of lectures, which will be regularly made available after each lecture. In addition, I will refer to a number of textbooks and materials, among which the most important are: \n\nA. Baltag, H. P. van Ditmarsch and L.S. Moss, Epistemic logic and information update, in the Handbook of Philosophy of Information (Editors: P. Adriaans and J. van Benthem), part of the series Handbook of Philosophy of Science, vol. 8, pp. 361-455, Elsevier, 2008. Electronically available [[HERE|http://www.vub.ac.be/CLWF/SS/DELhandbookarticle.pdf]] \n\nJ. van Benthem, Logical Dynamics of Information and Interaction, Cambridge Univ Press, 2011.\n\nH. P. van Ditmarsch, W. van der Hoek and B. Kooi , Dynamic Epistemic Logic, Springer, 2007.\n\nR. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, Reasoning about Knowledge, MIT Press, Cambridge MA 1995.\n\n__''Assessment''__\n\nTwo or three homework exercises (worth in total 20% of the final grade), plus a final paper or project (worth 80% of the final grade) on one of the topics investigated in the course. The exercises are individual (i.e. no collaboration), while the final papers can be jointly written by teams. The homework exercises will be mostly mathematical-technical, while the final paper/project could be conceptual/philosophical, or more technical-mathematical, or even more applied (computational), depending on each student's choice and interests. \n\n__''COURSE PLAN''__\n\nThe plan below is tentative. It will be adjusted depending on time, students' feedback and interest etc. Each week, after the lecture, the slides of the covered material will be made available here, together with a brief summary of what was actually covered.\n\n''WEEK 1:''\n\n*February 4: Administration, Introduction: Motivation (philosophical, logical, computational etc). Main themes. Examples and Jokes. Epistemic Puzzles: the Coordinated Attack; 'To Learn is to Falsify': self-defeating truths, self-fulfilling falsehoods, and self-enabling falsehoods. Distributed knowledge and common knowledge. The Muddy Children Puzzle.\n\n*February 6 (15:00-17:00): Epistemic Puzzles: From the Muddy Children to the cheating husbands. Breaking the rules: Sneaky Children and the dangers of mercy. Surprised children: the Surprise Examination paradox. The Lottery paradox. The Centipedes Game and the Backward Induction paradox. The Wisdom of the Crowds and group knowledge. The Madness of the Crowds: informational cascades; epistemic bandwagon and pluralistic ignorance. The puzzle of the Perfect Stock Market Predictor.\n\n*February 6 (17:00-19:00): ~Single-Agent Epistemic/doxastic Logics: K, S5, S4, ~KD45. Sphere Models. Kripke Models, Epistemic Models, Doxastic Models. The problem of Introspection. The problem of logical omniscience.\n\n\n\n\n''WEEK 2 :''\n\n*February 11: Multi-agent Models. Common Knowledge and Common (true) Belief. Distributed Knowledge. The problem of belief aggregation. Dynamics: updates. The problem of belief revision.\n\n*February 13 (15:00-17:00): Public Announcements. Fully Private Announcements. ~Fair-Game Announcements. Cheating, lying, misinformation. Secret interception of messages. PDL versus DEL. Logics talking about model changes. Dynamic modalities for epistemic actions. Syntax, Semantics and Axiomatization of PAL (Public Announcement Logic). Reduction laws and their uses. Co-expressivity of PAL and ML. Increase in Succinctness. Closure of public announcements under composition.\n\n*February 13 (17:00-19:00): PAC (=PAL with common knowledge): its increased expressivity. Complete Axiomatizations of PAC. Application: formalizing Muddy Children. \n\n\n\n''WEEK 3:''\n\n*February 18: OTHER EXTENSIONS OF PAL: PAL with distributed knowledge. ``Tell us all you know". The Logic of Fully Private Announcements. ``STANDARD DEL": Epistemic Event Models and Product Update. Examples.\n\n@@color(red):''Homework 1'' @@: The first homework set, due no later than Thursday 6 March at 15:00 noon, is available [[HERE|http://www.vub.ac.be/CLWF/SS/DEL_Homework1-2014.pdf]]. I strongly prefer typed answers (except for the drawings which can be handwritten), but if not then please type very clearly and leggible: it is your responsibility to make sure that the graders understand your writing. Please leave your answers in my mailbox at ILLC, or else hand them to me at the start of class, or else send them by email to me at //TheAlexandruBaltag@gmail.com//, with CC to my assistants at //zoe.christoff@gmail.com// and //giovanni.cina88@gmail.com//.\n\n\n\n\n*February 20 (15:00-17:00): Axiomatizations of DEL: Reduction Laws, the ~Action-Knowledge Axiom. Special cases: axioms for PAL and other announcement logics. EXTENSIONS OF DEL: Adding common knowledge to DEL: the problems for axiomatization, and ways to solve them. Composition of event models. Complete Axiomatization of DEL with common knowledge. The Action Rule. Example: the Private Announcement Rule. \n\n*February 20 (17:00-19:00): . OTHER EXTENSIONS OF DEL: Extensions of DEL: Adding iteration (Kleene star). Iterated PAL and undecidability. Arbitrary Announcement Logic. ``Learnability" and ``knowability" Applications: Fitch's Paradox and Verificationism. Fact-Changing Events. \n\n\n\n.\n''WEEK 4 :''\n\n*February 25: Belief Revision Theory ~AGM-style. Criticism. The AGM Postulates. Grove spheres, plausibility models, Spohn models. Conditional beliefs. Connections to non-monotonic logics, conditional logics and default logics.\nThe logic of conditional beliefs. \n\n\n*February 27 (15:00-18:00): DYNAMICS: soft upgrades; ~dynamic-doxastic attitudes as belief-revision policies. Strong beliefs and lexicographic (``radical") upgrade. Simple belief and minimal (``conservative") upgrade. Positive, negative and mixed attitudes: examples, definitions etc.\n\n\n''WEEK 5:''\n\n*March 4 (15:00-17:00): Long-term dynamics: iterated upgrades. Infinite cycles versus stabilization of beliefs. Fixed points. Solutions to the Surprise Exam Paradox.\n\n*March 6 (15:00-19:00): Epistemology: the nature of knowledge and the Gettier challenge. The puzzle of the Perfect Believer. The Defeasibility Theory of Knowledge. Formalizing defeasible knowledge. \n\n\n\n\n''WEEK 6:''\n\n*March 11 (15:00-17:00): Finishing Epistemology lecture: The logic of the two ``knowledges". Other notions of knowledge: weak stability, knowledge as a fixed point. An 'Erlangen Program' for Epistemology. Multi-agent plausibility models. \n\n\n*March 13 (15:00-19:00): Common attitudes and joint upgrades. Axiomatization of soft (non-monotonic) DEL. Formalizing ~Dynamic-Doxastic Attitudes. The Mutual Trust Graph. Types of Lying and Cheating. Sincerity, Honesty and Persuasiveness.From preference aggregation to belief merge and group rationality. Social Choice theory, Arrow's impossibility theorem and ways out. Parallel Merge, Lexicographic Merge and Relative Priority Merge. Notions of group knowledge. Dynamic merge: merging beliefs by communication. The Power of Agendas. Information dynamics as a form of belief merge. Event Plausibility Models and the Action Priority Update. \n\n\n\n''WEEK 7:''\n\n*March 18 (15:00-17:00): Probabilistic reasoning: from Bayes to Popper. Probabilistic modeling of qualitative beliefs: the Lockean Thesis. The Lottery Paradox. Bayesian update and the problem of belief revision. Conditional probabilistic spaces, lexicographic probabilities and their relation to plausibility models. Extending Bayesian conditioning to conditional probabilistic spaces: quantitative analogues of update, radical upgrade and conservative upgrade. \n\n\n*March 20 (15:00-19:00): Probabilistic analogues of defeasible knowledge. Degree of safety of a belief. Degree of strength and Leitgeb's stability theory of belief. Probabilistic DEL and probabilistic event models. Probabilistic Learning. Applications to Social Epistemology. Social networks: from epistemic democracy to epistemic bandwagon effect. The Wisdom and the Madness of the Crowds: Condorcet's Jury Theorem, informational cascades, belief polarization, pluralistic ignorance.\n\n\nANNEX 1: Dealing with evidence without logical omniscience: awareness models, Justification Logic and evidential dynamics. Evidence management and the need for the yesterday operator. Analysis of Gettier examples. Incorporating new evidence: the DEL of soft evidence and doxastic justification. Gettier examples continued. You can find this [[HERE|http://www.vub.ac.be/CLWF/SS/DEL7.1-2013.pdf]] . For more details, please write me and I can send you the full paper.\n\nANNEX 2: Applications to Game theory. Backward Induction, elimination of dominated strategies, Nash equilibria and other solution concepts: their epistemic justifications. Strategies as Conditional Beliefs. Common knowledge (common strong belief, common stable belief) of (substantive or dynamic) Rationality. Free Will and the Epistemic Openess of the Future. Optimistic versus Pessimistic Belief-Revision Strategies. You can find this [[HERE|http://www.vub.ac.be/CLWF/SS/DEL7.2-2013.pdf]] . For more details, please write me and I can send you the full paper.\n\nANNEX 3: Connections with Learning Theory. Learnability: coming to know with certainty (finite identifiability). Coming to defeasibly know: identifiability in the limit. Conditions for learnability: Topological Epistemology. Learning via belief revision: the universality of updates. The importance of prior beliefs: relevance, simplicity and Ockham's Razor. The ~learning-theoretic limits of the AGM paradigm: ~non-wellfoundedness and omega-inconsistency of beliefs. The problems posed by Computable Learning: failure of Rational Monotonicity. You can find this [[HERE|http://www.vub.ac.be/CLWF/SS/DEL7.3-2013.pdf]] \n\n\n \n\n@@Possible Topics for Final Projects in this Course@@\nThe largest component in your final grade is based on your final project. These projects should be pursued in small groups (2-3 students) or individually. No two groups can choose the same topic. The project work will consist in reading 2-4 papers on the topic, summarizing their technical content (together with all the needed background) in your own words, and discussing in writing EITHER the conceptual implications and philosophical issues, OR the technical open problems, arising from what you've read, OR BOTH. After you choose, I will provide you with some of the relevant papers, though finding new relevant papers and including an excellent bibliography is very much encouraged (and will be especially rewarded). AND (OF COURSE!), any new good ideas, new interesting settings or concepts, or new non-trivial technical developments, will be amply rewarded! But they are not absolutely necessary for getting a good grade. Here is a list of possible topics (though any other ideas concerning other topics are also welcome, provided that they are related to the course):\n\n1. Probabilistic belief dynamics and probabilistic DEL (and its possible uses in applications, philosophy etc)\n2. DEL and Game Theory (logical aspects of strategic reasoning, epistemic conditions for solution concepts etc)\n3. DEL and Epistemology (concepts of knowledge and their relation to belief, belief dynamics, justification etc)\n4. Concepts of `group knowledge', belief aggregation and the dynamics of a group's beliefs. \n5. DEL and Paradoxes (Fitch, Moore, Voorbraak, the Surprise Exam etc)\n6. Interrogative DEL: the dynamics of questions and answers\n7. Logics for the dynamics of preferences, intentions and/or norms\n8. DEL and the problem of logical omniscience: the dynamics of inference and evidence.\n9. Connections between DEL and Learning Theory.\n10. Quantum DEL: dynamic logics for quantum information\n11. DEL and issues in the pragmatics of communication and argumentation (dialogues, honesty, sincerity, persuasion, Gricean implicature, connections with the Dynamic Semantics of natural language etc).\n12. Topological semantics for knowledge, belief, evidence and learning.
/***\nContains the stuff you need to use Tiddlyspot\nNote you must also have UploadPlugin installed\n***/\n//{{{\n\n// edit this if you are migrating sites or retrofitting an existing TW\nconfig.tiddlyspotSiteId = 'alexandru';\n\n// make it so you can by default see edit controls via http\nconfig.options.chkHttpReadOnly = false;\nwindow.readOnly = false; // make sure of it (for tw 2.2)\n\n// disable autosave in d3\nif (window.location.protocol != "file:")\n config.options.chkGTDLazyAutoSave = false;\n\n// tweak shadow tiddlers to add upload button, password entry box etc\nwith (config.shadowTiddlers) {\n SiteUrl = 'http://'+config.tiddlyspotSiteId+'.tiddlyspot.com';\n SideBarOptions = SideBarOptions.replace(/(<<saveChanges>>)/,"$1<<tiddler TspotSidebar>>");\n OptionsPanel = OptionsPanel.replace(/^/,"<<tiddler TspotOptions>>");\n DefaultTiddlers = DefaultTiddlers.replace(/^/,"[[Welcome to Tiddlyspot]] ");\n MainMenu = MainMenu.replace(/^/,"[[Welcome to Tiddlyspot]] ");\n}\n\n// create some shadow tiddler content\nmerge(config.shadowTiddlers,{\n\n'Welcome to Tiddlyspot':[\n "This document is a ~TiddlyWiki from tiddlyspot.com. A ~TiddlyWiki is an electronic notebook that is great for managing todo lists, personal information, and all sorts of things.",\n "",\n "@@font-weight:bold;font-size:1.3em;color:#444; //What now?// &nbsp;&nbsp;@@ Before you can save any changes, you need to enter your password in the form below. Then configure privacy and other site settings at your [[control panel|http://" + config.tiddlyspotSiteId + ".tiddlyspot.com/controlpanel]] (your control panel username is //" + config.tiddlyspotSiteId + "//).",\n "<<tiddler TspotControls>>",\n "See also GettingStarted.",\n "",\n "@@font-weight:bold;font-size:1.3em;color:#444; //Working online// &nbsp;&nbsp;@@ You can edit this ~TiddlyWiki right now, and save your changes using the \s"save to web\s" button in the column on the right.",\n "",\n "@@font-weight:bold;font-size:1.3em;color:#444; //Working offline// &nbsp;&nbsp;@@ A fully functioning copy of this ~TiddlyWiki can be saved onto your hard drive or USB stick. You can make changes and save them locally without being connected to the Internet. When you're ready to sync up again, just click \s"upload\s" and your ~TiddlyWiki will be saved back to tiddlyspot.com.",\n "",\n "@@font-weight:bold;font-size:1.3em;color:#444; //Help!// &nbsp;&nbsp;@@ Find out more about ~TiddlyWiki at [[TiddlyWiki.com|http://tiddlywiki.com]]. Also visit [[TiddlyWiki Guides|http://tiddlywikiguides.org]] for documentation on learning and using ~TiddlyWiki. New users are especially welcome on the [[TiddlyWiki mailing list|http://groups.google.com/group/TiddlyWiki]], which is an excellent place to ask questions and get help. If you have a tiddlyspot related problem email [[tiddlyspot support|mailto:support@tiddlyspot.com]].",\n "",\n "@@font-weight:bold;font-size:1.3em;color:#444; //Enjoy :)// &nbsp;&nbsp;@@ We hope you like using your tiddlyspot.com site. Please email [[feedback@tiddlyspot.com|mailto:feedback@tiddlyspot.com]] with any comments or suggestions."\n].join("\sn"),\n\n'TspotControls':[\n "| tiddlyspot password:|<<option pasUploadPassword>>|",\n "| site management:|<<upload http://" + config.tiddlyspotSiteId + ".tiddlyspot.com/store.cgi index.html . . " + config.tiddlyspotSiteId + ">>//(requires tiddlyspot password)//<<br>>[[control panel|http://" + config.tiddlyspotSiteId + ".tiddlyspot.com/controlpanel]], [[download (go offline)|http://" + config.tiddlyspotSiteId + ".tiddlyspot.com/download]]|",\n "| links:|[[tiddlyspot.com|http://tiddlyspot.com/]], [[FAQs|http://faq.tiddlyspot.com/]], [[announcements|http://announce.tiddlyspot.com/]], [[blog|http://tiddlyspot.com/blog/]], email [[support|mailto:support@tiddlyspot.com]] & [[feedback|mailto:feedback@tiddlyspot.com]], [[donate|http://tiddlyspot.com/?page=donate]]|"\n].join("\sn"),\n\n'TspotSidebar':[\n "<<upload http://" + config.tiddlyspotSiteId + ".tiddlyspot.com/store.cgi index.html . . " + config.tiddlyspotSiteId + ">><html><a href='http://" + config.tiddlyspotSiteId + ".tiddlyspot.com/download' class='button'>download</a></html>"\n].join("\sn"),\n\n'TspotOptions':[\n "tiddlyspot password:",\n "<<option pasUploadPassword>>",\n ""\n].join("\sn")\n\n});\n//}}}\n
| !date | !user | !location | !storeUrl | !uploadDir | !toFilename | !backupdir | !origin |\n| 12/9/2007 17:3:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 17:3:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 12/9/2007 17:5:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 12/9/2007 17:13:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#SiteSubTitle]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 18:25:0 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 18:35:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 18:35:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 12/9/2007 18:39:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 18:39:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 12/9/2007 18:44:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 19:0:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2007 20:45:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/9/2007 16:37:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 13/9/2007 16:37:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/9/2007 18:28:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 14/9/2007 18:30:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/11/2008 18:28:0 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 18:28:28 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/11/2008 19:41:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 19:44:6 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 20:12:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 20:33:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 21:9:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 21:23:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/11/2008 21:24:24 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 21/11/2008 21:28:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 22:12:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 22:12:25 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 22:15:25 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/11/2008 22:31:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 23:14:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/11/2008 23:23:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/11/2008 23:23:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 21/11/2008 23:32:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/11/2008 23:33:23 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 21/11/2008 23:36:56 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/11/2008 0:44:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 0:58:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:0:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:1:40 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:2:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:6:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:7:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/11/2008 1:8:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 22/11/2008 1:9:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:9:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:10:8 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:12:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:14:6 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/11/2008 1:14:17 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 22/11/2008 1:15:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:21:23 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:22:17 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:24:0 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:40:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/11/2008 1:41:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/11/2008 3:18:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 28/1/2009 16:47:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/7/2009 2:58:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/7/2009 3:3:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/7/2009 3:8:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/7/2009 3:24:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/7/2009 3:24:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/7/2009 3:26:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/7/2009 15:59:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/7/2009 16:2:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 29/7/2009 15:34:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 29/7/2009 15:53:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 31/7/2009 11:23:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/8/2009 12:6:35 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/8/2009 11:53:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 19:41:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 19:59:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 20:3:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 20:13:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 20:23:0 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 20:24:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 20:45:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 21:8:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 21:41:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 21:43:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 21:57:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 21:58:23 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 21:58:29 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 21:59:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 22:0:21 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 22:0:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 22:7:35 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 22:14:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 22:23:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/12/2009 22:28:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 22:29:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 22:31:28 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 22:44:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 22:57:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/12/2009 23:38:24 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 0:10:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 0:10:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 0:12:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 0:21:13 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/12/2009 14:59:7 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 14:59:51 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 15:10:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 15:49:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/12/2009 15:51:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 15:56:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 15:58:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 21:13:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 21:54:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 21:55:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 21:56:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:4:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:24:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:28:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:35:30 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:40:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:44:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/12/2009 22:46:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/12/2009 2:31:30 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/12/2009 2:33:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/12/2009 2:35:18 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/12/2009 2:36:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/12/2009 2:36:23 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/12/2009 3:0:35 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/12/2009 3:2:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/12/2009 21:1:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 16/12/2009 16:22:6 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/2/2010 14:26:3 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/7/2010 23:50:18 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/7/2010 23:53:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/7/2010 23:57:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 6/7/2010 0:3:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 6/7/2010 0:14:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 6/7/2010 0:19:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 6/7/2010 0:21:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:8:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 23/10/2010 16:15:15 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 23/10/2010 16:20:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:27:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:27:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:27:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:27:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:28:3 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/10/2010 16:28:6 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 23/10/2010 16:28:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/9/2011 0:1:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/9/2011 0:19:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/9/2011 0:41:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/9/2011 0:43:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/9/2011 0:47:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/9/2011 17:57:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 17:57:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/9/2011 17:58:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 5/9/2011 18:12:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 18:14:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/9/2011 18:44:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/9/2011 19:25:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/9/2011 20:37:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 20:39:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 20:40:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 20:53:15 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 20:54:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 20:55:35 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/9/2011 21:2:13 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/9/2011 2:22:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/9/2011 2:26:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/9/2011 2:34:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/9/2011 17:27:7 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/9/2011 21:1:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/9/2011 21:22:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 11/9/2011 21:23:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/9/2011 21:39:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2011 13:40:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/9/2011 15:17:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/9/2011 18:37:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 14/9/2011 18:40:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/9/2011 20:58:32 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 14/9/2011 20:59:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/9/2011 21:26:20 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/9/2011 18:33:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/9/2011 19:7:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/9/2011 19:13:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/10/2011 16:33:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/10/2011 16:36:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/10/2011 16:37:40 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/10/2011 17:16:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/10/2011 17:18:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/10/2011 19:40:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/10/2011 3:0:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/10/2011 3:10:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/10/2011 3:13:7 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/10/2011 3:14:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/10/2011 18:37:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2011 4:23:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2011 4:37:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2011 4:40:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2011 14:44:20 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2011 14:49:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 1/11/2011 11:45:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/11/2011 13:36:13 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/11/2011 13:52:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/11/2011 13:56:51 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/11/2011 21:41:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/11/2011 21:51:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 19/11/2011 1:17:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/11/2011 20:40:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 30/11/2011 22:30:56 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/12/2011 21:15:8 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/12/2011 17:3:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/12/2011 10:57:28 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/12/2011 11:1:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/12/2011 1:33:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/2/2012 19:58:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 5/2/2012 20:1:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/2/2012 2:58:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/2/2012 22:50:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/2/2012 22:57:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/2/2012 1:54:18 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/2/2012 1:58:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/2/2012 7:21:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/2/2012 7:23:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/2/2012 23:56:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/2/2012 1:10:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/2/2012 21:13:3 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 8/2/2012 21:14:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/2/2012 2:0:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 15/2/2012 2:6:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/2/2012 3:7:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/2/2012 9:8:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/2/2012 9:12:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/2/2012 19:43:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 25/2/2012 20:0:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 28/2/2012 9:25:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 28/2/2012 9:28:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 29/2/2012 19:55:3 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 29/2/2012 19:59:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/3/2012 19:32:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/3/2012 19:41:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/3/2012 18:23:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/3/2012 0:34:15 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/3/2012 4:16:22 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 10/3/2012 20:36:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/3/2012 22:9:30 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/3/2012 21:27:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/3/2012 13:10:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/3/2012 14:12:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 18/3/2012 14:41:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/3/2012 21:38:50 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/3/2012 21:56:17 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 21/3/2012 22:2:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BAxiomatic%20Set%20Theory%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/3/2012 22:15:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/4/2012 22:11:15 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/4/2012 19:18:3 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/4/2012 9:45:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 18/4/2012 13:27:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 18/4/2012 13:29:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 18/4/2012 13:31:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/4/2012 18:1:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/4/2012 22:37:28 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/4/2012 21:26:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/5/2012 2:40:29 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/5/2012 2:41:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/5/2012 13:18:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/5/2012 4:49:6 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 19/5/2012 8:18:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/7/2012 6:25:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/8/2012 23:42:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/8/2012 23:53:24 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 15/8/2012 0:47:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/8/2012 0:49:9 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/8/2012 0:49:17 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 15/8/2012 0:53:7 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 17/8/2012 0:42:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/8/2012 17:5:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2012 10:54:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2012 11:38:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 4/9/2012 11:44:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2012 11:50:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/9/2012 11:28:23 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/9/2012 4:39:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 6/9/2012 4:40:59 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/9/2012 15:19:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/9/2012 10:50:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/9/2012 10:50:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/9/2012 10:50:43 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/8/2012 10:48:8 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 12/8/2012 10:48:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/8/2012 11:8:51 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/8/2012 10:20:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/8/2012 10:48:29 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 25/8/2012 10:49:7 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/8/2012 11:54:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 31/8/2012 19:56:0 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/9/2012 11:40:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 7/9/2012 20:44:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 7/9/2012 20:45:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#TEACHING]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 10/9/2012 1:55:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 16/10/2012 20:24:25 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 16/10/2012 20:25:18 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 18/9/2012 22:25:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 24/9/2012 13:30:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 29/10/2012 19:34:7 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 29/10/2012 19:34:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 29/10/2012 19:34:29 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/11/2012 20:21:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/11/2012 23:0:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/11/2012 23:22:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/11/2012 19:29:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/11/2012 8:7:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 15/11/2012 8:15:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/11/2012 8:15:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/11/2012 18:59:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author%3Atrue]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/11/2012 23:50:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/11/2012 18:19:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/12/2012 1:11:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/12/2012 19:43:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/12/2012 16:57:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/1/2013 19:53:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2013 19:4:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2013 19:25:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2013 19:41:35 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2013 20:35:24 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2013 20:41:24 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2013 20:50:35 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2013 20:50:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2013 21:20:56 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2013 21:22:0 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/2/2013 15:40:53 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/2/2013 21:57:30 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/2/2013 19:31:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/2/2013 19:56:40 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/2/2013 12:0:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/2/2013 20:42:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/2/2013 6:31:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 17/2/2013 1:30:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 19/2/2013 23:7:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/2/2013 9:36:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/2/2013 9:40:56 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 22/2/2013 14:7:40 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 22/2/2013 14:8:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 24/2/2013 22:53:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 28/2/2013 1:6:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/3/2013 14:27:21 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 3/3/2013 22:1:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/3/2013 12:13:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/3/2013 22:36:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/3/2013 19:21:30 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/3/2013 19:59:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/3/2013 0:28:5 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/3/2013 0:32:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/3/2013 0:36:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 24/3/2013 13:5:3 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 30/3/2013 20:33:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 3/9/2013 23:31:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2013 10:56:23 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 4/9/2013 10:57:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 4/9/2013 10:58:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 4/9/2013 10:59:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2013 11:29:50 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 4/9/2013 11:30:55 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2013 11:37:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2013 11:43:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/9/2013 21:14:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/9/2013 20:35:42 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 11/9/2013 20:47:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/9/2013 20:47:14 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202012-2013%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 21/9/2013 15:45:45 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/9/2013 10:44:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/9/2013 21:28:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/10/2013 0:49:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 2/10/2013 0:56:56 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 2/10/2013 1:0:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 3/10/2013 22:42:7 | | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 3/10/2013 22:45:24 | | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 3/10/2013 22:48:9 | | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 3/10/2013 22:49:27 | | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 3/10/2013 22:52:4 | | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/10/2013 9:45:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/10/2013 9:45:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2013 21:0:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202013-2014%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 25/10/2013 21:0:39 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202013-2014%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok | Ok |\n| 25/10/2013 21:0:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202013-2014%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/10/2013 1:16:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 31/10/2013 7:51:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 5/11/2013 19:43:36 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/11/2013 20:16:41 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202013-2014%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/11/2013 20:16:51 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202013-2014%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 8/11/2013 13:17:54 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 13/11/2013 19:34:4 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 18/11/2013 14:57:44 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 18/11/2013 14:59:16 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 20/11/2013 17:55:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 20/11/2013 18:4:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#%5B%5BIntroduction%20to%20Modal%20Logic%202013-2014%5D%5D]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/11/2013 18:12:28 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 29/11/2013 21:13:52 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 29/11/2013 21:15:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 1/12/2013 4:44:58 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 1/12/2013 4:45:29 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2014 19:7:2 | YourName | [[index.20140124.1442290000.html|http://alexandru.tiddlyspot.com/_sites/a/al/ale/alexandru/backup/index.20140124.1442290000.html#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2014 19:12:56 | YourName | [[index.20140124.1442290000.html|http://alexandru.tiddlyspot.com/_sites/a/al/ale/alexandru/backup/index.20140124.1442290000.html#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2014 19:18:27 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 27/1/2014 19:34:5 | alexandru | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2014 19:34:19 | | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2014 19:34:51 | alexandru | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 27/1/2014 19:35:15 | alexandru | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 3/2/2014 17:41:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 3/2/2014 18:48:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/2/2014 17:20:40 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/2/2014 17:32:47 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/2/2014 18:50:57 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/2/2014 11:38:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 9/2/2014 11:39:33 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 11/2/2014 22:33:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 15/2/2014 16:20:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 20/2/2014 0:46:17 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 24/2/2014 8:0:29 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/3/2014 13:9:34 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/3/2014 11:53:40 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/3/2014 23:1:32 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/3/2014 23:12:12 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 12/3/2014 2:26:48 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 14/3/2014 12:9:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 20/3/2014 14:39:19 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 20/3/2014 19:58:28 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 4/5/2014 21:42:10 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 9/5/2014 11:42:24 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 23/6/2014 18:27:21 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/10/2014 18:43:25 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 26/10/2014 19:45:46 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 26/10/2014 19:50:31 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/10/2014 20:6:7 | YourName | [[index.20141026.1153090000.html|http://alexandru.tiddlyspot.com/_sites/a/al/ale/alexandru/backup/index.20141026.1153090000.html#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 26/10/2014 20:6:22 | YourName | [[index.20141026.1153090000.html|http://alexandru.tiddlyspot.com/_sites/a/al/ale/alexandru/backup/index.20141026.1153090000.html#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 26/10/2014 20:18:20 | YourName | [[index.20141026.1153090000.html|http://alexandru.tiddlyspot.com/_sites/a/al/ale/alexandru/backup/index.20141026.1153090000.html#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/10/2014 20:26:38 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 26/10/2014 21:11:26 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 26/10/2014 21:14:37 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 28/10/2014 20:10:2 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . | Ok |\n| 28/10/2014 20:11:49 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 28/10/2014 20:14:11 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 30/10/2014 19:59:51 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 6/11/2014 19:43:56 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |\n| 18/11/2014 13:26:1 | YourName | [[/|http://alexandru.tiddlyspot.com/#author:true]] | [[store.cgi|http://alexandru.tiddlyspot.com/store.cgi]] | . | index.html | . |
/***\n|''Name:''|UploadPlugin|\n|''Description:''|Save to web a TiddlyWiki|\n|''Version:''|3.4.5|\n|''Date:''|Oct 15, 2006|\n|''Source:''|http://tiddlywiki.bidix.info/#UploadPlugin|\n|''Documentation:''|http://tiddlywiki.bidix.info/#UploadDoc|\n|''Author:''|BidiX (BidiX (at) bidix (dot) info)|\n|''License:''|[[BSD open source license|http://tiddlywiki.bidix.info/#%5B%5BBSD%20open%20source%20license%5D%5D ]]|\n|''~CoreVersion:''|2.0.0|\n|''Browser:''|Firefox 1.5; InternetExplorer 6.0; Safari|\n|''Include:''|config.lib.file; config.lib.log; config.lib.options; PasswordTweak|\n|''Require:''|[[UploadService|http://tiddlywiki.bidix.info/#UploadService]]|\n***/\n//{{{\nversion.extensions.UploadPlugin = {\n major: 3, minor: 4, revision: 5, \n date: new Date(2006,9,15),\n source: 'http://tiddlywiki.bidix.info/#UploadPlugin',\n documentation: 'http://tiddlywiki.bidix.info/#UploadDoc',\n author: 'BidiX (BidiX (at) bidix (dot) info',\n license: '[[BSD open source license|http://tiddlywiki.bidix.info/#%5B%5BBSD%20open%20source%20license%5D%5D]]',\n coreVersion: '2.0.0',\n browser: 'Firefox 1.5; InternetExplorer 6.0; Safari'\n};\n//}}}\n\n////+++!![config.lib.file]\n\n//{{{\nif (!config.lib) config.lib = {};\nif (!config.lib.file) config.lib.file= {\n author: 'BidiX',\n version: {major: 0, minor: 1, revision: 0}, \n date: new Date(2006,3,9)\n};\nconfig.lib.file.dirname = function (filePath) {\n var lastpos;\n if ((lastpos = filePath.lastIndexOf("/")) != -1) {\n return filePath.substring(0, lastpos);\n } else {\n return filePath.substring(0, filePath.lastIndexOf("\s\s"));\n }\n};\nconfig.lib.file.basename = function (filePath) {\n var lastpos;\n if ((lastpos = filePath.lastIndexOf("#")) != -1) \n filePath = filePath.substring(0, lastpos);\n if ((lastpos = filePath.lastIndexOf("/")) != -1) {\n return filePath.substring(lastpos + 1);\n } else\n return filePath.substring(filePath.lastIndexOf("\s\s")+1);\n};\nwindow.basename = function() {return "@@deprecated@@";};\n//}}}\n////===\n\n////+++!![config.lib.log]\n\n//{{{\nif (!config.lib) config.lib = {};\nif (!config.lib.log) config.lib.log= {\n author: 'BidiX',\n version: {major: 0, minor: 1, revision: 1}, \n date: new Date(2006,8,19)\n};\nconfig.lib.Log = function(tiddlerTitle, logHeader) {\n if (version.major < 2)\n this.tiddler = store.tiddlers[tiddlerTitle];\n else\n this.tiddler = store.getTiddler(tiddlerTitle);\n if (!this.tiddler) {\n this.tiddler = new Tiddler();\n this.tiddler.title = tiddlerTitle;\n this.tiddler.text = "| !date | !user | !location |" + logHeader;\n this.tiddler.created = new Date();\n this.tiddler.modifier = config.options.txtUserName;\n this.tiddler.modified = new Date();\n if (version.major < 2)\n store.tiddlers[tiddlerTitle] = this.tiddler;\n else\n store.addTiddler(this.tiddler);\n }\n return this;\n};\n\nconfig.lib.Log.prototype.newLine = function (line) {\n var now = new Date();\n var newText = "| ";\n newText += now.getDate()+"/"+(now.getMonth()+1)+"/"+now.getFullYear() + " ";\n newText += now.getHours()+":"+now.getMinutes()+":"+now.getSeconds()+" | ";\n newText += config.options.txtUserName + " | ";\n var location = document.location.toString();\n var filename = config.lib.file.basename(location);\n if (!filename) filename = '/';\n newText += "[["+filename+"|"+location + "]] |";\n this.tiddler.text = this.tiddler.text + "\sn" + newText;\n this.addToLine(line);\n};\n\nconfig.lib.Log.prototype.addToLine = function (text) {\n this.tiddler.text = this.tiddler.text + text;\n this.tiddler.modifier = config.options.txtUserName;\n this.tiddler.modified = new Date();\n if (version.major < 2)\n store.tiddlers[this.tiddler.tittle] = this.tiddler;\n else {\n store.addTiddler(this.tiddler);\n story.refreshTiddler(this.tiddler.title);\n store.notify(this.tiddler.title, true);\n }\n if (version.major < 2)\n store.notifyAll(); \n};\n//}}}\n////===\n\n////+++!![config.lib.options]\n\n//{{{\nif (!config.lib) config.lib = {};\nif (!config.lib.options) config.lib.options = {\n author: 'BidiX',\n version: {major: 0, minor: 1, revision: 0}, \n date: new Date(2006,3,9)\n};\n\nconfig.lib.options.init = function (name, defaultValue) {\n if (!config.options[name]) {\n config.options[name] = defaultValue;\n saveOptionCookie(name);\n }\n};\n//}}}\n////===\n\n////+++!![PasswordTweak]\n\n//{{{\nversion.extensions.PasswordTweak = {\n major: 1, minor: 0, revision: 3, date: new Date(2006,8,30),\n type: 'tweak',\n source: 'http://tiddlywiki.bidix.info/#PasswordTweak'\n};\n//}}}\n/***\n!!config.macros.option\n***/\n//{{{\nconfig.macros.option.passwordCheckboxLabel = "Save this password on this computer";\nconfig.macros.option.passwordType = "password"; // password | text\n\nconfig.macros.option.onChangeOption = function(e)\n{\n var opt = this.getAttribute("option");\n var elementType,valueField;\n if(opt) {\n switch(opt.substr(0,3)) {\n case "txt":\n elementType = "input";\n valueField = "value";\n break;\n case "pas":\n elementType = "input";\n valueField = "value";\n break;\n case "chk":\n elementType = "input";\n valueField = "checked";\n break;\n }\n config.options[opt] = this[valueField];\n saveOptionCookie(opt);\n var nodes = document.getElementsByTagName(elementType);\n for(var t=0; t<nodes.length; t++) \n {\n var optNode = nodes[t].getAttribute("option");\n if (opt == optNode) \n nodes[t][valueField] = this[valueField];\n }\n }\n return(true);\n};\n\nconfig.macros.option.handler = function(place,macroName,params)\n{\n var opt = params[0];\n if(config.options[opt] === undefined) {\n return;}\n var c;\n switch(opt.substr(0,3)) {\n case "txt":\n c = document.createElement("input");\n c.onkeyup = this.onChangeOption;\n c.setAttribute ("option",opt);\n c.className = "txtOptionInput "+opt;\n place.appendChild(c);\n c.value = config.options[opt];\n break;\n case "pas":\n // input password\n c = document.createElement ("input");\n c.setAttribute("type",config.macros.option.passwordType);\n c.onkeyup = this.onChangeOption;\n c.setAttribute("option",opt);\n c.className = "pasOptionInput "+opt;\n place.appendChild(c);\n c.value = config.options[opt];\n // checkbox link with this password "save this password on this computer"\n c = document.createElement("input");\n c.setAttribute("type","checkbox");\n c.onclick = this.onChangeOption;\n c.setAttribute("option","chk"+opt);\n c.className = "chkOptionInput "+opt;\n place.appendChild(c);\n c.checked = config.options["chk"+opt];\n // text savePasswordCheckboxLabel\n place.appendChild(document.createTextNode(config.macros.option.passwordCheckboxLabel));\n break;\n case "chk":\n c = document.createElement("input");\n c.setAttribute("type","checkbox");\n c.onclick = this.onChangeOption;\n c.setAttribute("option",opt);\n c.className = "chkOptionInput "+opt;\n place.appendChild(c);\n c.checked = config.options[opt];\n break;\n }\n};\n//}}}\n/***\n!! Option cookie stuff\n***/\n//{{{\nwindow.loadOptionsCookie_orig_PasswordTweak = window.loadOptionsCookie;\nwindow.loadOptionsCookie = function()\n{\n var cookies = document.cookie.split(";");\n for(var c=0; c<cookies.length; c++) {\n var p = cookies[c].indexOf("=");\n if(p != -1) {\n var name = cookies[c].substr(0,p).trim();\n var value = cookies[c].substr(p+1).trim();\n switch(name.substr(0,3)) {\n case "txt":\n config.options[name] = unescape(value);\n break;\n case "pas":\n config.options[name] = unescape(value);\n break;\n case "chk":\n config.options[name] = value == "true";\n break;\n }\n }\n }\n};\n\nwindow.saveOptionCookie_orig_PasswordTweak = window.saveOptionCookie;\nwindow.saveOptionCookie = function(name)\n{\n var c = name + "=";\n switch(name.substr(0,3)) {\n case "txt":\n c += escape(config.options[name].toString());\n break;\n case "chk":\n c += config.options[name] ? "true" : "false";\n // is there an option link with this chk ?\n if (config.options[name.substr(3)]) {\n saveOptionCookie(name.substr(3));\n }\n break;\n case "pas":\n if (config.options["chk"+name]) {\n c += escape(config.options[name].toString());\n } else {\n c += "";\n }\n break;\n }\n c += "; expires=Fri, 1 Jan 2038 12:00:00 UTC; path=/";\n document.cookie = c;\n};\n//}}}\n/***\n!! Initializations\n***/\n//{{{\n// define config.options.pasPassword\nif (!config.options.pasPassword) {\n config.options.pasPassword = 'defaultPassword';\n window.saveOptionCookie('pasPassword');\n}\n// since loadCookies is first called befor password definition\n// we need to reload cookies\nwindow.loadOptionsCookie();\n//}}}\n////===\n\n////+++!![config.macros.upload]\n\n//{{{\nconfig.macros.upload = {\n accessKey: "U",\n formName: "UploadPlugin",\n contentType: "text/html;charset=UTF-8",\n defaultStoreScript: "store.php"\n};\n\n// only this two configs need to be translated\nconfig.macros.upload.messages = {\n aboutToUpload: "About to upload TiddlyWiki to %0",\n backupFileStored: "Previous file backuped in %0",\n crossDomain: "Certainly a cross-domain isue: access to an other site isn't allowed",\n errorDownloading: "Error downloading",\n errorUploadingContent: "Error uploading content",\n fileLocked: "Files is locked: You are not allowed to Upload",\n fileNotFound: "file to upload not found",\n fileNotUploaded: "File %0 NOT uploaded",\n mainFileUploaded: "Main TiddlyWiki file uploaded to %0",\n passwordEmpty: "Unable to upload, your password is empty",\n urlParamMissing: "url param missing",\n rssFileNotUploaded: "RssFile %0 NOT uploaded",\n rssFileUploaded: "Rss File uploaded to %0"\n};\n\nconfig.macros.upload.label = {\n promptOption: "Save and Upload this TiddlyWiki with UploadOptions",\n promptParamMacro: "Save and Upload this TiddlyWiki in %0",\n saveLabel: "save to web", \n saveToDisk: "save to disk",\n uploadLabel: "upload" \n};\n\nconfig.macros.upload.handler = function(place,macroName,params){\n // parameters initialization\n var storeUrl = params[0];\n var toFilename = params[1];\n var backupDir = params[2];\n var uploadDir = params[3];\n var username = params[4];\n var password; // for security reason no password as macro parameter\n var label;\n if (document.location.toString().substr(0,4) == "http")\n label = this.label.saveLabel;\n else\n label = this.label.uploadLabel;\n var prompt;\n if (storeUrl) {\n prompt = this.label.promptParamMacro.toString().format([this.toDirUrl(storeUrl, uploadDir, username)]);\n }\n else {\n prompt = this.label.promptOption;\n }\n createTiddlyButton(place, label, prompt, \n function () {\n config.macros.upload.upload(storeUrl, toFilename, uploadDir, backupDir, username, password); \n return false;}, \n null, null, this.accessKey);\n};\nconfig.macros.upload.UploadLog = function() {\n return new config.lib.Log('UploadLog', " !storeUrl | !uploadDir | !toFilename | !backupdir | !origin |" );\n};\nconfig.macros.upload.UploadLog.prototype = config.lib.Log.prototype;\nconfig.macros.upload.UploadLog.prototype.startUpload = function(storeUrl, toFilename, uploadDir, backupDir) {\n var line = " [[" + config.lib.file.basename(storeUrl) + "|" + storeUrl + "]] | ";\n line += uploadDir + " | " + toFilename + " | " + backupDir + " |";\n this.newLine(line);\n};\nconfig.macros.upload.UploadLog.prototype.endUpload = function() {\n this.addToLine(" Ok |");\n};\nconfig.macros.upload.basename = config.lib.file.basename;\nconfig.macros.upload.dirname = config.lib.file.dirname;\nconfig.macros.upload.toRootUrl = function (storeUrl, username)\n{\n return root = (this.dirname(storeUrl)?this.dirname(storeUrl):this.dirname(document.location.toString()));\n}\nconfig.macros.upload.toDirUrl = function (storeUrl, uploadDir, username)\n{\n var root = this.toRootUrl(storeUrl, username);\n if (uploadDir && uploadDir != '.')\n root = root + '/' + uploadDir;\n return root;\n}\nconfig.macros.upload.toFileUrl = function (storeUrl, toFilename, uploadDir, username)\n{\n return this.toDirUrl(storeUrl, uploadDir, username) + '/' + toFilename;\n}\nconfig.macros.upload.upload = function(storeUrl, toFilename, uploadDir, backupDir, username, password)\n{\n // parameters initialization\n storeUrl = (storeUrl ? storeUrl : config.options.txtUploadStoreUrl);\n toFilename = (toFilename ? toFilename : config.options.txtUploadFilename);\n backupDir = (backupDir ? backupDir : config.options.txtUploadBackupDir);\n uploadDir = (uploadDir ? uploadDir : config.options.txtUploadDir);\n username = (username ? username : config.options.txtUploadUserName);\n password = config.options.pasUploadPassword; // for security reason no password as macro parameter\n if (!password || password === '') {\n alert(config.macros.upload.messages.passwordEmpty);\n return;\n }\n if (storeUrl === '') {\n storeUrl = config.macros.upload.defaultStoreScript;\n }\n if (config.lib.file.dirname(storeUrl) === '') {\n storeUrl = config.lib.file.dirname(document.location.toString())+'/'+storeUrl;\n }\n if (toFilename === '') {\n toFilename = config.lib.file.basename(document.location.toString());\n }\n\n clearMessage();\n // only for forcing the message to display\n if (version.major < 2)\n store.notifyAll();\n if (!storeUrl) {\n alert(config.macros.upload.messages.urlParamMissing);\n return;\n }\n // Check that file is not locked\n if (window.BidiX && BidiX.GroupAuthoring && BidiX.GroupAuthoring.lock) {\n if (BidiX.GroupAuthoring.lock.isLocked() && !BidiX.GroupAuthoring.lock.isMyLock()) {\n alert(config.macros.upload.messages.fileLocked);\n return;\n }\n }\n \n var log = new this.UploadLog();\n log.startUpload(storeUrl, toFilename, uploadDir, backupDir);\n if (document.location.toString().substr(0,5) == "file:") {\n saveChanges();\n }\n var toDir = config.macros.upload.toDirUrl(storeUrl, toFilename, uploadDir, username);\n displayMessage(config.macros.upload.messages.aboutToUpload.format([toDir]), toDir);\n this.uploadChanges(storeUrl, toFilename, uploadDir, backupDir, username, password);\n if(config.options.chkGenerateAnRssFeed) {\n //var rssContent = convertUnicodeToUTF8(generateRss());\n var rssContent = generateRss();\n var rssPath = toFilename.substr(0,toFilename.lastIndexOf(".")) + ".xml";\n this.uploadContent(rssContent, storeUrl, rssPath, uploadDir, '', username, password, \n function (responseText) {\n if (responseText.substring(0,1) != '0') {\n displayMessage(config.macros.upload.messages.rssFileNotUploaded.format([rssPath]));\n }\n else {\n var toFileUrl = config.macros.upload.toFileUrl(storeUrl, rssPath, uploadDir, username);\n displayMessage(config.macros.upload.messages.rssFileUploaded.format(\n [toFileUrl]), toFileUrl);\n }\n // for debugging store.php uncomment last line\n //DEBUG alert(responseText);\n });\n }\n return;\n};\n\nconfig.macros.upload.uploadChanges = function(storeUrl, toFilename, uploadDir, backupDir, \n username, password) {\n var original;\n if (document.location.toString().substr(0,4) == "http") {\n original = this.download(storeUrl, toFilename, uploadDir, backupDir, username, password);\n return;\n }\n else {\n // standard way : Local file\n \n original = loadFile(getLocalPath(document.location.toString()));\n if(window.Components) {\n // it's a mozilla browser\n try {\n netscape.security.PrivilegeManager.enablePrivilege("UniversalXPConnect");\n var converter = Components.classes["@mozilla.org/intl/scriptableunicodeconverter"]\n .createInstance(Components.interfaces.nsIScriptableUnicodeConverter);\n converter.charset = "UTF-8";\n original = converter.ConvertToUnicode(original);\n }\n catch(e) {\n }\n }\n }\n //DEBUG alert(original);\n this.uploadChangesFrom(original, storeUrl, toFilename, uploadDir, backupDir, \n username, password);\n};\n\nconfig.macros.upload.uploadChangesFrom = function(original, storeUrl, toFilename, uploadDir, backupDir, \n username, password) {\n var startSaveArea = '<div id="' + 'storeArea">'; // Split up into two so that indexOf() of this source doesn't find it\n var endSaveArea = '</d' + 'iv>';\n // Locate the storeArea div's\n var posOpeningDiv = original.indexOf(startSaveArea);\n var posClosingDiv = original.lastIndexOf(endSaveArea);\n if((posOpeningDiv == -1) || (posClosingDiv == -1))\n {\n alert(config.messages.invalidFileError.format([document.location.toString()]));\n return;\n }\n var revised = original.substr(0,posOpeningDiv + startSaveArea.length) + \n allTiddlersAsHtml() + "\sn\st\st" +\n original.substr(posClosingDiv);\n var newSiteTitle;\n if(version.major < 2){\n newSiteTitle = (getElementText("siteTitle") + " - " + getElementText("siteSubtitle")).htmlEncode();\n } else {\n newSiteTitle = (wikifyPlain ("SiteTitle") + " - " + wikifyPlain ("SiteSubtitle")).htmlEncode();\n }\n\n revised = revised.replaceChunk("<title"+">","</title"+">"," " + newSiteTitle + " ");\n revised = revised.replaceChunk("<!--PRE-HEAD-START--"+">","<!--PRE-HEAD-END--"+">","\sn" + store.getTiddlerText("MarkupPreHead","") + "\sn");\n revised = revised.replaceChunk("<!--POST-HEAD-START--"+">","<!--POST-HEAD-END--"+">","\sn" + store.getTiddlerText("MarkupPostHead","") + "\sn");\n revised = revised.replaceChunk("<!--PRE-BODY-START--"+">","<!--PRE-BODY-END--"+">","\sn" + store.getTiddlerText("MarkupPreBody","") + "\sn");\n revised = revised.replaceChunk("<!--POST-BODY-START--"+">","<!--POST-BODY-END--"+">","\sn" + store.getTiddlerText("MarkupPostBody","") + "\sn");\n\n var response = this.uploadContent(revised, storeUrl, toFilename, uploadDir, backupDir, \n username, password, function (responseText) {\n if (responseText.substring(0,1) != '0') {\n alert(responseText);\n displayMessage(config.macros.upload.messages.fileNotUploaded.format([getLocalPath(document.location.toString())]));\n }\n else {\n if (uploadDir !== '') {\n toFilename = uploadDir + "/" + config.macros.upload.basename(toFilename);\n } else {\n toFilename = config.macros.upload.basename(toFilename);\n }\n var toFileUrl = config.macros.upload.toFileUrl(storeUrl, toFilename, uploadDir, username);\n if (responseText.indexOf("destfile:") > 0) {\n var destfile = responseText.substring(responseText.indexOf("destfile:")+9, \n responseText.indexOf("\sn", responseText.indexOf("destfile:")));\n toFileUrl = config.macros.upload.toRootUrl(storeUrl, username) + '/' + destfile;\n }\n else {\n toFileUrl = config.macros.upload.toFileUrl(storeUrl, toFilename, uploadDir, username);\n }\n displayMessage(config.macros.upload.messages.mainFileUploaded.format(\n [toFileUrl]), toFileUrl);\n if (backupDir && responseText.indexOf("backupfile:") > 0) {\n var backupFile = responseText.substring(responseText.indexOf("backupfile:")+11, \n responseText.indexOf("\sn", responseText.indexOf("backupfile:")));\n toBackupUrl = config.macros.upload.toRootUrl(storeUrl, username) + '/' + backupFile;\n displayMessage(config.macros.upload.messages.backupFileStored.format(\n [toBackupUrl]), toBackupUrl);\n }\n var log = new config.macros.upload.UploadLog();\n log.endUpload();\n store.setDirty(false);\n // erase local lock\n if (window.BidiX && BidiX.GroupAuthoring && BidiX.GroupAuthoring.lock) {\n BidiX.GroupAuthoring.lock.eraseLock();\n // change mtime with new mtime after upload\n var mtime = responseText.substr(responseText.indexOf("mtime:")+6);\n BidiX.GroupAuthoring.lock.mtime = mtime;\n }\n \n \n }\n // for debugging store.php uncomment last line\n //DEBUG alert(responseText);\n }\n );\n};\n\nconfig.macros.upload.uploadContent = function(content, storeUrl, toFilename, uploadDir, backupDir, \n username, password, callbackFn) {\n var boundary = "---------------------------"+"AaB03x"; \n var request;\n try {\n request = new XMLHttpRequest();\n } \n catch (e) { \n request = new ActiveXObject("Msxml2.XMLHTTP"); \n }\n if (window.netscape){\n try {\n if (document.location.toString().substr(0,4) != "http") {\n netscape.security.PrivilegeManager.enablePrivilege('UniversalBrowserRead');}\n }\n catch (e) {}\n } \n //DEBUG alert("user["+config.options.txtUploadUserName+"] password[" + config.options.pasUploadPassword + "]");\n // compose headers data\n var sheader = "";\n sheader += "--" + boundary + "\sr\snContent-disposition: form-data; name=\s"";\n sheader += config.macros.upload.formName +"\s"\sr\sn\sr\sn";\n sheader += "backupDir="+backupDir\n +";user=" + username \n +";password=" + password\n +";uploaddir=" + uploadDir;\n // add lock attributes to sheader\n if (window.BidiX && BidiX.GroupAuthoring && BidiX.GroupAuthoring.lock) {\n var l = BidiX.GroupAuthoring.lock.myLock;\n sheader += ";lockuser=" + l.user\n + ";mtime=" + l.mtime\n + ";locktime=" + l.locktime;\n }\n sheader += ";;\sr\sn"; \n sheader += "\sr\sn" + "--" + boundary + "\sr\sn";\n sheader += "Content-disposition: form-data; name=\s"userfile\s"; filename=\s""+toFilename+"\s"\sr\sn";\n sheader += "Content-Type: " + config.macros.upload.contentType + "\sr\sn";\n sheader += "Content-Length: " + content.length + "\sr\sn\sr\sn";\n // compose trailer data\n var strailer = new String();\n strailer = "\sr\sn--" + boundary + "--\sr\sn";\n //strailer = "--" + boundary + "--\sr\sn";\n var data;\n data = sheader + content + strailer;\n //request.open("POST", storeUrl, true, username, password);\n try {\n request.open("POST", storeUrl, true); \n }\n catch(e) {\n alert(config.macros.upload.messages.crossDomain + "\snError:" +e);\n exit;\n }\n request.onreadystatechange = function () {\n if (request.readyState == 4) {\n if (request.status == 200)\n callbackFn(request.responseText);\n else\n alert(config.macros.upload.messages.errorUploadingContent + "\snStatus: "+request.status.statusText);\n }\n };\n request.setRequestHeader("Content-Length",data.length);\n request.setRequestHeader("Content-Type","multipart/form-data; boundary="+boundary);\n request.send(data); \n};\n\n\nconfig.macros.upload.download = function(uploadUrl, uploadToFilename, uploadDir, uploadBackupDir, \n username, password) {\n var request;\n try {\n request = new XMLHttpRequest();\n } \n catch (e) { \n request = new ActiveXObject("Msxml2.XMLHTTP"); \n }\n try {\n if (uploadUrl.substr(0,4) == "http") {\n netscape.security.PrivilegeManager.enablePrivilege("UniversalBrowserRead");\n }\n else {\n netscape.security.PrivilegeManager.enablePrivilege("UniversalXPConnect");\n }\n } catch (e) { }\n //request.open("GET", document.location.toString(), true, username, password);\n try {\n request.open("GET", document.location.toString(), true);\n }\n catch(e) {\n alert(config.macros.upload.messages.crossDomain + "\snError:" +e);\n exit;\n }\n \n request.onreadystatechange = function () {\n if (request.readyState == 4) {\n if(request.status == 200) {\n config.macros.upload.uploadChangesFrom(request.responseText, uploadUrl, \n uploadToFilename, uploadDir, uploadBackupDir, username, password);\n }\n else\n alert(config.macros.upload.messages.errorDownloading.format(\n [document.location.toString()]) + "\snStatus: "+request.status.statusText);\n }\n };\n request.send(null);\n};\n\n//}}}\n////===\n\n////+++!![Initializations]\n\n//{{{\nconfig.lib.options.init('txtUploadStoreUrl','store.php');\nconfig.lib.options.init('txtUploadFilename','');\nconfig.lib.options.init('txtUploadDir','');\nconfig.lib.options.init('txtUploadBackupDir','');\nconfig.lib.options.init('txtUploadUserName',config.options.txtUserName);\nconfig.lib.options.init('pasUploadPassword','');\nsetStylesheet(\n ".pasOptionInput {width: 11em;}\sn"+\n ".txtOptionInput.txtUploadStoreUrl {width: 25em;}\sn"+\n ".txtOptionInput.txtUploadFilename {width: 25em;}\sn"+\n ".txtOptionInput.txtUploadDir {width: 25em;}\sn"+\n ".txtOptionInput.txtUploadBackupDir {width: 25em;}\sn"+\n "",\n "UploadOptionsStyles");\nif (document.location.toString().substr(0,4) == "http") {\n config.options.chkAutoSave = false; \n saveOptionCookie('chkAutoSave');\n}\nconfig.shadowTiddlers.UploadDoc = "[[Full Documentation|http://tiddlywiki.bidix.info/l#UploadDoc ]]\sn"; \n\n//}}}\n////===\n\n////+++!![Core Hijacking]\n\n//{{{\nconfig.macros.saveChanges.label_orig_UploadPlugin = config.macros.saveChanges.label;\nconfig.macros.saveChanges.label = config.macros.upload.label.saveToDisk;\n\nconfig.macros.saveChanges.handler_orig_UploadPlugin = config.macros.saveChanges.handler;\n\nconfig.macros.saveChanges.handler = function(place)\n{\n if ((!readOnly) && (document.location.toString().substr(0,4) != "http"))\n createTiddlyButton(place,this.label,this.prompt,this.onClick,null,null,this.accessKey);\n};\n\n//}}}\n////===\n\n
<!--{{{-->\n<div class='viewer' macro='view text wikified'></div>\n<div class='viewer topbutton' macro='top'></div>\n<br><br>\n<div class='viewer' macro='navigation tiddlers:{{store.getTiddlerText("PresentationIndex").readBracketedList()}}}'></div>\n<div class='tagClear'></div>\n<!--}}}-->
''WELCOME TO MY HOMEPAGE''\n<html>\n<img class="floatright"\nsrc="http://www.vub.ac.be/CLWF/SS/Alexandru.jpg"\nalt="11225" border="3" height="620" width="425" style="float: right">\n</html>\n\nFrom April 2011, I am an Associate Professor at [[ILLC|http://www.illc.uva.nl/]] (Institute for Logic, Language and Computation), University of Amsterdam, NL.\n\nPREVIOUS AFFILIATIONS:\n\nBetween 2001 and 2011, I was University Lecturer at Oxford University, in the [[Department of Computer Science|http://www.cs.ox.ac.uk/]].\n\nBetween 1998 and 2001, I was a post-doctoral researcher at [[CWI|http://www.cwi.nl/]], (Dutch Center for Mathematics and Computer Science) & [[ILLC|http://www.illc.uva.nl/]] (Institute for Logic, Language and Computation), University of Amsterdam, NL\n\nI obtained my Ph. D. in Mathematics in 1998 at [[IU Department of Mathematics|http://www.math.indiana.edu/]], Indiana University; (USA), under the supervision of Jon Barwise.\n\nBetween 1992 and 1993 I was a scientific researcher at [[Institute of Mathematics of the Romanian Academy|http://www.imar.ro/]], Bucharest, Romania.\n\nI obtained my Masters in Mathematics at University of Bucharest in 1989.\n\n* Editor of the annual volume //[[Phibook: The Yearbook of Philosophical Logic|http://www.philosophicallogic.org/]]//. Publisher: Automatic Press/VIP.\n* PC member of [[AiML 2010|http://aiml10.mi.ras.ru/index.php?n=0]] (Advances in Modal Logic 2010); of [[CMCS'10|http://event.cwi.nl/cmcs10/index.html]] (10th International Workshop on Coalgebraic Methods in Computer Science) and of [[ESSLLI 2010 Workshop|http://www.irit.fr/~Laure.Vieu/Esslli10]] (Workshop on Theories of Information Dynamics and Interaction and their Application to Dialogue). PC member of [[past conferences]].\n\n
This document is a ~TiddlyWiki from tiddlyspot.com. A ~TiddlyWiki is an electronic notebook that is great for managing todo lists, personal information, and all sorts of things.\n\n@@font-weight:bold;font-size:1.3em;color:#444; //What now?// &nbsp;&nbsp;@@ Before you can save any changes, you need to enter your password in the form below. Then configure privacy and other site settings at your [[control panel|http://alexandru.tiddlyspot.com/controlpanel]] (your control panel username is //alexandru//).\n<<tiddler TspotControls>>\nSee also GettingStarted.\n\n@@font-weight:bold;font-size:1.3em;color:#444; //Working online// &nbsp;&nbsp;@@ You can edit this ~TiddlyWiki right now, and save your changes using the "save to web" button in the column on the right.\n\n@@font-weight:bold;font-size:1.3em;color:#444; //Working offline// &nbsp;&nbsp;@@ A fully functioning copy of this ~TiddlyWiki can be saved onto your hard drive or USB stick. You can make changes and save them locally without being connected to the Internet. When you're ready to sync up again, just click "upload" and your ~TiddlyWiki will be saved back to tiddlyspot.com.\n\n@@font-weight:bold;font-size:1.3em;color:#444; //Help!// &nbsp;&nbsp;@@ Find out more about ~TiddlyWiki at [[TiddlyWiki.com|http://tiddlywiki.com]]. Also visit [[TiddlyWiki Guides|http://tiddlywikiguides.org]] for documentation on learning and using ~TiddlyWiki. New users are especially welcome on the [[TiddlyWiki mailing list|http://groups.google.com/group/TiddlyWiki]], which is an excellent place to ask questions and get help. If you have a tiddlyspot related problem email [[tiddlyspot support|mailto:support@tiddlyspot.com]].\n\n@@font-weight:bold;font-size:1.3em;color:#444; //Enjoy :)// &nbsp;&nbsp;@@ We hope you like using your tiddlyspot.com site. Please email [[feedback@tiddlyspot.com|mailto:feedback@tiddlyspot.com]] with any comments or suggestions.
Updated on 27 January 2014
''PC Member of: ''\n\n[[LORI II|http://loriweb.org/lori2009/]] (The Second International Workshop on Logic, Rationality and Interaction), [[WOLLIC 2009|http://wollic.org/wollic2009/]] (16th Workshop on Logic, Language, Information and Computation), [[AIML 2008 (Advances in Modal Logic), Lall '08 (ESSLLI Workshop on "Logic and Intelligent Interaction"), LOFT 2008 (Logic and Foundations of Decision Theory and Game Theory), LORI 2007 (International Workshop on em Logic, Rationality and Interaction), AIML 2006 (Advances in Modal logic), RAK'06 (ESSLLI Workshop on "Rationality and Knowledge"), CMCS 2002 (the Fifth International Workshop on Coalgebraic Methods in Computer Science), UKMAS 2002 (UK Workshop on Multi-agent Systems), CMCS 2001 (Fourth International Workshop on Coalgebraic Methods in Computer Science).