Proof planning Non-standard Analysis
نویسندگان
چکیده
We describe how non-standard analysis can be used to prove real analysis theorems, and how these proofs can be automated using proof-planning. In particular we borrow from the constructive analysis notions of inductive partitioning, and show how transferring to the non-standard model for the reals allows us a simple proof of the correctness of partitioning algorithms for certain real analysis theorems.
منابع مشابه
Using proof-planning to investigate the structure of proof in non-standard analysis
This thesis presents an investigation into the structure of proof in non-standard analysis using proof-planning. The theory of non-standard analysis, developed by Robinson in the 1960s, offers a more algebraic way of looking at proof in analysis. Proof-planning is a technique for reasoning about proof at the meta-level. In this thesis, we use it to encapsulate the patterns of reasoning that occ...
متن کاملAutomating Proof in Non-standard Analysis
Non-standard analysis provides a framework to carry out formally calculus proofs in a much more intuitive manner than in the 2 − δ formulation of Weierstraß. This paper introduces the notions of proof-planning and rippling, and gives an example showing how they can be applied to non-standard analysis to produce readable proofs. We present the related work in the area and give an outline of the ...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملGroups with one conjugacy class of non-normal subgroups - a short proof
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
متن کاملMultiAgent Theorem Proving: Towards automating the dynamics of a proof
The proof planning systems available today are sequential systems. The hypothesis of this project is that the engineering of a proof planning system that is capable of dynamic, distributed, parallel proof planning will empower the paradigm of proof planning by unlocking its latent potential for these features. The system will be built on IsaPlanner, which is a proof planning system developed by...
متن کامل