Results 1  10
of
10
NonStandard Analysis in ACL2
, 2001
"... ACL2 refers to a mathematical logic based on applicative Common Lisp, as well as to an automated theorem prover for this logic. The numeric system of ACL2 reflects that of Common Lisp, including the rational and complexrational numbers and excluding the real and complex irrationals. In conjunction ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
ACL2 refers to a mathematical logic based on applicative Common Lisp, as well as to an automated theorem prover for this logic. The numeric system of ACL2 reflects that of Common Lisp, including the rational and complexrational numbers and excluding the real and complex irrationals. In conjunction with the arithmetic completion axioms, this numeric type system makes it possible to prove the nonexistence of specific irrational numbers, such as √2. This paper describes ACL2(r), a version of ACL2 with support for the real and complex numbers. The modifications are based on nonstandard analysis, which interacts better with the discrete flavor of ACL2 than does traditional analysis.
A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application to Newton's Principia
 PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE15
, 1998
"... The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolutely geometric in nature but contains "infinitesimal" elements and the presence of motion that take it beyond the traditional boundaries ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolutely geometric in nature but contains "infinitesimal" elements and the presence of motion that take it beyond the traditional boundaries of Euclidean Geometry. These present difficulties that prevent Newton's proofs from being mechanised using only the existing geometry theorem proving (GTP) techniques. Using
The Use of a Formal Simulator to Verify a Simple Real Time Control Program
 In Beauty Is Our Business
, 1990
"... We present an initial and elementary investigation of the formal specification and mechanical verification of programs that interact with environments. We describe a formal, mechanically produced proof that a simple, real time control program keeps a vehicle on a straightline course in a variable cr ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We present an initial and elementary investigation of the formal specification and mechanical verification of programs that interact with environments. We describe a formal, mechanically produced proof that a simple, real time control program keeps a vehicle on a straightline course in a variable crosswind. To formalize the specification we define a mathematical function which models the interaction of the program and its environment. We then state and prove two theorems about this function: the simulated vehicle never gets farther than three units away from the intended course and homes to the course if the wind ever remains steady for at least four sampling intervals.
On the Mechanization of Real Analysis in Isabelle/HOL
"... Our recent, and still ongoing, development of real analysis in Isabelle/HOL is presented and compared, whenever instructive, to the one present in the theorem prover HOL. While most existing mechanizations of analysis only use the classical and approach, ours uses notions from both Nonstandard ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Our recent, and still ongoing, development of real analysis in Isabelle/HOL is presented and compared, whenever instructive, to the one present in the theorem prover HOL. While most existing mechanizations of analysis only use the classical and approach, ours uses notions from both Nonstandard Analysis and classical analysis. The overall result is an intuitive, yet rigorous, development of real analysis, and a relatively high degree of proof automation in many cases.
SET VARIABLES
"... ABSTRACT: A procedure is described that gives values to set variables in automatic theorem proving. The result is that a theorem is thereby reduced to first order logic, which is often much easier to prove. This procedure handles a part of higher order logic, a small but important part. It is not as ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT: A procedure is described that gives values to set variables in automatic theorem proving. The result is that a theorem is thereby reduced to first order logic, which is often much easier to prove. This procedure handles a part of higher order logic, a small but important part. It is not as general as the methods of Huet, Andrews, Pietrzykowski, and Haynes and Henschen, but it seems to be much faster when it applies. It is more in the spirit of J.L. Darlington's FMatching. This procedure is not domain specific: results have been obtained In intermediate analysis (the intermediate value theorem), topology, logic, and program verification (finding internal assertions). This method is a "maximal method" in that a largest (or maximal) set is usually produced if there is one. A preliminary version has been programmed for the computer and run to prove several theorems.
Woody Bledsoe His Life and Legacy
"... Lou Gehrig’s disease. Woody was one of the founders of AI, making early contributions in pattern recognition and automated reasoning. He continued to make significant contributions to AI throughout his long career. His legacy consists not only of his scientific work but also of several generations o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Lou Gehrig’s disease. Woody was one of the founders of AI, making early contributions in pattern recognition and automated reasoning. He continued to make significant contributions to AI throughout his long career. His legacy consists not only of his scientific work but also of several generations of scientists who learned from Woody the joy of scientific research and the way to go about it. Woody’s enthusiasm, his perpetual sense of optimism, his cando attitude, and his deep sense of duty to humanity offered those who knew him the hope and comfort that truly good and great men do exist.
Automating Proof in Nonstandard Analysis
, 2001
"... Abstract. Nonstandard analysis provides a framework to carry out formally calculus proofs in a much more intuitive manner than in the ɛ − δ formulation of Weierstraß. This paper introduces the notions of proofplanning and rippling, and gives an example showing how they can be applied to nonstanda ..."
Abstract
 Add to MetaCart
Abstract. Nonstandard analysis provides a framework to carry out formally calculus proofs in a much more intuitive manner than in the ɛ − δ formulation of Weierstraß. This paper introduces the notions of proofplanning and rippling, and gives an example showing how they can be applied to nonstandard analysis to produce readable proofs. We present the related work in the area and give an outline of the proposed work. 1
In Memoriam Woodrow Wilson Bledsoe
"... by mathematics and recalls spending "hours just roaming around, sometimes working mathematics problems mentally" (Bledsoe 1976). When Woody was 12, his father died. It was a devastating blow both emotionally and financially. As Woody recalled, "We were poor before, but after papa died in January 19 ..."
Abstract
 Add to MetaCart
by mathematics and recalls spending "hours just roaming around, sometimes working mathematics problems mentally" (Bledsoe 1976). When Woody was 12, his father died. It was a devastating blow both emotionally and financially. As Woody recalled, "We were poor before, but after papa died in January 1934, things got worse" (Bledsoe 1976). He and the rest of his brothers and sisters worked dreary 10hour days to make ends meet. Woody ran away from home at 16. He found work in north Texas driving a tractor all night. After a month, he hopped a freight train to Colorado to visit his brother, who was working in a Civilian Conservation Corps camp. After a few weeks, he made his way to the south Texas town of Calliham, where he lived with some friends for a year. He graduated from high school during that year (1939). Woody then returned to live with his mother, who had moved to Norman, Oklahoma. He took a job as a dishwasher, working 12hour days 7 days a week. He enrolled at the University o