Classical and quantum degrees of truth: a new look at the effects of a Hilbert space

Facultatea de Matematica si Informatica, sala 202

Speaker: Roberto Giuntini (University of Cagliari). We investigate certain Brouwer-Zadeh lattices that serve as abstract counterparts of lattices of effects in Hilbert spaces under the spectral ordering. These algebras, called PBZ∗-lattices, can also be seen as generalisations of orthomodular lattices and are remarkable for the collapse of three notions of “sharpness” that are distinct in general

The finitary content of sunny nonexpansive retractions

Facultatea de Matematica si Informatica, sala 202

Andrei Sipoș (TU Darmstadt & IMAR). The goal of proof mining is to extract quantitative information out of proofs in mainstream mathematics which are not necessarily fully constructive. Often, such proofs make use of strong mathematical principles, but a preliminary analysis may show that they are not actually needed, so the proof may be carried

The frontier between decidability and undecidability for logics for strategic reasoning in the presence of imperfect information

Facultatea de Matematica si Informatica, sala Google

Speaker:  Catalin Dima (Université Paris-Est Créteil.) Abstract: The last 15-20 years have seen a number of logical formalisms that focus on strategic reasoning. These logics aim at giving specification languages for various multi-agent game structures, in which agents have adversarial or cooperative objectives which may be qualitative or quantitative and may have various types of

The hybridization of many-sorted polyadic modal logic

Speaker: Natalia Moangă (University of Bucharest). Abstract: Hybrid logics are obtained by enriching modal logics with nominals and state variables, that directly refer the individual points in a Kripke model. In the present work we develop a hybrid version on top of our many-sorted polyadic logic, previously defined. Our system has nominals and state variables

An introduction to BAN logic (a logic of authentication)

Speaker: Alexandru Dragomir (University of Bucharest) Abstract: One of the first and most discussed logical approaches to the problem of verifying security protocols is the one proposed in BAN logic (Burrows, Abadi & Needham 1989), a many-sorted modal logic used for its intuitive and compelling set of inference rules devised for reasoning about an agent’s