A. Kolmogoroff. Zur Deutung der Intuitionistischen Logik. Mathematische Zeitschrift, Bd. 35 (1932), H. 1, S. 57--65.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....A as a problem Generate any element of A ; K(A) is complexity of this problem. Evidently, K(A) minfK(x) j x 2 Ag, so this generalization gives nothing really new. However, it can be combined with the definition of logical operations on sets of strings that goes back to Kolmogorov s paper [5] and Kleene s notion of realizability [4] Let A and B be two sets of strings. We define sets A B, A B and A B as follows: The authors were partially supported by Russian Foundation for Basic Research grants 01 01 01028 and 01 01 00505 ffl A B = fha; bi j a 2 A; b 2 Bg ffl A B = fh0; ai j ....

A. Kolmogoroff. Zur Deutung der Intuitionistischen Logik. Mathematische Zeitschrift, Bd. 35 (1932), H. 1, S. 57--65.

....that the assumption that there is a proof for the statement leads to a contradiction. In 1931 34 Heyting and Kolmogorov made Brouwer s definition of intuitionistic truth explicit, though informal, by introducing what is now known as the Brouwer Heyting Kolmogorov (BHK) semantics ( 48] 49] [52]) The BHK semantics is widely recognized as the intended semantics for intuitionistic logic ( 30] 31] 38] 56] 67] 71] 94] 95] 97] 98] 101] 104] Its description uses the unexplained primitive notions of construction and proof (Kolmogorov used the term problem solution for ....

....of knowledge, calculus and typed theories, nonmonotonic reasoning, automated deduction and formal verification. Logical systems with built in provability were anticipated by Kolmogorov and Godel since the 1930s. In particular, Kolmogorov in ( 53] commented on his BHK paper of 1932: The paper [52] was written with the hope that the logic of solutions of problems would later become a regular part of courses on logic. It was intended to construct a unified logical apparatus dealing with objects of two types propositions and problems. The traditional mathematical model based on the ....

[Article contains additional citation context not shown here]

A. Kolmogoroff, Zur Deutung der intuitionistischen logik, Mathematische Zeitschrift, vol. 35 (1932), pp. 58--65, English translation in Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, (V.M. Tikhomirov, editor) .

....a proof of A returns a proof of B, ffl absurdity is a proposition which has no proof and a proof of :A is a construction which, given a proof of A, would return a proof of . This semantics was partially introduced by Heyting [29] clauses for conjunction and disjunction) and by Kolmogorov [34] (clauses for implication and negation) The above formulation of BHK semantics appeared in [30] For further comments one may consult [18] 20] 24] 69] 72] 73] 74] The natural problem of formalizing BHK semantics and establishing the completeness of Int with respect to this semantics ....

....intuitionistic logic Int in terms of the intuitionistic understanding of constructions and proofs. His semantics gives a partial analysis of the intuitionistic meaning of a statement and does not intend to provide a foundation for Int independent of the intuitionistic assumptions. Kolmogorov in [34] intended to interpret Int on the basis of the usual mathematical notion of problem solution (e.g. proof) and thus to provide a definition of intuitionistic logic within classical mathematics. Kolmogorov suggested reading Int as the calculus of solvable schemes of problems. The basic notions of ....

[Article contains additional citation context not shown here]

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik", Math. Ztschr., Bd. 35 (1932), S.58-65.

.... about the codes of t and F (cf. Section 4) A natural axiom system for LP along with the completeness theorem of this axiom system with respect to the arithmetical semantics was found in [2] The intuitionistic logic Int has an informal Brouwer Heyting Kolmogorov (BHK) operational semantics ( 9] [10], cf. 18] 7] 19] given in terms of logical conditions on the formulas and their proofs. A well known formalization of the BHK operations is made in the Curry Howard presentation of intuitionistic deductions as typed lambda terms, leading to the Propositions as Types paradigm. This duality ....

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik," Math. Ztschr., Bd. 35 (1932), S.58-65.

....connective, the Brouwer Heyting semantics and the Kolmogorov semantics have fundamentally different objectives. The Brouwer Heyting semantics explaines intuitionistic logic in terms of an undefined notion of intuitionistic proof. The Kolmogorov interpretation of Int as a calculus of problems [23], along with related papers by Godel [17] 18] intended to interpret Int on the basis of classical proofs, thus providing an independent definition of intuitionistic logic within the classical mathematics. Technical Report CFIS 98 06, Cornell University y 627 Rhodes Hall, Cornell University, ....

