Reasoning in Trees

Herman Ruge Jervell
Additional contact information
Herman Ruge Jervell: University of Oslo, Inst. of Informatics

A chapter in Mathematical Logic and Its Applications, 1987, pp 125-135 from Springer

Abstract: Abstract Most theories of computation start with the following: a set of states S; the initial states I — a subset of S; the terminal states τ — a subset of S; a set of moves M — mapping S in S.

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().