Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Model checking existential logic on partially ordered sets: Label: en
Eilenberg-MacLane spaces in homotopy type theory: Label: en
Compositional verification of termination-preserving refinement of concurrent programs: Label: en
Transition systems over games: Label: en
Hyper-Ackermannian bounds for pushdown vector addition systems: Label: en
Infinite sequential games with real-valued payoffs: Label: en
On Hanf-equivalence and the number of embeddings of small induced subgraphs: Label: en
Local temporal reasoning: Label: en
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity: Label: en
On the succinctness of query rewriting over shallow ontologies: Label: en
A quest for algorithmically random infinite structures: Label: en
Probably safe or live: Label: en
Functional reactive types: Label: en
Axioms and decidability for type isomorphism in the presence of sums: Label: en
Memoryful geometry of interaction: Label: en
Abstract interpretation from Büchi automata: Label: en
No proof nets for MLL with units: Label: en
Preservation and decomposition theorems for bounded degree structures: Label: en
Senescent ground tree rewrite systems: Label: en
Subclasses of presburger arithmetic and the weak EXP hierarchy: Label: en
Equilibria of concurrent games on event structures: Label: en
Symmetric normalisation for intuitionistic logic: Label: en
KAT + B!: Label: en
Achieving new upper bounds for the hypergraph duality problem through logic: Label: en
Satisfiability modulo counting: Label: en
Substitution, jumps, and algebraic effects: Label: en
Pattern logics and auxiliary relations: Label: en
On periodically iterated morphisms: Label: en
A new correctness criterion for MLL proof nets: Label: en
Expressive completeness of separation logic with two variables and no separating conjunction: Label: en
On the pigeonhole and related principles in deep inference and monotone systems: Label: en
The geometry of synchronization: Label: en
System F with coercion constraints: Label: en
On the total variation distance of labelled Markov chains: Label: en
One hierarchy spawns another: Label: en
The tractability frontier of graph-like first-order query sets: Label: en
Equality and fixpoints in the calculus of structures: Label: en
Decidability of weak logics with deterministic transitive closure: Label: en
Symmetry in concurrent games: Label: en
Weak MSO: Label: en
Secure equilibria in weighted games: Label: en
A decision procedure for satisfiability in separation logic with inductive predicates: Label: en
On the characterization of models of H: Label: en
The complexity of admissibility in Omega-regular games: Label: en
Zero-reachability in probabilistic multi-counter automata: Label: en
Coinduction up-to in a fibrational setting: Label: en
Logical characterization of weighted pebble walking automata: Label: en
Logic for communicating automata with parameterized topology: Label: en
Decomposition theorems and model-checking for the modal μ -calculus: Label: en
Two-way cost automata and cost logics over infinite trees: Label: en