## Computer programming and formal systems |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

abstract computer algorithm alphabet ambiguous functions application arbitrary arguments atomic formula automata automatic programming axioms called CF grammar CF language coefficients computable functions conditional expressions conditional form conditional operator consider construct contains context-free definition denote described domain Dyck language elementary logic elements equivalent evaluated example F(Vt fact finite automaton finite control automaton formal power series formal systems given grammar G Herbrand's heuristics infinite integers lambda removal linear grammar Lisp machine language mapping n-tuples non-terminal notation null[x number theory occurrence particular polynomial possible predicate calculus prenex form problem programming language proof method Property prove push-down list quantifier recursion induction recursive functions reduced form regular event represented rules satisfies sentence set of strings solution special-purpose statement structural description Suppose tape tautology terminal strings theorem theory of computation theory of equations tion truth values Turing machine undefined universal simulation