BEGIN:VCALENDAR PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN VERSION:2.0 CALSCALE:GREGORIAN METHOD:PUBLISH BEGIN:VEVENT DTSTAMP:20260415T010105Z DTSTART;TZID=Europe/Warsaw:20201118T063000 DTEND;TZID=Europe/Warsaw:20201118T083000 SUMMARY:Symmetries and quantum indiscernibility UID:20260415T014955Z-iCalPlugin-Grails@philevents-web-f5d4878dd-x5n6c TZID:Europe/Warsaw LOCATION:MS Teams\, Kraków\, Poland DESCRIPTION:

Abstract: There is an entrenched view in philosophy of physics\, according to which the symmetry (resp. permutation-invariance) of the many-particle quantum states implies the absolute indiscernibility of those particles. This claim seems to be confirmed by an elementary fact\, provable in model theory\, that in symmetric languages there is no formula which absolutely discerns objects in the domain. The only type of discernibility apparently available in symmetric languages is so-called weak discernibility. In my talk I will discuss a relatively less-well known theorem\, due to Simon Saunders\, to the effect that even in symmetric languages it is possible to formulate a sentence which\, in models of a given cardinality\, is equivalent with the sentence stating the absolute discernibility of the elements of the domain. This opens the possibility of distinguishing quantum particles of the same type with the help of their measurable properties\, despite adopting the symmetrization postulate. I will show how to express such distinguishability facts in terms of appropriate symmetric projectors.

\n

Link to MS Teams: \;

\n

https://teams.microsoft.com/l/meetup-join/19%3Af13f8fb7c216457db8b42288aa5bc45e%40thread.tacv2/1605268610595?context=%7B%22Tid%22%3A%22eb0e26eb-bfbe-47d2-9e90-ebd2426dbceb%22%2C%22Oid%22%3A%2292ae0674-8c0a-4c22-821c-42f81673f05d%22%7D

ORGANIZER;CN=Joanna Luc;CN=Tomasz Placek: METHOD:PUBLISH END:VEVENT END:VCALENDAR