Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A Comparison of Mizar and Isar
Journal of Automated Reasoning
Pure Type Systems with Definitions
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Omega: Towards a Mathematical Assistant
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
User Interaction with the Matita Proof Assistant
Journal of Automated Reasoning
Computerizing Mathematical Text with MathLang
Electronic Notes in Theoretical Computer Science (ENTCS)
Revisions as an Essential Tool to Maintain Mathematical Repositories
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Narrative Structure of Mathematical Texts
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
On Correctness of Mathematical Texts from a Logical and Practical Point of View
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Unifying Math Ontologies: A Tale of Two Standards
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
On duplication in mathematical repositories
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Translating mathematical vernacular into knowledge repositories
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Assisted proof document authoring
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Textbook proofs meet formal logic: the problem of underspecification and granularity
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Toward an object-oriented structure for mathematical text
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Translating a fragment of weak type theory into type theory with open terms
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Hi-index | 0.00 |
We provide a syntax and a derivation system fora formal language of mathematics called Weak Type Theory (WTT). We give the metatheory of WTT and a number of illustrative examples.WTT is a refinement of de Bruijn's Mathematical Vernacular (MV) and hence:– WTT is faithful to the mathematician's language yet isformal and avoids ambiguities. – WTT is close to the usualway in which mathematicians express themselves in writing.– WTT has a syntaxbased on linguistic categories instead of set/type theoretic constructs.More so than MV however, WTT has a precise abstractsyntax whose derivation rules resemble those of modern typetheory enabling us to establish important desirable properties of WTT such as strong normalisation, decidability of type checking andsubject reduction. The derivation system allows one to establish thata book written in WTT is well-formed following the syntax ofWTT, and has great resemblance with ordinary mathematics books.WTT (like MV) is weak as regardscorrectness: the rules of WTT only concern linguisticcorrectness, its types are purely linguistic sothat the formal translation into WTT is satisfactory as areadable, well-organized text. In WTT, logico-mathematical aspects of truth are disregarded. This separates concerns and means that WTT– can be easily understood by either a mathematician, a logician or a computerscientist, and– acts as an intermediary between thelanguage of mathematicians and that of logicians.