....corresponds to the non deterministic understanding of proof. 6.7 Corollary. Arithmetical completeness of Int. Int F iff there is a realization r and constant specification CS such that k(F ) r CS valid. Kolmogorov s interpretation of intuitionistic logic Int as a calculus of problems ([23]) can be made explicit via LP. 32 6.8 Definition. Let F be a formula in the intuitionistic propositional language. A formula F is Kolmogorov realizable if LP [k(F ) r for some realization r of modalities in k(F ) by proof polynomials. Kolmogorov logic (K) is the set of all Kolmogorov ....

[Article contains additional citation context not shown here]

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik", Math. Ztschr., Bd. 35 (1932), S.58-65.

....section, too, is nonstandard. It adds another variant to the many notions of realisability discussed for intuitionistic logic [51] The notion that comes closest to ours is the set theoretic realisability introduced by Medvedev [36] as an attempt to formalise Kolmogoroff s original explanation [30] of the intuitionistic connectives, called the Aufgabenrechnung by Kolmogoroff. According to Medvedev s interpretation of the 11 Aufgabenrechnung every atomic proposition ff represents a basic problem given by an associated set F (ff) of admissible possibilities and a subset X(ff) F (ff) of ....

A. Kolmogoroff. Zur Deutung der intuitionistischen Logik. Mathematische Zeitschrift, 35:58--65, 1932. 33

....restrictions imposed on the provability operator by Godel s second incompleteness theorem. LP formalizes the Kolmogorov calculus of problems and proves the Kolmogorov conjecture that intuitionistic logic coincides with the classical calculus of problems. Introduction In 1932 Kolmogorov ([16]) gave an informal description of the calculus of problems in classical mathematics and conjectured that it coincides with intuitioinistic propositional logic Int. Kleene realizability [15] Medvedev finite problems [23] and its variants ( 36] 37] are regarded (cf. 34] 10] 36] 37] as ....

....F Int F , LP (k(F ) r for some realization r: 3.6 Corollary. Arithmetical completeness of Int. Int F iff there is a realization r and constant specification CS such that k(F ) r CS valid. Kolmogorov s interpretation of intuitionistic logic Int as a calculus of problems ([16]) can be made explicit via LP . 3.7 Definition. Let F be a formula in the intuitionistic propositional language. A formula F is Kolmogorov realizable if LP [k(F ) r for some realization r of modalities in k(F ) by proof polynomials. Kolmogorov logic (K) is the set of all Kolmogorov ....

[Article contains additional citation context not shown here]

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik", Math. Ztschr., Bd. 35 (1932), S.58-65.

.... (email:sergei artemov.mian.su) This paper had been accomplished during a visit to the Department of Mathematics, Cornell University, Ithaca, NY 14853, USA, in 1995 (email: artemov math.cornell.edu) been supplied with an informal Brouwer Heyting Kolmogorov operational semantics in [6] [8], cf. 10] However, both S4 and Int have lacked exact descriptions of their intended semantics. The straightforward interpretation of 2F as F is provable in Peano Arithmetic leads to logics of formal provability incompatible with S4. Also, Kleene realizability is known to capture more, than Int ....

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik," Math. Ztschr., Bd. 35 (1932), S.58-65.

....to the intuitionistic connective, the Heyting semantics and the Kolmogorov semantics have fundamentally different objectives. The Heyting semantics explaines intuitionistic logic in terms of an undefined notion of intuitionistic proof. The Kolmogorov interpretation of Int as a calculus of problems [21], along with the related papers by Godel [15] 16] intended to interpret Int on the basis of classical proofs, thus providing an independent definition of intuitionistic logic within the classical mathematics. We call this sort of interpretation of Int classical BHK semantics. Classical ....

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik," Math. Ztschr., Bd. 35 (1932), S.58-65.

....exact intended semantics, where t is a proof of F is interpreted as a corresponding arithmetical formula about the codes of t and F . The decidability of LP was established in ( 2] along with the completeness of a natural axiom system for LP. The intuitionistic logic Int was supplied ( 7] [8], cf. 11] 5] 12] with an informal Brouwer Heyting Kolmogorov (BHK) operational semantics , which was given in terms of logical conditions on the formulas and their proofs, e.g. the implication clause is p proves A B iff p is a construction transforming any proof c of A into a proof p(c) ....

A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik," Math. Ztschr., Bd. 35 (1932), S.58-65.

....of development of computable (whatever that might turn out to mean) solutions to problems Our approach distills to one simple question: What does it mean to say that program p solves problem P which I write as p P . This is not a unique approach to the author I took it from Kolmogoroff[16]. Even though Markov and Kolmogoroff were important early contributors to what might be called constructive science , they had radically different ideas and approaches to computation. While the Markov model competed for attention with other views of computation, it was passed up for other ....

A. Kolmogoroff. Zur Deutung der intuitionistischen Logik. Mathmatische Zeitschrift, 33:58--65, 1932.

No context found.

A. Kolmogoroff. Zur Deutung der intuitionistischen Logik. Mathmatische Zeitschrift, 33:58--65, 1932.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC