Paul J. Voda  Home/Search
Context Related
| ii.fmph.uniba.sk/~voda/grund.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fmph.uniba.sk/~voda/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The explication of (declarative) computer programming by the theories of of mathematical logic has become quite important with the advent of practically usable intelligent proof assistants targeted to the veri cation of computer programs. We will argue that the present day situation is reminiscent of the situation in the foundations of mathematics during the so-called Foundation Wars of 1920's. The platonists advocating the full use of Cantor's set theory battled with the intuitionists... (Update)
Similar documents based on text: More All
1.1: Recursion and Coding in PA by Techniques of Computer Programming - Voda (2001) (Correct)
1.0: An Exercise in Programming in PA: Fast Growing Hierarchy Functions - Voda (Correct)
1.0: A Note on the Exponential Relation in Peano Arithmetic II - Voda (2001) (Correct)
BibTeX entry: (Update)
P. J. Voda, Grundlagenstreit in the Theory of Programming, www.fmph.uniba.sk/svoda, 2003. 21 http://citeseer.ist.psu.edu/voda03grundlagenstreit.html More
@misc{ voda03grundlagenstreit,
author = "P. Voda",
title = "Grundlagenstreit in the Theory of Programming",
text = "P. J. Voda, Grundlagenstreit in the Theory of Programming, www.fmph.uniba.sk/svoda,
2003. 21",
year = "2003",
url = "citeseer.ist.psu.edu/voda03grundlagenstreit.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940
62 Subsystems of Second Order Arithmetic (context) - Simpson - 1999
13 Mathematical Logic (context) - eld - 1967
7 Merging HOL with set theory: preliminary experiments - Gordon - 1994
4 Weyl Vindicated: Das Kontinuum seventy years later (context) - Feferman - 1998
3 The consistency of the continuum hypothesis (context) - odel - 1990
2 a versatile environment for human-readable formal proof docu.. (context) - Wenzel, Isar - 2002
2 Challenges to Predicative Foundations of Arithmetic - Feferman, Hellman - 2000
2 The Fifteen Provers of the World - Wiedijk - 2002
2 Report Computer Science Laboratory (context) - Owre, Shankar et al. - 1997
2 ur die reine und angewandte Mathematik (context) - von Neumann, der Mengenlehre - 1925
2 Predicative Justi cation and Development of Theory of Finite.. (context) - Voda - 2003
1 Die Wiederspruchsfreiheit der allgemeinen Mengenlehre (context) - Ackermann - 1937
1 Handbook of the Philosophy of Mathematics and Logic (context) - Feferman, to et al. - 2002
1 Wenzel Isabelle's Logics: HOL (context) - Nipkow, Paulson - 2002
1 What can we Gain by Integrating a Language Processor with a .. - Voda - 2003
1 Classifying Recursive Functions (context) - Schwichtenberg - 1999
1 uber dir Grundlagen der Analysis (context) - Weyl, Kontinuum - 1918
1 Proof theory at work: Program development in the Minlog syst.. (context) - Schwichtenberg, Benl et al. - 1998
www.ii.fmph.uniba.sk/cl/
Documents on the same site (http://www.fmph.uniba.sk/~voda/): More
Pair-Based Subrecursion - Voda (1994) (Correct)
Programming by Logic and Logic by Programming (Extended Abstract) - Voda, Komara (Correct)
Theorems of Péter and Parsons in Computer Programming - Komara, Voda (Correct)
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