QuodLibet is a tactic-based inductive theorem proving system that meets todayâ€™s standard requirements for theorem provers such as a command interpreter, a sophisticated graphical user interface, andâ€¦ (More)

Inductive theorem proving in the form of descente infinie was known to the ancient Greeks and is the standard induction method of a working mathematician since it was reinvented in the middle of theâ€¦ (More)

We propose a speciication language for the formalization of data types with partial or non-terminating operations as part of a rewrite-based logical framework for inductive theorem proving. Theâ€¦ (More)

We present a constructor-based approach for assigning appropriate semantics to algebraic speciications given by nite sets of positive/negative-conditional equations. Under the assumption of con-uenceâ€¦ (More)

A practically useful mathematical assistant system requires the sophisticated combination of interaction and automation. Central in such a system is the proof data structure, which has to maintainâ€¦ (More)

We define and discuss various conceivable notions of inductive validity for first-order equational clauses. This is done within the framework of constructor-based positive/negative conditionalâ€¦ (More)

Free variables occur frequently in mathematics and computer science with ad hoc and altering semantics. We present here the most recent version of our free-variable framework for two-valued logicsâ€¦ (More)