Answers to two old questions are given in this paper. 1. Modal logic S4, which was informally specified by Gödel in 1933 as a logic for provability, meets its exact provability interpretation. 2. Brouwer-Heyting-Kolmogorov realizing operations (1931-32) for intuitionistic logic Int also get exact interpretation as corresponding propositional operations on proofs; both S4 and Int turn out to be complete with respect to this proof realization. These results are based on operational reading of S4, where a modality is split into three operations. The logic of proofs with these operations is shown to be arithmetically complete with respect to the intended provability semantics and sufficient to realize every operation on proofs admitting propositional specification in arithmetic.

In this paper individual proofs are integrated into provability logic. Systems of axioms for a logic with operators "A is provable" and "p is a proof of A" are introduced, provided with Kripke semantics and decision procedure. Completeness theorems with respect to the arithmetical interpretation are proved. 1 Introduction In [1] and [2] proofs were incorporated into propositional logic by means of labeled modalities. The basic labeled modal logic contains the propositional logic enriched by unary operators 2 p i , i = 0; 1; 2; : : : . This language helps to provide a logical treatment of a rather general situation when we are interested not only to know that a certain statement A is valid, but also have to keep track on some evidences of its validness: 2 p A may stand for "p is a proof of A", "p is a program which computes A", "A has a proof of the complexity p", etc. The language of the provability logic ([3]) with the provability operator 2 only, where 2A stands for "A is provable...

Logics with the strong provability operator ": : : is true and provable" together with the proof operators "p is a proof of : : :" are axiomatized. Kripkestyle completeness, decidability and arithmetical completeness of these logics are established. 1 Introduction Logics with the provability operator ": : : is provable" and the proof operators "p is a proof of : : :" corresponding to certain natural classes of proof predicates in Peano arithmetic PA were introduced in [1]. In some respect (see e.g. [2],[3]) the strong provability operator ": : : is true and provable" provides a better model for provability than the operator ": : : is provable". The logic of the strong provability operator is known ([4]) to coincide with Grzegorczyk logic Grz. In this paper we present joint logics with both the strong provability operator and the proof operators. These logics are proved to be decidable; natural Research supported by the grant No. 2.1.21 of the Program "Universities of Russia"and ...

Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen and elsewhere in the 1920s

Inspired by a similar use in provability logic, formulas p ≻B q and p �B q are introduced in the existing logical framework for discussing beliefs to express that the strength of belief in p is greater than (or equal to) that in q. This explicit mention of the comparison in the logical language aids in defining several other concepts in a uniform way, viz. older and rather clear concepts like the operators for universality (which possibilities ought to be considered), together with newer notions like plausibility (in the sense of ‘more plausible than not’) and disbelief. Moreover, it assists in studying the properties of the concept of greater strength of belief itself. A heavy part is played in our investigations by the relationship between the standard plausibility ordering of the worlds and the strength of belief ordering. If we try to define the strength of belief ordering in terms of the world plausibility ordering we get some undesirable consequences, so we have decided to keep the relation between the two orderings as light as possible to construct a system that allows for widely different interpretations. Finally, after a brief discussion on the multi-agent setting, we move on to talk about the dynamics- the change of ordering under the influence of hard and soft information.

this paper give us a clear idea about what axioms one should add to these logics in order to reach the completeness in a specific case, and what sort of models (Kripke, arithmetical) are relevant to complexity measures. In what follows we assume, for short, the Peano Arithmetic PA to be the basic theory for proof and provability predicates. We denote the usual Godel proof predicate "x is a godelnumber of a proof of the formula with the godelnumber y" as Proof (x; y)

Abstract not found

Abstract not found

Abstract. In this paper we study the interpretations of a weak arithmetic, like Buss ’ theory S1 2, in a given theory U. We call these interpretations the arithmetics of U. We develop the basics of the structure of the arithmetics of U. We study the provability logic(s) of U from the standpoint of the framework of the arithmetics of U. Finally, we provide a deeper study of the arithmetics