BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//EIS News and Events - ECPv4.9.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:EIS News and Events
X-ORIGINAL-URL:https://news.eis.uow.edu.au
X-WR-CALDESC:Events for EIS News and Events
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190712
DTEND;VALUE=DATE:20190713
DTSTAMP:20190825T045816
CREATED:20190418T003852Z
LAST-MODIFIED:20190716T010112Z
UID:12222-1562889600-1562975999@news.eis.uow.edu.au
SUMMARY:2019 Australasian Association for Logic Meeting
DESCRIPTION:The 2019 Australasian Association for Logic Meeting will be held July 12\, directly after the Australasian Association of Philosophy Conference. \n\nSchedule\n\nSchedule | Friday July 12 2019\n\n\n\nTime\nTalk\n\n\n8.45 -9.15\nRegistration\n\n\n9.15 -10.00\nShawn Standefer\, A substructural approach to explicit modal logic\n\n\n10.00 – 10.45\nBen Blumson\, Relevance and Verification\n\n\n10.45 – 11.15\nTea\, coffee\n\n\n11-15 – 12.00\nMarcia Pinheiro\, Nothing but Allurement: The Monty Hall Problem\n\n\n12.00 -12.45\nMartin Bunder\, BCI-Algebras and Related Logics\n\n\n12.45 – 1.45\nLunch\n\n\n1.45 – 2.30\nKai Tanter\, A Note on Restricting Failures of Identity and Cut\n\n\n2.30 – 3.15\nTimo Eckhardt\, Forgetting Positive Epistemic Formulas in a Multiagent Epistemic Logic\n\n\n3.15 – 3.45\nTea\, coffee\n\n\n3.45 – 4.30\nAAL AGM\n\n\n5.30 – 7.30\nAAL Conference Dinner at Ciao Cucina 56 Crown St Wollongong.\n\n\n\n\n\nCall for papersPapers can be on any topic in logic. \nAuthors should aim for a time of 45 minutes including discussion time. \nSubmissions in the form of an abstract of approximately 200 words should be made to mbunder@uow.edu.au by 28 June 2019.\nRegistration and accommodation\nConference Registration (on arrival) \n$30 \nAccommodation \nVisit our Wollongong accommodation listing or Google Wollongong Accommodation. Wollongong or North Wollongong accommodation will be near the free bus route. \nVisit Wollongong accommodation listing \nTransport \nHow to get to Wollongong \nHow to get around Wollongong (including the free bus to University of Wollongong)\nAbstracts\nMartin Bunder\, BCI-Algebras and Related Logics\nMathematics and Applied Statistics\, University of Wollongong | mbunder@uow.edu.au \nKabzinski in [6] first introduced an extension of BCI-logic that is isomorphic to BCI-algebras. Kashima and Komori in [7] gave a Gentzen-style sequent calculus version of this logic as well as another sequent calculus which they proved to be equivalent. The second they used to prove decidability of the word problem for BCI- algebras. The decidability proof relies on cut elimination for the second system\, this paper provides a fuller and simpler proof of this. Also supplied is a new decidability proof and proof-finding algorithm for their second extension of BCI-logic and so for BCI-algebras. \n\nTimo Eckhardt\, Forgetting Positive Epistemic Formulas in a Multiagent Epistemic Logic\nUniversity Of Melbourne | Teckhardt@student.unimelb.edu.au \nIn this paper\, I provide a generalised formal account of forgetting that allows for more than simply forgetting boolean formulas. In order to do so\, I present a system that generalises Fernandez-Duque et al.’s framework of forgetting [1] in two ways: By allowing for multiple agents and by being able to handle `positive epistemic’ formulas\, i.e. those that do not include negations of knowledge statements. It will be based on the minimal impact approach that preserves as much knowledge of an agent as possible while the knowledge of the forgotten formula is lost. I introduce an operator [y]A that represents the result of agents A forgetting \, i.e. \ after some agents A forget that ”. Finally\, I show that the operation is successful\, i.e. that after A forget \, they in fact no longer know . \nReferences \n1. David Fernandez-Duque\, Angel Nepomuceno-Fernandez\, Enrique Sarrion-Morillo\, Fernando Soler-Toscano\, and Fernando R. Velazquez-Quesada. Forgetting complex propositions. CoRR\, 2015. \n\nBen Blumson\, Relevance and Verification\nDepartment of Philosophy National University of Singapore\n\nAccording to Ayer’s first empiricist criterion of meaning: “… we may say that it is the mark of a genuine factual proposition … that some experiential propositions can be deduced from it in conjunction with certain other premises without being deducible from those other premises alone.” Ayer’s criterion is supposed to distinguish nonsense\, on the one hand\, from genuine factual propositions and tautologies\, on the other. But if deducibility is interpreted in terms of classical logic\, Ayer’s criterion is well known to be trivial — it entails that every statement is either a genuine factual proposition\, or else a tautology. But in this paper\, I show that if deducibility is interpreted in terms of relevant logic (in particular the relevant logic NR)\, then Ayer’s criteria escapes triviality.\n\n\nMarcia Pinheiro\, Nothing but Allurement: The Monty Hall Problem\nPhilosophy and Mathematics IICSE University | mrprofessional@yahoo.com \nProfessor Doctor Priest mentioned Monty Hall\, and his famous TV show\, where randomly selected people had to choose a door in three\, then confirm or change their choice at a second moment\, in a conference in 2000: the magic trick that proved that mathematicians had imperfect reasoning when laying the foundations of Combinatorics. Mathematicians responded: it is not the sight\, but the eyes of the beholder of the vision; their eyes see only what they intend to see instead of what should be seen. \nWe discuss the analysis presented by Pinheiro in The Monty Hall Problem\, a book from 2016\, available at Amazon.com\, and\, with that\, a ‘proof’ presented by Doctor Baumann in 2008. \nThe intentions are convincing the public that Doctor Baumann’s proof contains a fallacy\, and therefore Priest does not have a soundproof of his claim in this problem. \n\nShawn Standefer\, A substructural approach to explicit modal logic\nUniversity of Melbourne \nIn this talk\, I will present a class of ternary relational models for explicit modal logics. I will highlight a difficulty for proving completeness for these logics. Completeness can be proved by extending the language and the logic. I will then show how to accommodate some common extensions of the explicit modal logics in the present setting. \n\nKai Tanter\, A Note on Restricting Failures of Identity and Cut\nMonash University \nIn their recent article “Negation as Cancellation\, Connexive Logic\, and qLPm” Wansing & Skurt (2018) define a system qLPm that combines Priest’s minimally inconistent Logic of Paradox (LPm) with Malinowski’s q-entailment. Like q-entailment\, qLPm is non-reflexive\, however the combination with LPm results in failures of reflexivity being restricted to contradictions. In this talk I’ll look at extending this work to restricting failures of transitivity\, as well as to the Liar and Curry sentences. \n\n\n
URL:https://news.eis.uow.edu.au/event/2019-australasian-association-for-logic-meeting/
LOCATION:Building 39C Room 174\, University of Wollongong\, HVVJ+2V\, Wollongong\, New South Wales\, 2522\, Australia
GEO:-34.4074375;150.8821875
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Building 39C Room 174 University of Wollongong HVVJ+2V Wollongong New South Wales 2522 Australia;X-APPLE-RADIUS=500;X-TITLE=HVVJ+2V:geo:150.8821875,-34.4074375
CATEGORIES:School of Mathematics and Statistics
ATTACH;FMTTYPE=image/jpeg:https://news.eis.uow.edu.au/wp-content/uploads/2019/04/Australasian-Association-for-Logic-Meeting.jpg
ORGANIZER;CN="Martin%20Bunder":MAILTO:mbunder@uow.edu.au
END:VEVENT
END:VCALENDAR