Franco Montagna's Work on Provability Logic and Many-valued Logic

نویسندگان

  • Lev D. Beklemishev
  • Tommaso Flaminio
چکیده

Franco Montagna, a prominent logician and one of the leaders of the Italian school on Mathematical Logic, passed away on February 18, 2015. We survey some of his results and ideas in the two disciplines he greatly contributed along his career: provability logic and many-valued logic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

On sufficient conditions for expressibility of constants in the 4-valued extension of the propositional provability logic $GL$

In the present paper we consider the simplest non-classical extension GL4 of the well-known propositional provability logic GL together with the notion of expressibility of formulas in a logic proposed by A. V. Kuznetsov. Conditions for expressibility of constants in GL4 are found out, which were first announced in a author’s paper in 1996.

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

Constructive Provability Logic

We present constructive provability logic, an intuitionstic modal logic that validates the Löb rule of Gödel and Löb’s provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and CPL*, are presented in natural deduction and sequent calculus forms which are then shown to be equivalent. In addition, we discuss the use of constructive provabili...

متن کامل

A Notion of Coherence for Books on Conditional Events in Many-valued Logic

We introduce a new approach to conditional probability over many-valued events, which is based on bets. Then we show that this approach fits with Kroupa’s approach, and we give two characterizations of coherence for books on conditional many-valued events, the first one based on states, and the second one based on logical coherence of a suitable theory on many-valued logic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 104  شماره 

صفحات  -

تاریخ انتشار 2016