Results 1  10
of
33
Little Theories
 Automated DeductionCADE11, volume 607 of Lecture Notes in Computer Science
, 1992
"... In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theories may be related by inclusion or by theory interpretation. We argue that the little theories approach is a desirable wa ..."
Abstract

Cited by 52 (16 self)
 Add to MetaCart
(Show Context)
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theories may be related by inclusion or by theory interpretation. We argue that the little theories approach is a desirable way to formalize mathematics, and we describe how imps, an Interactive Mathematical Proof System, supports it.
Theory Interpretation in Simple Type Theory
 HIGHERORDER ALGEBRA, LOGIC, AND TERM REWRITING, VOLUME 816 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1993
"... Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself. This paper presents a method for theory interpretation in a version of simple type theory, called lutins, which admit ..."
Abstract

Cited by 36 (16 self)
 Add to MetaCart
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself. This paper presents a method for theory interpretation in a version of simple type theory, called lutins, which admits partial functions and subtypes. The method is patterned on the standard approach to theory interpretation in rstorder logic. Although the method is based on a nonclassical version of simple type theory, it is intended as a guide for theory interpretation in classical simple type theories as well as in predicate logics with partial functions.
From Total Equational to Partial First Order Logic
, 1998
"... The focus of this chapter is the incremental presentation of partial firstorder logic, seen as a powerful framework where the specification of most data types can be directly represented in the most natural way. Both model theory and logical deduction are described in full detail. Alternatives to pa ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
The focus of this chapter is the incremental presentation of partial firstorder logic, seen as a powerful framework where the specification of most data types can be directly represented in the most natural way. Both model theory and logical deduction are described in full detail. Alternatives to partiality, like (variants of) error algebras and ordersortedness are also discussed, showing their uses and limitations. Moreover, both the total and the partial (positive) conditional fragment are investigated in detail, and in particular the existence of initial (free) models for such restricted logical paradigms is proved. Some more powerful algebraic frameworks are sketched at the end. Equational specifications introduced in last chapter, are a powerful tool to represent the most common data types used in programming languages and their semantics. Indeed, Bergstra and Tucker have shown in a series of papers (see [BT87] for a complete exposition of results) that a data type is semicompu...
An Infrastructure for Intertheory Reasoning
 AUTOMATED DEDUCTIONCADE17
, 2000
"... The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex systems. This paper presents an infrastructure for intertheory reasoning that can support applications of the little theories meth ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex systems. This paper presents an infrastructure for intertheory reasoning that can support applications of the little theories method. The infrastructure includes machinery to store theories and theory interpretations, to store known theorems of a theory with the theory, and to make denitions in a theory by extending the theory "in place". The infrastructure is an extension of the intertheory infrastructure employed in the imps Interactive Mathematical Proof System.
IMPS: System Description
 Automated DeductionCADE11, volume 607 of Lecture Notes in Computer Science
, 1992
"... 1 other equally abstract theories. Theory interpretations provide the mechanism for transporting theorems. The little theories style of the axiomatic method is employed extensively in mathematical practice; in [4], we discuss its benets for mechanical theorem provers, and how the approach is used ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
1 other equally abstract theories. Theory interpretations provide the mechanism for transporting theorems. The little theories style of the axiomatic method is employed extensively in mathematical practice; in [4], we discuss its benets for mechanical theorem provers, and how the approach is used in imps. Logic. Standard mathematical reasoning in many areas focuses on functions and their properties, together with operations on functions. For this reason, imps is based on a version of simple type theory. 1 However, we have adopted a version, called lutins, 2 containing partial functions, because they are ubiquitous in both mathematics and computer science. Although terms, such as 2=0, may be nondenoting, the logic is bivalent and formulas always have a truth value. In particular, an atomic formula is false if any of its constituents is nondenoting. This conventio
An Overview of A Formal Framework For Managing Mathematics
 Annals of Mathematics and Artificial Intelligence
