Graduate studies at Western
|Abstract||Mathematical statements arising from program verification are believed to be much easier to deal with than statements coming from serious mathematics. At least this is true for “normal programming”.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
M. Giaquinto (2002). The Search for Certainty: A Philosophical Account of Foundations of Mathematics. Oxford University Press.
James H. Fetzer (1988). Program Verification: The Very Idea. Communications of the ACM 31 (9):1048--1063.
Mark Colyvan (2011). Fictionalism in the Philosophy of Mathematics. In E. J. Craig (ed.), Routledge Encyclopedia of Philosophy.
James Franklin (1996). Proof in Mathematics. Quakers Hill Press.
Charles Sayward (2003). Does Scientific Realism Entail Mathematical Realism? Facta Philosophica 5:173-182.
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
Rainer Willi Maurer, Falsification of Theories Without Verification of Basic Statements – an Argument for the Possibility of Knowledge Growth.
Uri Pincas (2011). Program Verification and Functioning of Operative Computing Revisited: How About Mathematics Engineering? [REVIEW] Minds and Machines 21 (2):337-359.
Added to index2009-01-28
Total downloads12 ( #101,269 of 739,466 )
Recent downloads (6 months)1 ( #61,680 of 739,466 )
How can I increase my downloads?