The following pages link to Computer Science Logic (Q3540165):
Displaying 50 items.
- Relativizing small complexity classes and their theories (Q260396) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- The Joy of String Diagrams (Q3540167) (← links)
- Model Transformations in Decidability Proofs for Monadic Theories (Q3540168) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
- Pure Pointer Programs with Iteration (Q3540172) (← links)
- Quantified Positive Temporal Constraints (Q3540173) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (Q3540175) (← links)
- Continuous Fragment of the mu-Calculus (Q3540176) (← links)
- On the Relations between the Syntactic Theories of λμ-Calculi (Q3540177) (← links)
- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)
- Proving Infinitude of Prime Numbers Using Binomial Coefficients (Q3540179) (← links)
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) (Q3540181) (← links)
- Quantitative Game Semantics for Linear Logic (Q3540182) (← links)
- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic (Q3540183) (← links)
- An Indexed System for Multiplicative Additive Polarized Linear Logic (Q3540184) (← links)
- A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators (Q3540185) (← links)
- Superposition for Fixed Domains (Q3540186) (← links)
- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T (Q3540187) (← links)
- On the Almighty Wand (Q3540188) (← links)
- On Counting Generalized Colorings (Q3540189) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (Q3540191) (← links)
- Quantitative Languages (Q3540192) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
- Syntactic Metatheory of Higher-Order Subtyping (Q3540196) (← links)
- On Isomorphisms of Intersection Types (Q3540197) (← links)
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence (Q3540198) (← links)
- Type-Based Termination with Sized Products (Q3540199) (← links)
- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries (Q3586028) (← links)
- Definability in Games (Q3586029) (← links)
- From Feasible Proofs to Feasible Computations (Q3586030) (← links)
- Tree Dualities for Constraint Satisfaction (Q3586031) (← links)
- Ordered Sets in the Calculus of Data Structures (Q3586032) (← links)
- Tableau Calculi for $\mathcal{CSL}$ over minspaces (Q3586033) (← links)
- A Resolution Mechanism for Prenex Gödel Logic (Q3586034) (← links)
- Efficient Enumeration for Conjunctive Queries over X-underbar Structures (Q3586035) (← links)
- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 (Q3586036) (← links)
- Automata vs. Logics on Data Words (Q3586037) (← links)
- Graded Computation Tree Logic with Binary Coding (Q3586038) (← links)
- Exact Exploration and Hanging Algorithms (Q3586039) (← links)
- Embedding Deduction Modulo into a Prover (Q3586040) (← links)
- Exponentials with Infinite Multiplicities (Q3586041) (← links)
- Classical and Intuitionistic Subexponential Logics Are Equally Expressive (Q3586042) (← links)
