Meaning Formulas for Syntax-Based Mathematical Algorithms

2 pages•Published: December 4, 2014

Abstract

A meaning formula for a symbolic algorithm is a statement that captures the mathematical relationship between the input and output expressions of the algorithm. We examine how meaning formulas can be expressed and proved in a formal logic and how they can be used to represent mathematical knowledge and to define mathematical services.

In: Temur Kutsia and Andrei Voronkov (editors). SCSS 2014. 6th International Symposium on Symbolic Computation in Software Science, vol 30, pages 10-11.

Links:	https://easychair.org/publications/paper/xnX
	https://doi.org/10.29007/zd7s

BibTeX entry

@inproceedings{SCSS2014:Meaning_Formulas_Syntax_Based,
  author    = {William Farmer},
  title     = {Meaning Formulas for Syntax-Based Mathematical Algorithms},
  booktitle = {SCSS 2014. 6th International Symposium on Symbolic Computation in Software Science},
  editor    = {Temur Kutsia and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {30},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/xnX},
  doi       = {10.29007/zd7s},
  pages     = {10-11},
  year      = {2014}}

Download PDF Open PDF in browser