Predicate Calculus with 'Undefined' as a Truth-Value,
Abstract
The author would like to use predicate calculus in the mathematical theory of computation. In particular, the author would like to write formulas involving recursively defined predicates and functions. The trouble is that recursively defined predicates are not guaranteed to be defined for all values of their arguments, and therefore, it is not clear how to interpret formulas involving them. The author gives an interpretation of predicate calculus formulas involving partial predicates and extends the notions of truth, valid formula and tautology. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 22, 1963
- Accession Number
- AD0744350
Entities
People
- John McCarthy
Organizations
- Stanford University