Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with finite-model-theory
Search options not deleted
user 63140
4
votes
Accepted
What is the impact of encodings of sparse structures on the complexity of the model checking...
I don't know of any natural logic, but the following is in any case a logic for which the combined complexity of the model-checking problem is different for matrix and list encodings.
First, we know t …
- 1,284
3
votes
Why is order/choice an issue for a logic for PTIME
But what would be the issue if we extended IFP to just have an order
and made it that a structure satisfies a formula if it satisfies for
an arbitrary order?
If done this way, it is difficult to see …
- 1,284