Results 1 
5 of
5
Natural Deduction as HigherOrder Resolution
 Journal of Logic Programming
, 1986
"... An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a Horn clause. ..."
Abstract

Cited by 54 (8 self)
 Add to MetaCart
An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a Horn clause.
Set theory for verification: I. From foundations to functions
 J. Auto. Reas
, 1993
"... A logic for specification and verification is derived from the axioms of ZermeloFraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the flexibility to adapt to variants of set theory. Its higherord ..."
Abstract

Cited by 46 (18 self)
 Add to MetaCart
A logic for specification and verification is derived from the axioms of ZermeloFraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the flexibility to adapt to variants of set theory. Its higherorder syntax supports the definition of new binding operators. Unknowns in subgoals can be instantiated incrementally. The paper describes the derivation of rules for descriptions, relations and functions, and discusses interactive proofs of Cantor’s Theorem, the Composition of Homomorphisms challenge [9], and Ramsey’s Theorem [5]. A generic proof assistant can stand up against provers dedicated to particular logics. Key words. Isabelle, set theory, generic theorem proving, Ramsey’s Theorem,
Jape's Quiet Interface
, 1996
"... Jape is a proof editor designed for use by novices and to be programmed by tyro logicians. Its user interface intrudes as little as possible into the business of making and writing down a proof; its interface is passive, quiet in use. Four simple but important subprinciples  use specialpurpose f ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Jape is a proof editor designed for use by novices and to be programmed by tyro logicians. Its user interface intrudes as little as possible into the business of making and writing down a proof; its interface is passive, quiet in use. Four simple but important subprinciples  use specialpurpose fonts; make proof navigation simple; don't poke them in the eye with internal mechanisms; use the user's proof tradition  are illustrated. 1 User interface design: art or engineering? The conventional classification of computer science as engineering can sometimes obscure the creative aspects of our work. An understandable desire to abstract from experience, to save others from our own perceived mistakes, leads us to search for Principles of User Interface Design which are blueprints, methods, Good Practice. The idea is that novices should thoroughly learn our Principles and reverently follow them, so that Bad Design should vanish from the world. In our version of the world there are good...
A Preliminary User's Manual for Isabelle
"... The theorem prover Isabelle and several of its objectlogics are described. Where ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The theorem prover Isabelle and several of its objectlogics are described. Where
Set Theory as a Computational Logic: I. From Foundations to Functions
, 1992
"... ZermeloFraenkel (ZF) set theory is widely regarded as unsuitable for automated reasoning. But a computational logic has been formally derived from the ZF axioms using Isabelle. The library of theorems and derived rules, with Isabelle's proof tools, support a natural style of proof. The paper des ..."
Abstract
 Add to MetaCart
ZermeloFraenkel (ZF) set theory is widely regarded as unsuitable for automated reasoning. But a computational logic has been formally derived from the ZF axioms using Isabelle. The library of theorems and derived rules, with Isabelle's proof tools, support a natural style of proof. The paper describes the derivation of rules for descriptions, relations and functions, and discusses interactive proofs of Cantor's Theorem, the Composition of Homomorphisms challenge [3], and Ramsey's Theorem [2].