Pratt-Hartmann considers for which fragments of first-order logic there is an effective method for determining satisfiability or finite satisfiability. Furthermore, he asks, if these problems are decidable for some fragment, what is their computational complexity?
Fragments of First-Order Logic
R1910,26
| Authors | |
|---|---|
| Language | |
| Copyright | |
| Publisher | |
| ISBN | 9780192693891 |
| Number Of Pages | 528 |
| File Size | 4.19 mb |
| Format | |
| Published | 06-04-2023 |
