Expressiveness and Succinctness of First-Order Logic on Finite Words
Expressiveness, and more recently, succinctness, are two central concerns of finite model theory and descriptive complexity theory. Succinctness is particularly interesting because it is closely related to the complexity-theoretic trade-off between parallel time and the amount of hardware. We develo...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
ScholarWorks@UMass Amherst
2011
|
| Subjects: | |
| Online Access: | https://scholarworks.umass.edu/open_access_dissertations/407 https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1419&context=open_access_dissertations |