Entity usage

From MaRDI portal

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.

List of pages that use a given entity

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

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Sound up-to techniques and Complete abstract domains: Label: en
  2. Rewriting with Frobenius: Label: en
  3. Automaton-Based Criteria for Membership in CTL: Label: en
  4. On computability and tractability for infinite sets: Label: en
  5. Definable decompositions for graphs of bounded linear cliquewidth: Label: en
  6. Regular and First-Order List Functions: Label: en
  7. A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow: Label: en
  8. A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP: Label: en
  9. Extensional and Intensional Semantic Universes: Label: en
  10. Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes: Label: en
  11. Impredicative Encodings of (Higher) Inductive Types: Label: en
  12. Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem: Label: en
  13. Syntax and Semantics of Quantitative Type Theory: Label: en
  14. A Simple and Optimal Complementation Algorithm for Büchi Automata: Label: en
  15. Distribution-based objectives for Markov Decision Processes: Label: en
  16. Quasi-Open Bisimilarity with Mismatch is Intuitionistic: Label: en
  17. Continuous Reasoning: Label: en
  18. Inner Models of Univalence: Label: en
  19. Black Ninjas in the Dark: Label: en
  20. Separability by piecewise testable languages and downward closures beyond subwords: Label: en
  21. A theory of linear typings as flows on 3-valent graphs: Label: en
  22. A van Benthem Theorem for Fuzzy Modal Logic: Label: en
  23. Every λ-Term is Meaningful for the Infinitary Relational Model: Label: en
  24. Species, Profunctors and Taylor Expansion Weighted by SMCC: Label: en
  25. Guarded Computational Type Theory: Label: en
  26. A General Framework for Relational Parametricity: Label: en
  27. Computable decision making on the reals and other spaces: Label: en
  28. LMSO: Label: en
  29. A functional interpretation with state: Label: en
  30. Allegories: Label: en
  31. Differential Equation Axiomatization: Label: en
  32. Syntax and Semantics for Operations with Scopes: Label: en
  33. On the number of types in sparse graphs: Label: en
  34. Parameterized circuit complexity of model-checking on sparse structures: Label: en
  35. Degrees of Relatedness: Label: en
  36. MSO Queries on Trees: Label: en
  37. A Fixpoint Logic and Dependent Effects for Temporal Property Verification: Label: en
  38. The Geometry of Computation-Graph Abstraction: Label: en
  39. Dialectica models of type theory: Label: en
  40. An answer to the Gamma question: Label: en
  41. A sequent calculus with dependent types for classical arithmetic: Label: en
  42. Riesz Modal Logic with Threshold Operators: Label: en
  43. An Asynchronous Soundness Theorem for Concurrent Separation Logic: Label: en
  44. Ribbon Tensorial Logic: Label: en
  45. An Algebraic Theory of Markov Processes: Label: en
  46. Boolean-Valued Semantics for the Stochastic λ-Calculus: Label: en
  47. Enriching a Linear/Non-linear Lambda Calculus: Label: en
  48. Probabilistic Böhm Trees and Probabilistic Separation: Label: en
  49. A modal μ perspective on solving parity games in quasi-polynomial time: Label: en
  50. Around Classical and Intuitionistic Linear Logics: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)