Article contents
An undecidable two sorted predicate calculus
Published online by Cambridge University Press: 12 March 2014
Extract
Let L be a first order predicate language with two sorts of variables and a single dyadic predicate letter whose first place is to be filled by variables of one sort and whose second place is to be filled by variables of the other sort. In answer to a question of M. H. Löb we show that there is no decision procedure for determining whether or not a sentence of L is universally valid.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1969
References
- 2
- Cited by