• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Towards Practical Reflection for Formal Mathematics

Cached

  • Download as a PDF

Download Links

  • [www.risc.uni-linz.ac.at]
  • [www.risc.jku.at]
  • [heim.ifi.uio.no]
  • [www.risc.uni-linz.ac.at]
  • [www.risc.jku.at]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Martin Giese , Bruno Buchberger
Citations:3 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Giese_towardspractical,
    author = {Martin Giese and Bruno Buchberger},
    title = {Towards Practical Reflection for Formal Mathematics},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract. We describe a design for a system for mathematical theory exploration that can be extended by implementing new reasoners using the logical input language of the system. Such new reasoners can be applied like the built-in reasoners, and it is possible to reason about them, e.g. proving their soundness, within the system. This is achieved in a practical and attractive way by adding reflection, i.e. a representation mechanism for terms and formulae, to the system’s logical language, and some knowledge about these entities to the system’s basic reasoners. The approach has been evaluated using a prototypical implementation called Mini-Tma. It will be incorporated into the Theorema system. 1

Citations

278 Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem - Bruijn - 1972
269 Higher-order abstract syntax - Pfenning, Elliott - 1988
191 The Mathematica Book - Wolfram - 1996
67 Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems - Buchberger - 1970
46 Metatheory and reflection in theorem proving: A survey and critique - Harrison - 1995
36 An algorithmic criterion for the solvability of algebraic systems of equations, Aequat - Buchberger - 1970
30 The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover - Boyer, Moore - 1988
27 The Boyer-Moore theorem prover and its interactive enhancement - Boyer, Kaufmann, et al. - 1995
12 F.Winkler : “Gröbner Bases and Applications - Buchberger - 1998
10 Towards self-verification of hol light - Harrison - 2006
9 Implementing Reflection in Nuprl - Barzilay - 2006
7 Predicate logic with sequence variables and sequence function symbols - Kutsia, Buchberger
5 Proof reflection in Coq - Hendriks
4 Verification Environment in Theorema - Kovacs, Popov, et al. - 2005
3 Clavel and José Meseguer. Reflection in conditional rewriting logic - Manuel
2 Temur Kutsia, Koji Nakagawa, Florina Piroi, Nikolaj Popov - Buchberger, Craciun, et al. - 2006
1 Lifting knowledge to the state of inferencing - Buchberger - 2004
1 Proving by first and intermediate principles - Buchberger
1 Proving by first and intermediate principles, November 2 - Buchberger - 2004
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University