Kein Profilbild | No profile picture | Utilisateur n'as pas d'image
https://philosophie.ch/profil/schwichtenberg

Helmut Schwichtenberg (schwichtenberg)

Contributions to Philosophie.ch

No contributions yet

Bibliography

    Bauer, F. L., Brauer, W. and Schwichtenberg, Helmut, eds. 1993. Logic and Algebra of Specification. Berlin: Springer.
    Benl, Holger, Berger, Ulrich, Schwichtenberg, Helmut, Seisenberger, Monika and Zuber, Wolfgang. 1998. Proof Theory at Work: Program Development in the Minlog System.” in Automated Deduction: A Basis for Applications. Volume II, Systems and Implementation Techniques, edited by Wolfgang Bibel and Peter H. Schmidt, pp. 41–72. Applied Logic Series n. 9. Dordrecht: Kluwer Academic Publishers.
    Schuster, Peter and Schwichtenberg, Helmut. 2004. Constructive Solutions of Continuous Equations.” in One Hundred Years of Russell’s Paradox. Mathematics, Logic, Philosophy, edited by Godehard Link, pp. 227–246. de Gruyter Series in Logic and Its Applications n. 6. Berlin: de Gruyter.
    Schwichtenberg, Helmut. 1977. Proof Theory: Some Applications of Cut Elimination.” in Handbook of Mathematical Logic, edited by Jon K. Barwise, pp. 867–896. Studies in Logic and the Foundations of Mathematics n. 90. Amsterdam: North-Holland Publishing Co.
    Schwichtenberg, Helmut. 1979. Logic and the Axiom of Choice.” in Logic Colloquium ’78, edited by Maurice Boffa, Dirk van Dalen, and Kenneth McAloon, pp. 351–356. Studies in Logic and the Foundations of Mathematics n. 97. Amsterdam: North-Holland Publishing Co.
    Schwichtenberg, Helmut. 1982. Complexity of Normalization in the Pure Typed Lambda-Calculus.” in The L.E.J. Brouwer Centenary Sympsoium, Proceedings of the Conference held in Noordwijkerhout, 8-13 June 1981, edited by Anne Sjerp Troelstra and Dirk van Dalen, pp. 453–457. Studies in Logic and the Foundations of Mathematics n. 110. Amsterdam: North-Holland Publishing Co.
    Schwichtenberg, Helmut, ed. 1997. Logic of Computation. Berlin: Springer.
    Schwichtenberg, Helmut. 2000. Beweise und Programme. Anmerkungen zu Heytings Formalisierung der intuitionistischen Logik.” Berichte und Abhandlungen der Berlin-Brandenburgischen Akademie der Wissenschaften 8: 71–94.
    Schwichtenberg, Helmut. 2007. Recursion on the Partial Continuous Functionals.” in Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28 – August 3, 2005, edited by Costas Dimitracopoulos, Ludomir Newelski, Dag Normann, and John R. Steel, pp. 173–201. Lecture Notes in Logic n. 28. Cambridge: Cambridge University Press.
    Schwichtenberg, Helmut. 2009. Program Extraction in Constructive Analysis.” in Logicism, Intuitionism, and Formalism. What Has Become of Them?, edited by Sten Lindström, Erik Palmgren, Krister Segerberg, and Viggo Stoltenberg-Hansen, pp. 255–276. Synthese Library n. 341. Dordrecht: Springer.
    Schwichtenberg, Helmut and Stroetman, K. 1997. From Higher Order Terms to Circuits.” in Logic, Methodology and Philosophy of Science X: Logic and Scientific Methods – Volume One of the Tenth International Congress of Logic, Methodology, and Philosophy of Science, Florence, 1995, edited by Maria Luisa Dalla Chiara, Kees Doets, Daniele Mundici, and Johan van Benthem, pp. 209–220. Synthese Library n. 259. Dordrecht: Kluwer Academic Publishers.
    Troelstra, Anne Sjerp and Schwichtenberg, Helmut. 1996. Proof Theory. Cambridge: Cambridge University Press. Second edition 2000.
    Troelstra, Anne Sjerp and Schwichtenberg, Helmut. 2000. Basic Proof Theory. 2nd ed. Cambridge: Cambridge University Press.