Computers and Mathematics 1989
DOI: 10.1007/978-1-4613-9647-5_26
|View full text |Cite
|
Sign up to set email alerts
|

Representation of Inference in Computer Algebra Systems with Applications to Intelligent Tutoring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1994
1994
2014
2014

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…1 The syntax for a piece of active mathematics corresponds to the usual notion of the recursive structure of the mathematics: how a mathematical object or statement i s composed of operations applied to zero or more arguments. The syntax used to denote an object can be speci ed in the usual way in a formal expression language for recursive structures.…”
Section: Introductionmentioning
confidence: 99%
“…1 The syntax for a piece of active mathematics corresponds to the usual notion of the recursive structure of the mathematics: how a mathematical object or statement i s composed of operations applied to zero or more arguments. The syntax used to denote an object can be speci ed in the usual way in a formal expression language for recursive structures.…”
Section: Introductionmentioning
confidence: 99%