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.

Environment and Classical Channels in Categorical Quantum Mechanics: Label: en
The Ackermann Award 2009: Label: en
Nominal Domain Theory for Concurrency: Label: en
On the Complexity of Branching-Time Logics: Label: en
Decision Problems for Nash Equilibria in Stochastic Games: Label: en
Confluence of Pure Differential Nets with Promotion: Label: en
Model Checking FO(R) over One-Counter Processes and beyond: Label: en
Non-Commutative First-Order Sequent Calculus: Label: en
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References: Label: en
Nested Hoare Triples and Frame Rules for Higher-Order Store: Label: en
Decidable Extensions of Church’s Problem: Label: en
Focalisation and Classical Realisability: Label: en
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions: Label: en
Nondeterminism and Observable Sequentiality: Label: en
Automatic Structures of Bounded Degree Revisited: Label: en
On the Parameterised Intractability of Monadic Second-Order Logic: Label: en
Deciding the Inductive Validity of ∀ ∃ * Queries: Label: en
Efficient Type-Checking for Amortised Heap-Space Analysis: Label: en
On Model Checking Boolean BI: Label: en
Craig Interpolation for Linear Temporal Languages: Label: en
Upper Bounds on Stream I/O Using Semantic Interpretations: Label: en
Degrees of Undecidability in Term Rewriting: Label: en
Enriching an Effect Calculus with Linear Types: Label: en
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata: Label: en
Intersection, Universally Quantified, and Reference Types: Label: en
On the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way Communication: Label: en
EXPTIME Tableaux for the Coalgebraic μ-Calculus: Label: en
Expanding the Realm of Systematic Proof Theory: Label: en
On the Relation between Sized-Types Based Termination and Semantic Labelling: Label: en
From Coinductive Proofs to Exact Real Arithmetic: Label: en
Cardinality Quantifiers in MLO over Trees: Label: en
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems: Label: en
Algorithmic Analysis of Array-Accessing Programs: Label: en
Tree-Width for First Order Formulae: Label: en
Jumping Boxes: Label: en
Typed Applicative Structures and Normalization by Evaluation for System F ω: Label: en
Kleene’s Amazing Second Recursion Theorem: Label: en
Fixed-Point Definability and Polynomial Time: Label: en
Functional Interpretations of Intuitionistic Linear Logic: Label: en
Space-Efficient Computation by Interaction: Label: en
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus: Label: en
Separation Logic for Higher-Order Store: Label: en
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates: Label: en
Church Synthesis Problem with Parameters: Label: en
Acyclicity and Coherence in Multiplicative Exponential Linear Logic: Label: en
Normalization of IZF with Replacement: Label: en
Hoare Logic in the Abstract: Label: en
On the Expressive Power of Graph Logic: Label: en
Universal Structures and the Logic of Forbidden Patterns: Label: en
Universality Results for Models in Locally Boolean Domains: Label: en