2319:-
Uppskattad leveranstid 10-15 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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?
- Format: Inbunden
- ISBN: 9780192867964
- Språk: Engelska
- Antal sidor: 672
- Utgivningsdatum: 2023-03-30
- Förlag: OUP Oxford