J.L. Caldwell. Decidability Extracted: extracting tableau procedures for classical and intuitionistic propositional logic from formal proofs. PhD thesis, Cornell University, 1998. To appear.  Home/Search   Document Not in Database   Summary   Related Articles

....development of a proof of an appropriate theorem. The computational content of that proof then constitutes a correct search procedure. This approach has been used to develop verified decision procedures, namely tableau proof search algorithms for classical and constructive propositional logic [10, 47]. In this paper, we extend the idea to a large class of problems involving search, to produce a general template for development of search procedures. There are three main motivations of this work. First, we wished to create a framework which separates the search algorithm from domain specific ....

....extracted program. However, it should be noted that set types do not come for free; computationally, given an element x of fy:T P[y]g, we may use x freely but not the proof of P[x] This constraint leads to technical complications on the proof side which are addressed by methods described in [8, 9, 10]. The second aspect of Nuprl that is of interest to our efforts is that its computation system is untyped. The typing rules describe when a term inhabits a type, and are expressive enough to permit typing judgements about terms without always having to assign types to every subterm. In particular, ....

J.L. Caldwell. Decidability Extracted: extracting tableau procedures for classical and intuitionistic propositional logic from formal proofs. PhD thesis, Cornell University, 1998. To appear.

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