1984
DOI: 10.1007/bf02267217
|View full text |Cite
|
Sign up to set email alerts
|

Computation in the philosophy curriculum

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1985
1985
2014
2014

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Logic programs, for example, foster the development of techniques and algorithms in automated proof theory. (Ager, 1984), (Larsen, et. al., 1978) Programs such as Turing's World and Tarski's World enable students to construct Turing machines and semantics in first order logic, where the products of their affcwtaarenot inert pieces of paper, but mal machines.…”
Section: Hypertext Cognitive Science and Phibsophymentioning
confidence: 96%
“…Logic programs, for example, foster the development of techniques and algorithms in automated proof theory. (Ager, 1984), (Larsen, et. al., 1978) Programs such as Turing's World and Tarski's World enable students to construct Turing machines and semantics in first order logic, where the products of their affcwtaarenot inert pieces of paper, but mal machines.…”
Section: Hypertext Cognitive Science and Phibsophymentioning
confidence: 96%
“…Deductive proof checking programs constitute the most popular form of CAI for teaching logic at the university level (Ager, 1984;Covey, 1985;Croy, 1986). When solving proof problems, students apply rules which generate new symbolic expressions from those already given (premises) until the goal expression (conclusion) is produced.…”
Section: Supplementary Proof Checking and Intelligent Caimentioning
confidence: 99%