Results 1 
4 of
4
The Mathematical Import Of Zermelo's WellOrdering Theorem
 Bull. Symbolic Logic
, 1997
"... this paper, the seminal results of set theory are woven together in terms of a unifying mathematical motif, one whose transmutations serve to illuminate the historical development of the subject. The motif is foreshadowed in Cantor's diagonal proof, and emerges in the interstices of the inclusi ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
this paper, the seminal results of set theory are woven together in terms of a unifying mathematical motif, one whose transmutations serve to illuminate the historical development of the subject. The motif is foreshadowed in Cantor's diagonal proof, and emerges in the interstices of the inclusion vs. membership distinction, a distinction only clarified at the turn of this century, remarkable though this may seem. Russell runs with this distinction, but is quickly caught on the horns of his wellknown paradox, an early expression of our motif. The motif becomes fully manifest through the study of functions f :
Progress in the Development of Automated Theorem Proving for Higherorder Logic
"... The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of firstorder Automated Theorem Proving (ATP) systems. Recently, the TPTP has been extended to include problems in higherorder log ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of firstorder Automated Theorem Proving (ATP) systems. Recently, the TPTP has been extended to include problems in higherorder logic, with corresponding infrastructure and resources. This paper describes the practical progress that has been made towards the goal of TPTP support for higherorder ATP systems.
Requirements, Traceability and Formal Software Development or a Further Analysis of Requirements Traceability
, 1996
"... This paper is concerned with the interaction between formal software development and the issue of requirements traceability. The paper offers an analysis of the requirements traceability problem (see [1]) which takes into account software development using formal methods. Starting from the observati ..."
Abstract
 Add to MetaCart
(Show Context)
This paper is concerned with the interaction between formal software development and the issue of requirements traceability. The paper offers an analysis of the requirements traceability problem (see [1]) which takes into account software development using formal methods. Starting from the observation that formal software development is not an infallible method of producing error free and `correct' code (see [2]); sources of error identified as in [3] are used to motivate a new analysis of the requirements traceability problem. Traceability is divided into: PreRequirements Specification, PreFormal Requirements Specification and PostFormal Requirements traceability, a finer distinction than is made by Gotel and Finkelstein in [1]. This distinction is motivated by the problems associated with the process of formalizing a prose requirements specification document together with an The work described here forms part of the DATUM project (grant GR/H8994, project number IED4/19314) in t...