Seminar LCS 2013 (Archive)

Coordinators:

Denisa Diaconescu, Ioana Leuștean 


11.07.2013, Room 5 (FMI, UB), 11.30 
Speaker: Serafina Lapenta (PhD student, University of Basilicata, Italy)
Title:  On Product in Łukasiewicz Logic

Abstract: 
PMV-algebras and Riesz MV-algebras are extensions of MV-algebras by an internal and, respectively, external product operation. We if we endow an MV-algebra with both internal and external product at the same time we get a structure called f-MV-algebras. All above structures are in categorial equivalence with their counterpart in the the theory of algebraic lattice-ordered structures. On MV-algebras, a tensor product can be defined in both general and semisimple case. In the semisimple case we prove the standard scalar extension property for tensor product; moreover, we prove that tensor product of semisimple PMV-algebra is still a PMV-algebra. We also define the tensor PMV-algebra of an MV-algebra and get an adjunction between the categories of MV-algebras and the categories of f-MV-algebras. Finally, we explore the connections between tensor product of MV-algebras and tensor product of lattice-ordered-groups.







26.04.2013, Room 220 (FMI, UB), 12.00 
Speaker: Andrei Sipoș (MSc student, FMI, UB)
Title:  Types and Computation

Abstract: 
We explore the various aspects of typing in conjunction with lambda-calculi, in order to develop the "classical theory" of programming languages. 





19.04.2013, Room 220 (FMI, UB), 12.00 
Speaker: Ionuț Țuțu  (PhD Student, Royal Holloway, University of London, UK)
Title:  From Service-Oriented Computing to Logic Programming and back

Abstract:    We investigate how aspects specific to the logic programming paradigm can be used to capture the declarative and operational semantics of  service-oriented computing. Building on concepts that arise naturally such as clause (service module) and query (activity module) we study the soundness of binding services to activities through service-oriented counterparts of Herbrand's theorem and resolution.

12.00-13.30: Part I
13.30-14.00: Coffee break
14.00-15.30: Part II





12.04.2013, Amf. D. Pompeiu (FMI, UB), 12.00 
Speaker: Claudia Chiriță  (MSc Student, FMI, UB)
Title:  A model theoretic approach to P vs NP

Abstract:    Following an introduction to descriptive complexity and institution-independent structured specifications, we propose an abstract characterization of complexity classes. More precisely, we investigate how the derive and free structuring operators can be used to capture P and NP.






05.04.2013, Amf. D. Pompeiu (FMI, UB), 12.00 
Speaker: Ioana Leuștean  (FMI, UB)
Title:  Many-Valued Logics

Abstract:  After a brief introduction in the general theory of many-valued logics, we will focus on recent developments in Łukasiewicz logic, including the Dutch Book Theorem and the Baker-Beynon duality.








29.03.2013, Amf. D. Pompeiu (FMI, UB), 12.00 
Speaker: Andrei Sipoș (MSc student, FMI, UB)
Title:  Model theories for untyped lambda-calculus

Abstract: 
We further explore the semantics of untyped lambda-calculus, starting with Dana Scott's construction and continuing with alternative models and a glimpse into domain theory and denotational semantics.





22.03.2013, Room 220 (FMI, UB), 12.00 
Speaker: Andrei Sipoș (MSc student, FMI, UB)
Title:  Introducing lambda-calculus II

Abstract: 
The lectures will continue with an approach through the logical side, namely extensionality, Hilbert-style theories and semantics. 

References:
J.R. Hindley, J.P. Seldin, Lambda-Calculus and Combinators, an Introduction (Cambridge University Press, 2008)
P. Selinger, Lecture Notes on the Lambda Calculus




15.03.2013, Amf. Simion Stoilow (FMI, UB), 12.00 
Speaker: Andrei Sipoș (MSc student, FMI, UB) 
Title:  Introducing lambda-calculus I

Abstract: 
The lambda-calculus is one of the earliest models of computation and also an adequate entry point to the applications of logic and algebra to computer science. Therefore, an introduction to this language in the context of computability theory will be given, culminating with the proof of the representability of partial recursive functions.

References:
J.R. Hindley, J.P. Seldin, Lambda-Calculus and Combinators, an Introduction (Cambridge University Press, 2008)
P. Selinger, Lecture Notes on the Lambda Calculus