, 2003
"... Mathematics is a process of creating, exploring, and connecting mathematical models. This paper presents an overview of a formal framework for managing the mathematics process as well as the mathematical knowledge produced by the process. The central idea of the framework is the notion of a biform t ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
(Show Context)
Mathematics is a process of creating, exploring, and connecting mathematical models. This paper presents an overview of a formal framework for managing the mathematics process as well as the mathematical knowledge produced by the process. The central idea of the framework is the notion of a biform theory which is simultaneously an axiomatic theory and an algorithmic theory. Representing a collection of mathematical models, a biform theory provides a formal context for both deduction and computation. The framework includes facilities for deriving theorems via a mixture of deduction and computation, constructing sound deduction and computation rules, and developing networks of biform theories linked by interpretations. The framework is not tied to a specific underlying logic; indeed, it is intended to be used with several background logics simultaneously. Many of the ideas and mechanisms used in the framework are inspired by the imps Interactive Mathematical Proof System and the Axiom computer algebra system.
STMM: A Set Theory for Mechanized Mathematics
 JOURNAL OF AUTOMATED REASONING
, 2000
"... Although set theory is the most popular foundation for mathematics, not many mechanized mathematics systems are based on set theory. ZermeloFraenkel (zf) set theory and other traditional set theories are not an adequate foundation for mechanized mathematics. stmm is a version of vonNeumannBerna ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
(Show Context)
Although set theory is the most popular foundation for mathematics, not many mechanized mathematics systems are based on set theory. ZermeloFraenkel (zf) set theory and other traditional set theories are not an adequate foundation for mechanized mathematics. stmm is a version of vonNeumannBernaysGödel (nbg) set theory that is intended to be a Set Theory for Mechanized Mathematics. stmm allows terms to denote proper classes and to be undened, has a denite description operator, provides a sort system for classifying terms by value, and includes lambdanotation with term constructors for function application and function abstraction. This paper describes stmm and discusses why it is a good foundation for mechanized mathematics.
A Set Theory with Support for Partial Functions
 STUDIA LOGICA
, 2000
"... Partial functions can be easily represented in set theory as certain sets of ordered pairs. However, classical set theory provides no special machinery for reasoning about partial functions. For instance, there is no direct way of handling the application of a function to an argument outside its dom ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Partial functions can be easily represented in set theory as certain sets of ordered pairs. However, classical set theory provides no special machinery for reasoning about partial functions. For instance, there is no direct way of handling the application of a function to an argument outside its domain as in partial logic. There is also no utilization of lambdanotation and sorts or types as in type theory. This paper introduces a version of vonNeumannBernaysGödel set theory for reasoning about sets, proper classes, and partial functions represented as classes of ordered pairs. The underlying logic of the system is a partial firstorder logic, so classvalued terms may be nondenoting. Functions can be specified using lambdanotation, and reasoning about the application of functions to arguments is facilitated using sorts similar to those employed in the logic of the imps Interactive Mathematical Proof System. The set theory is intended to serve as a foundation for mechanized mathematics systems.
Two computersupported proofs in metric space topology
 Notices of the American Mathematical Society
, 1991
"... Every mathematician will agree that the discovery, analysis, and communication ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Every mathematician will agree that the discovery, analysis, and communication
Formalizing undefinedness arising in calculus
 Automated Reasoning—IJCAR 2004
, 2004
"... Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements. The traditional approach enables statem ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
(Show Context)
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements. The traditional approach enables statements about partial functions and undefined terms to be stated very concisely. Unfortunately, the traditional approach cannot be easily employed in a standard logic in which all functions are total and all terms are defined, but it can be directly formalized in a standard logic if the logic is modified slightly to admit undefined terms and statements about definedness. This paper demonstrates this by defining a version of simple type theory called Simple Type Theory with Undefinedness (sttwu) and then formalizing in sttwu examples of undefinedness arising in calculus. The examples are taken from M. Spivak’s wellknown textbook Calculus. 1