TY - CHAP

T1 - Polynomial-time decidability of a bounded universal theory of congruences modulo a prime number

AU - Kosovsky, Nikolay K.

PY - 2010

Y1 - 2010

N2 - Grigori Mints is one the most distinguished proof theorists of our time. He has contributed significantly not only to the subject in general but also to most of its applications. This collection of papers by a number of Mints' colleagues worldwide are both a personal tribute and a testimony to his breadth and importance by dealing with all areas in which Mints has worked: from proof-theoretical reductions through non-classical logics and category theory to automated theorem proving and proof mining, i.e., the extraction of mathematical information from formal proofs. The collection itself is significant for another reason: it bridges the two logical worlds in which Mints has worked, the world of the former Soviet Union and that of the West.

AB - Grigori Mints is one the most distinguished proof theorists of our time. He has contributed significantly not only to the subject in general but also to most of its applications. This collection of papers by a number of Mints' colleagues worldwide are both a personal tribute and a testimony to his breadth and importance by dealing with all areas in which Mints has worked: from proof-theoretical reductions through non-classical logics and category theory to automated theorem proving and proof mining, i.e., the extraction of mathematical information from formal proofs. The collection itself is significant for another reason: it bridges the two logical worlds in which Mints has worked, the world of the former Soviet Union and that of the West.

M3 - Chapter

SN - 9781848900127

SP - 310 стр., 2-8

BT - Proof, Categories, and Computations, Essays in Honor of Grigori Mints,

PB - College Publications

ER -