We analyse the space complexity of specific formula structures constructed using the core language of the LogicGuard framework. Unlike previous analysis which focused on the local space complex around a single quantifier, in this work we fix the global structure of the formula enough to allow analysis as a whole. Though we end up with precise results for two very specific cases, we show that these cases are upper and lower bounds of arbitrary formulae with similar structure. We ignore cases which need infinite space as previous work deals with them sufficiently.
| Original language | English |
|---|
| Place of Publication | RISC Hagenberg |
|---|
| Publisher | RISC |
|---|
| Number of pages | 32 |
|---|
| Publication status | Published - Oct 2015 |
|---|
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics
- Computation in Informatics and Mathematics