هشتمین همایش سالانه‌ی انجمن منطق

مطالب و برنامه‌های هشتمین همایش سالانه‌ی انجمن منطق.

Compactness of First-Order Fuzzy Logics

Abstract. One of the nice properties of the first-order logic is the compactness of satisfiability. It states that a finitely satisfiable theory is satisfiable. Here, some new results are given around the compactness of satisfiability in Hájek Basic logic. It is shown that there are topologies on [0, 1] and [0, 1]2 for which the interpretation of all logical connectives of the…

Linear Temporal Public Announcement Logic: A new prespective for reasoning about the knowledge of multi-classifiers

Abstract. Current applied intelligent systems have crucial shortcomings either in reasoning the gathered knowl- edge, or representation of comprehensive integrated information. To address these limitations, we develop a formal transition system, which is applied to classifiers (the common artificial intelligence (AI) systems), to reason about the findings. The developed model w…

نسخه‌های فازی منطق موجهات R و K: حساب ابررشته‌های برچسب‌خورده

چکیده. در‬ ‫اين‬ ‫خلاصه‌ی ‫مقاله‪،‬‬ ‫نسخه‬ ‫های ‫فازی ‫منطق‌‫های ‫موجهات‬ ‫‪R‬‬ ‫و‬ ‫‪K‬‬ ‫را‬ ‫بر‬ ‫پايه‬ ‫منطق‬ ‫تك‬نرم‬ ‫‪UL‬‬ ‫با‬ ‫زبان‬ ‫استاندارد‬ ‫معرفی ‫می‌‫كنيم‪.‬‬ ‫اين‬ ‫معرفی ‫از‬ ‫طريق‬ ‫حساب‬ ‫ابررشته‬‌‫های ‫برچسب‬‌‫خورده‬ ‫بر‬ ‫مبنای ‫معناشناسی ‫استاندارد‬ ‫منطق‬ ‫موجهات‬ ‫صورت‬ ‫مي‌گيرد‪.‬‬

The Barwise-Schlipf Characterization of Recursively Saturated Models of Peano Arithmetic, Redux

In 1975 Barwise and Schlipf published a landmark paper which launched the study of recursively saturated models of arithmetic; the main theorem of their paper asserts that a nonstandard model M of Peano Arithmetic is recursively saturated iff M can be expanded to a model of a particular subsystem of Second Order Arithmetic. The impression one gets from reading the Barwise-Schli…

Reasoning about Dependence and Knowledge

Dependence is ubiquitous in science and daily life. We present a simple complete and decidable classical base logic for reasoning about functional dependence which can be seen as either a generalized first-order logic or as a modal logic interpreted epistemically. Next, we consider extensions for reasoning about correlations between variables, where the base logic for independe…

Strictly positive provability logics

We deal with the fragment of propositional modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. We call such fragments strictly positive. Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficien…

Eighth annual conference: Time Table

The web-link to participate in this event: https://vclass2.modares.ac.ir/b/dav-p84-hhm-pra First day:Wednesday, 17 February 2021 Chair Time Lecturer Title Abstract language Majid Alizadeh 9:30 - 10 Opening Farsi 10 - 11 Mohammad Ardeshir New insights on Basic Logic Farsi 11 - 11:30 $2^6$ Farsi and English 11:30 - 13:30 Break Mohammad Ardeshir 13:30 - 14:30 ‌‌Johan van Benthem R…