•  25
    Leonard Bolc and Piotr Borowik: Many-valued logics: 1. Theoretical foundations, Berlin: Springer, 1991 (review)
    with Petr Hajek
    Journal of Applied Non-Classical Logics 4 (2): 215-220. 1994.
  •  1105
    Torkel Franzén, Gödel's Theorem: An Incomplete Guide to its Use and Abuse (review)
    History and Philosophy of Logic 26 (4): 369-371. 2005.
    On the heels of Franzén's fine technical exposition of Gödel's incompleteness theorems and related topics (Franzén 2004) comes this survey of the incompleteness theorems aimed at a general audience. Gödel's Theorem: An Incomplete Guide to its Use and Abuse is an extended and self-contained exposition of the incompleteness theorems and a discussion of what informal consequences can, and in particular cannot, be drawn from them.
  •  540
    Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in Göttingen in 1921 with a thesis on the decision problem. In his thesis, he solved - independently of Löwenheim and Skolem's earlier work - the decision problem for monadic second-order logic in a framework that combined elements of the algebra of logic and the newer axiomatic approach to logic then being developed in Göttingen. In a talk given in 1921, he outlined this solution, but also presented important programma…Read more
  •  45
    Hilbert's 'Verunglückter Beweis', the first epsilon theorem, and consistency proofs
    History and Philosophy of Logic 25 (2): 79-94. 2004.
    In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain "general consistency result" due to Bernays. An analysis of the form of this so-…Read more
  •  22
    Generalizing theorems in real closed fields
    Annals of Pure and Applied Logic 75 (1-2): 3-23. 1995.
    Jan Krajíček posed the following problem: Is there is a generalization result in the theory of real closed fields of the form: If A is provable in length k for all n ϵ ω , then A is provable? It is argued that the answer to this question depends on the particular formulation of the “theory of real closed fields.” Four distinct formulations are investigated with respect to their generalization behavior. It is shown that there is a positive answer to Krajíček's question for 1. the axiom system RCF…Read more