English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We analyze possibilities of second-order quantifier elimination for formulaecontaining parameters -- constants or functions. For this, we use a constraintresolution calculus obtained from specializing the hierarchical superpositioncalculus. If saturation terminates, we analyze possibilities of obtainingweakest constraints on parameters which guarantee satisfiability. If thesaturation does not terminate, we identify situations in which finiterepresentations of infinite saturated sets exist. We identify situations inwhich entailment between formulae expressed using second-order quantificationcan be effectively checked. We illustrate the ideas on a series of examplesfrom wireless network research.

Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)