BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Institute of Mathematics and Informatics - ECPv6.0.8//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://math.bas.bg
X-WR-CALDESC:Събития за Institute of Mathematics and Informatics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Sofia
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20210205T130000
DTEND;TZID=Europe/Sofia:20210205T140000
DTSTAMP:20260701T114811
CREATED:20210201T111004Z
LAST-MODIFIED:20210201T111203Z
UID:10037-1612530000-1612533600@math.bas.bg
SUMMARY:Семинар "Алгебра и логика"
DESCRIPTION:На 5 февруари 2021 г. (петък) от 13:00 часа ще се проведе дистанционно заседание на семинара по „Алгебра и логика”. \nДоклад на тема \nReduction Calculus of Type-Theory of Acyclic Algorithms\, II\n\nще изнесе Русанка Луканова. \nДокладът ще бъде продължение на доклада\, изнесен на 29.01.2021.\nСеминарът ще се проведе посредством платформата Zoom и всеки желаещ може да се присъедини като последва линка: \n\n\n\n\nhttps://us02web.zoom.us/j/85137375021?pwd=RE5QczdFTE1xL1R6MnI2b1lkcGczQT09\n\nTopic: Онлайн семинар на секция “Алгебра и логика”\nTime: Feb 05\, 2021 01:00 PM Sofia\nMeeting ID: 851 3737 5021\nPasscode: 035647\n\n\n\n\nРезюме. In 1989\, Moschovakis [1] initiated a new theory of the mathematical notion of algorithm\, within untyped\, full recursion. In 2006\, Moschovakis [2] introduced the formal language of Type-Theory of Recursion (TTR)\, which models the notion of algorithm and concepts of meaning in typed semantic structures. The focus of [2] is on Type-Theory of Acyclic Algorithms (TTAR) for computations that end up after a finite number of steps. The approach\, in its varieties\, with full and acyclic recursion\, provides for new developments of type theory of computation and new applications to computational syntax-semantics interfaces in programming and natural languages. \nIn this talk\, I present the formal language (LAR) of TTAR\, by extending it with a restrictor operator that sets conditions on denotations of terms. In addition\, the operator defines restricted memory and parameters. TTAR provides two kinds of semantics of the formal language LAR\, denotational and algorithmic. The reduction system of TTAR is essential for the notion of algorithm and syntax-semantics interfaces. I shall overview the reduction calculus and some of the theoretical results of TTAR. \n[1] Yiannis N Moschovakis. The formal language of recursion. Journal of Symbolic Logic\, 54(04):1216–1252\, 1989. \n[2] Yiannis N. Moschovakis. A Logical Calculus of Meaning and Synonymy. Linguistics and Philosophy\, 29(1):27–89\, 2006. \nОт секция „Алгебра и логика” на ИМИ – БАН\nhttp://www.math.bas.bg/algebra/seminarAiL/ \n 
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%b0%d0%bb%d0%b3%d0%b5%d0%b1%d1%80%d0%b0-%d0%b8-%d0%bb%d0%be%d0%b3%d0%b8%d0%ba%d0%b0-38/
LOCATION:Онлайн
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%A1%D0%B5%D0%BA%D1%86%D0%B8%D1%8F%20%D0%90%D0%BB%D0%B3%D0%B5%D0%B1%D1%80%D0%B0%20%D0%B8%20%D0%BB%D0%BE%D0%B3%D0%B8%D0%BA%D0%B0":MAILTO:algebra_logic_seminar@math.bas.bg
END:VEVENT
END:VCALENDAR