Set Theory for Verification: II. Induction and Recursion
| dc.creator | Paulson, Lawrence C. | |
| dc.date | 2000-11-14 | |
| dc.date.accessioned | 2026-07-07T09:12:19Z | |
| dc.date.available | 2026-07-07T09:12:19Z | |
| dc.description | A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other computational reasoning. Inductively defined sets are expressed as least fixedpoints, applying the Knaster-Tarski Theorem over a suitable set. Recursive functions are defined by well-founded recursion and its derivatives, such as transfinite recursion. Recursive data structures are expressed by applying the Knaster-Tarski Theorem to a set, such as V[omega], that is closed under Cartesian product and disjoint sum. Worked examples include the transitive closure of a relation, lists, variable-branching trees and mutually recursive trees and forests. The Schröder-Bernstein Theorem and the soundness of propositional logic are proved in Isabelle sessions. | |
| dc.identifier | https://arxiv.org/abs/cs/9511102 | |
| dc.identifier | http://arxiv.org/abs/cs/9511102 | |
| dc.identifier | published in Journal of Journal of Automated Reasoning 15 (1995), 167-215 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151984 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.2.4; F.3.1; F.4.1 | |
| dc.title | Set Theory for Verification: II. Induction and Recursion | |
| dc.type | text |