The following pages link to Model Theory Makes Formulas Large (Q5428869):
Displayed 11 items.
- An optimal construction of Hanf sentences (Q420856) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- A generalization of the Łoś-Tarski preservation theorem (Q904143) (← links)
- The uniform measure of simple regular sets of infinite trees (Q2029602) (← links)
- The Compositional Method and Regular Reachability (Q4982089) (← links)
- (Q5002820) (← links)
- (Q5094135) (← links)
- Compositional Failure Detection in Structured Transition Systems (Q5200059) (← links)
- Effective Interpolation and Preservation in Guarded Logics (Q5277909) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)