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 #51 to #100.

A Sequent Calculus for Type Theory: Label: en
An Algebraic Point of View on the Crane Beach Property: Label: en
Game Quantification on Automatic Structures and Hierarchical Model Checking Games: Label: en
Solving Games Without Determinization: Label: en
Complete Problems for Higher Order Logics: Label: en
Weak Bisimulation Approximants: Label: en
Infinite State Model-Checking of Propositional Dynamic Logics: Label: en
First-Order Queries over One Unary Function: Label: en
Jump from Parallel to Sequential Proofs: Multiplicatives: Label: en
Relating Two Standard Notions of Secrecy: Label: en
Algorithms for Omega-Regular Games with Imperfect Information: Label: en
Nash Equilibrium for Upward-Closed Objectives: Label: en
Concurrent Games with Tail Objectives: Label: en
Reasoning About States of Probabilistic Sequential Programs: Label: en
On Rational Trees: Label: en
Towards an Implicit Characterization of NC k: Label: en
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction: Label: en
Abstracting Allocation: Label: en
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay: Label: en
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic: Label: en
Logical Omniscience Via Proof Complexity: Label: en
The Power of Linear Functions: Label: en
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata: Label: en
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation: Label: en
Semi-continuous Sized Types and Termination: Label: en
Nonmonotonic Logics and Their Algebraic Foundations: Label: en
Automata and Logics for Words and Trees over an Infinite Alphabet: Label: en
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract): Label: en
Functorial Boxes in String Diagrams: Label: en
The Symbolic Approach to Repeated Games (Abstract): Label: en
Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract): Label: en
Unbounded Proof-Length Speed-Up in Deduction Modulo: Label: en
A Cut-Free and Invariant-Free Sequent Calculus for PLTL: Label: en
Incorporating Tables into Proofs: Label: en
Focusing and Polarization in Intuitionistic Logic: Label: en
Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete: Label: en
Linear Realizability: Label: en
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic: Label: en
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping: Label: en
On the Complexity of Reasoning About Dynamic Policies: Label: en
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words: Label: en
Building Decision Procedures in the Calculus of Inductive Constructions: Label: en
Classical Program Extraction in the Calculus of Constructions: Label: en
Not Enough Points Is Enough: Label: en
Typed Normal Form Bisimulation: Label: en
Lambda Theories of Effective Lambda Models: Label: en
A Soft Type Assignment System for λ-Calculus: Label: en
The Theory of Calculi with Explicit Substitutions Revisited: Label: en
Integrating Linear Arithmetic into Superposition Calculus: Label: en
On Acyclic Conjunctive Queries and Constant Delay Enumeration: Label: en