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.

Successor-Invariant First-Order Logic on Classes of Bounded Degree: Label: en
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity: Label: en
Combining probabilistic and non-deterministic choice via weak distributive laws: Label: en
Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure: Label: en
Lower Bounds for QBFs of Bounded Treewidth: Label: en
One-Clock Priced Timed Games are PSPACE-hard: Label: en
Uniformisations of Regular Relations Over Bi-Infinite Words: Label: en
Cones as a model of intuitionistic linear logic: Label: en
Modal Intuitionistic Logics as Dialgebraic Logics: Label: en
An Approach to Regular Separability in Vector Addition Systems: Label: en
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Label: en
Re-pairing brackets: Label: en
A Fixed Point Theorem on Lexicographic Lattice Structures: Label: en
On the Weisfeiler-Leman Dimension of Finite Groups: Label: en
A Cellular Howe Theorem: Label: en
Extensions of ω-Regular Languages: Label: en
First-order tree-to-tree functions: Label: en
Temporal Constraint Satisfaction Problems in Fixed-Point Logic: Label: en
The Complexity of Reachability in Affine Vector Addition Systems with States: Label: en
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution: Label: en
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes: Label: en
A Hennessy-Milner Theorem for ATL with Imperfect Information: Label: en
Modal Logics with Composition on Finite Forests: Label: en
Universal equivalence and majority of probabilistic programs over finite fields: Label: en
Deciding Differential Privacy for Programs with Finite Inputs and Outputs: Label: en
Complexity of controlled bad sequences over finite sets of Nd: Label: en
Reconciling noninterference and gradual typing: Label: en
Approximating Values of Generalized-Reachability Stochastic Games: Label: en
Algebraic models of simple type theories: Label: en
Space-efficient Query Evaluation over Probabilistic Event Streams: Label: en
The Integers as a Higher Inductive Type: Label: en
A Higher Structure Identity Principle: Label: en
Logic Beyond Formulas: Label: en
Contextual Types, Explained: Label: en
Automatic Structures: Label: en
A tale of intersection types: Label: en
When Reachability Meets Grzegorczyk: Label: en
Multimodal Dependent Type Theory: Label: en
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Label: en
A characterisation of ordered abstract probabilities: Label: en
Constructing Higher Inductive Types as Groupoid Quotients: Label: en
A Constructive Model of Directed Univalence in Bicubical Sets: Label: en
Automata Learning: Label: en
On Computability of Logical Approaches to Branching-Time Property Verification of Programs: Label: en
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic: Label: en
Making Streett Determinization Tight: Label: en
Sequential Colimits in Homotopy Type Theory: Label: en
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata: Label: en
Resolving finite indeterminacy: Label: en
Partial Univalence in n-truncated Type Theory: Label: en