Master's program at the Faculty of Mathematics and Computer Science, University of Bucharest
Speaker: Mihai Prunescu (University of Bucharest) Abstract: Regular logic systems which are strictly stronger than the first order predicate calculus cannot satisfy in the same time Löwenheim-Skolem for statements and compacity (Lindström 1). Effectively presented such systems cannot satisfy in the same time Löwenheim-Skolem for statements and the condition that the set of generally valid …
Speaker: Mihai Prunescu (University of Bucharest) Abstract: Regular logic systems which are strictly stronger than the first order predicate calculus cannot satisfy in the same time Löwenheim-Skolem for statements and compacity (Lindström 1). Effectively presented such systems cannot satisfy in the same time Löwenheim-Skolem for statements and the condition that the set of generally valid …
Speaker: Mihai Prunescu (University of Bucharest) Abstract: We discuss different implications of the negative answer of Hilbert's Tenth Problem: the exponential Diophantine equation over ℕ and ℚ, the minimal number of variables which lead to an undecidable problem over ℤ, the homogeneous Diophantine problem over ℤ.
Speaker: Ionuţ Ţuţu (Royal Holloway, University of London) Abstract: We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are common to hybrid and to dynamic logics. This provides certain key advantages for …
Speaker: Alexandru Dragomir (University of Bucharest) Abstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning (epistemic actions). However, not all epistemic actions are allowed to be executed in an initial epistemic model, and this is where the concept of a protocol comes in: a protocol stipulates what epistemic actions …
Speaker: Radu Iosif (CNRS - VERIMAG, France) Abstract: We introduce a logical framework for the specification and verification of component-based systems, in which finitely many component instances are active, but the bound on their number is not known. Besides specifying and verifying parametric systems, we consider the aspect of dynamic reconfiguration, in which components can …
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 . BAN logic is a many-sorted modal logic used for its intuitive and compelling set of inference rules devised for reasoning about an agent’s beliefs, …
In perioada 1-3 noiembrie organizam workshop-ul international ManyVal 2019, dedicat in special cercetarilor in logica cu mai multe valori. Editia actuala beneficiaza si de participarea unor filozofi-logicieni de marca. Pentru mai multe detalii puteti consulta pagina manifestarii: https://cs.unibuc.ro/events/manyval2019/ Persoanele inregistrate vor primi kit-ul workshop-ului si vor putea participa la mesele si activitatile sociale anuntate. Participarea …
Speaker: Ioana Leustean (University of Bucharest) Abstract: After a brief overview of the formal methods used for analyzing security protocols, we will focus on the operational semantics developed in: C. Cremers, S. Mauw, Operational Semantics and Verification of Security Protocols, Springer, 2012.
Speaker: Ioana Leustean (University of Bucharest) Abstract: We continue our presentation on operational semantics of security protocols, as developed in: C. Cremers, S. Mauw, Operational Semantics and Verification of Security Protocols, Springer, 2012.