Abstract
We show decidability of the existence of a model (a finite model) for sentences with the string of quantifiers ∀x(∃y 1... y n), for a language with equality, one one-place function, predicates and constants.
| Original language | English |
|---|---|
| Pages (from-to) | 32-44 |
| Number of pages | 13 |
| Journal | Israel Journal of Mathematics |
| Volume | 28 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Mar 1977 |
Fingerprint
Dive into the research topics of 'Decidability of a portion of the predicate calculus'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver