Showing 161 - 180 results of 1,460 for search 'Logical Methods in Computer Science', זמן שאילתה: 0.45s Refine Results
  1. 161
    Infinite and Bi-infinite Words with Decidable Monadic Theories

    Infinite and Bi-infinite Words with Decidable Monadic Theories מאת Dietrich Kuske, Jiamou Liu, Anastasia Moskvina

    יצא לאור 2018-08-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  2. 162
    A rich hierarchy of functionals of finite types

    A rich hierarchy of functionals of finite types מאת Dag Normann

    יצא לאור 2009-09-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  3. 163
    On the strictness of the quantifier structure hierarchy in first-order logic

    On the strictness of the quantifier structure hierarchy in first-order logic מאת Yuguo He

    יצא לאור 2014-11-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  4. 164
    On Higher-Order Probabilistic Subrecursion

    On Higher-Order Probabilistic Subrecursion מאת Flavien Breuvart, Ugo Dal Lago, Agathe Herrou

    יצא לאור 2021-12-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  5. 165
    Bounded Reachability Problems are Decidable in FIFO Machines

    Bounded Reachability Problems are Decidable in FIFO Machines מאת Benedikt Bollig, Alain Finkel, Amrita Suresh

    יצא לאור 2022-01-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  6. 166
    The Shapley Value of Tuples in Query Answering

    The Shapley Value of Tuples in Query Answering מאת Ester Livshits, Leopoldo Bertossi, Benny Kimelfeld, Moshe Sebag

    יצא לאור 2021-09-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  7. 167
    Sub-computable Boundedness Randomness

    Sub-computable Boundedness Randomness מאת Sam Buss, Douglas Cenzer, Jeffrey B. Remmel

    יצא לאור 2014-12-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  8. 168
    On Robustness for the Skolem, Positivity and Ultimate Positivity Problems

    On Robustness for the Skolem, Positivity and Ultimate Positivity Problems מאת S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala

    יצא לאור 2024-06-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  9. 169
    (Leftmost-Outermost) Beta Reduction is Invariant, Indeed

    (Leftmost-Outermost) Beta Reduction is Invariant, Indeed מאת Beniamino Accattoli, Ugo Dal Lago

    יצא לאור 2016-03-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  10. 170
    The Computational Complexity of Propositional Cirquent Calculus

    The Computational Complexity of Propositional Cirquent Calculus מאת Matthew Steven Bauer

    יצא לאור 2015-03-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  11. 171
    Modal Interface Automata

    Modal Interface Automata מאת Gerald Lüttgen, Walter Vogler

    יצא לאור 2013-08-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  12. 172
    Pumping lemmas for weighted automata

    Pumping lemmas for weighted automata מאת Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros

    יצא לאור 2021-07-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  13. 173
    Kripke Semantics for Martin-L\"of's Extensional Type Theory

    Kripke Semantics for Martin-L\"of's Extensional Type Theory מאת Steve Awodey, Florian Rabe

    יצא לאור 2011-09-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  14. 174
    Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types

    Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types מאת Daisuke Kimura, Makoto Tatsuta

    יצא לאור 2013-03-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  15. 175
    Subspace-Invariant AC$^0$ Formulas

    Subspace-Invariant AC$^0$ Formulas מאת Benjamin Rossman

    יצא לאור 2019-07-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  16. 176
    Computable analysis and notions of continuity in Coq

    Computable analysis and notions of continuity in Coq מאת Florian Steinberg, Laurent Thery, Holger Thies

    יצא לאור 2021-05-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  17. 177
    Complexity classifications for different equivalence and audit problems for Boolean circuits

    Complexity classifications for different equivalence and audit problems for Boolean circuits מאת Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer

    יצא לאור 2012-09-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  18. 178
    Ologisms

    Ologisms מאת Ruggero Pagnan

    יצא לאור 2018-08-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  19. 179
    A Framework for Certified Self-Stabilization

    A Framework for Certified Self-Stabilization מאת Karine Altisen, Pierre Corbineau, Stephane Devismes

    יצא לאור 2017-11-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article
  20. 180
    Parametric updates in parametric timed automata

    Parametric updates in parametric timed automata מאת Étienne André, Didier Lime, Mathias Ramparison

    יצא לאור 2021-05-01
    "...Logical Methods in Computer Science e.V...."
    קבל טקסט מלא
    Article

כלי חיפוש: