Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Set theory for verification. II: Induction and recursion

Set theory for verification. II: Induction and recursion 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Automated Reasoning Springer Journals

Set theory for verification. II: Induction and recursion

Journal of Automated Reasoning , Volume 15 (2) – Dec 10, 2004

Loading next page...
 
/lp/springer-journals/set-theory-for-verification-ii-induction-and-recursion-8aIOllQvxw

References (33)

Publisher
Springer Journals
Copyright
Copyright
Subject
Computer Science; Mathematical Logic and Formal Languages; Artificial Intelligence; Mathematical Logic and Foundations; Symbolic and Algebraic Manipulation
ISSN
0168-7433
eISSN
1573-0670
DOI
10.1007/BF00881916
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Journal of Automated ReasoningSpringer Journals

Published: Dec 10, 2004

There are no references for this article.