• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 8
Sort:
by name
by year
Article
L. Beklemishev, Flaminio T. Studia Logica. 2016. Vol. 104. No. 1. P. 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.

Added: Mar 13, 2016
Article
Шехтман В. Б., Скворцов Д. Studia Logica. 1986. Т. 45. С. 101-118.
Added: Oct 8, 2010
Article
Шехтман В. Б. Studia Logica. 1990. Т. 49. № 3. С. 83-103.
Added: Oct 8, 2010
Article
Шехтман В. Б. Studia Logica. 1983. Т. 42. № 1. С. 63-80.
Added: Oct 8, 2010
Article
Beklemishev L. D., Fernandez-Duque D., Joosten J. J. Studia Logica. 2014. Vol. 102. No. 3. P. 541-566.

We introduce the logics GLPΛ, a generalization of Japaridze’s polymodal provability logic GLPω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLPω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLPΛ and the decidability of GLPΛ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment ofGLPΛ.

Added: Nov 21, 2013
Article
Vasyukov V. L. Studia Logica. 2011. Vol. 98. No. 3. P. 429-443.
Added: Nov 7, 2011
Article
Gabbay D., Shehtman V. B. Studia Logica. 2000. No. 72(2). P. 157-183.
Added: Oct 8, 2010
Article
Zolin E. Studia Logica. 2014. Vol. 102. No. 5. P. 1021-1039.

We give a new proof of the following result (originally due to Linial and Post): it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is derivable in a given calculus. The proof is by reduction from the undecidable halting problem for the so-called tag systems introduced by Post. We also give a historical survey of related results.

Added: Jun 14, 2018