# Franco Montagna’s Work on Provability Logic and Many-valued Logic

@article{Beklemishev2016FrancoMW, title={Franco Montagna’s Work on Provability Logic and Many-valued Logic}, author={Lev D. Beklemishev and Tommaso Flaminio}, journal={Studia Logica}, year={2016}, volume={104}, pages={1-46} }

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.

## References

SHOWING 1-10 OF 135 REFERENCES

### The logic of π1-conservativity

- PhilosophyArch. Math. Log.
- 1990

It is shown that the modal prepositional logicILM (interpretability logic with Montagna's principle) is sound and complete as the logic ofπ1-conservativity over eachbE1-sound axiomatized theory containingI⌆1 (PA with induction restricted tobE 1-formulas).

### Modal logics with several operators and provability interpretations

- Mathematics
- 1986

The results herein solve positively some conjectures of Smoryński by generalizing results of Solovay (1976). The proofs rest on a modification of the usual semantics for modal logic and Solovay’s…

### ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS

- Philosophy
- 1990

The general notion of a modal propositional provability logic was introduced by S. N. Artemov (1979) and A. Visser (1984). In this paper it is proved that the four infinite series of provability…

### Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions

- Computer ScienceFuzzy Sets Syst.
- 2010

### Proof theory for locally finite many-valued logics: Semi-projective logics

- Computer Science, MathematicsTheor. Comput. Sci.
- 2013

### Interpolation and Beth's property in propositional many-valued logics: A semantic investigation

- Computer ScienceAnn. Pure Appl. Log.
- 2006

### Putting together Lukasiewicz and product logics

- Mathematics, Computer Science
- 1999

A propositional fuzzy logical system L? which contains the well-known Lukasiewicz, Product and Godel fuzzy logics as sublogics is investigated and linear L?-algebras are shown to be embeddable in linearly ordered abelian rings with a strong unit and cancellation law.

### Monoidal t-norm based logic: towards a logic for left-continuous t-norms

- Computer ScienceFuzzy Sets Syst.
- 2001

### On Weakly Cancellative Fuzzy Logics

- Computer ScienceJ. Log. Comput.
- 2006

The weak cancellation property is proved to be the difference between cancellation and pseudocomplementation, so it gives a new axiomatization of product logic and ΠMTL.