Full Text Available
Access Full Text at Repository
Search Results - "Computer Science"
-
Descriptive Complexity for Counting Complexity Classes
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
Online Article RSS Article -
Efficient and Modular Coalgebraic Partition Refinement
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
Call-by-name Gradual Type Theory
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
Probabilistic logics based on Riesz spaces
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
Language Preservation Problems in Parametric Timed Automata
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
A Categorical Reconstruction of Quantum Theory
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
Non-idempotent types for classical calculi in natural deduction style
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
Modalities in homotopy type theory
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
On the logical complexity of cyclic arithmetic
Published in Logical Methods in Computer Science (2020)Subjects: “…Computer Science & IT…”
Get full text
-
Concurrency and Probability: Removing Confusion, Compositionally
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Relational $star$-Liftings for Differential Privacy
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Logical and Algebraic Characterizations of Rational Transductions
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Definable isomorphism problem
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
A Curry-Howard Approach to Church's Synthesis
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Computing the Width of Non-deterministic Automata
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Flow Logic
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text
-
Lifting Coalgebra Modalities and $mathsf{MELL}$ Model Structure to Eilenberg-Moore Categories
Published in Logical Methods in Computer Science (2019)Subjects: “…Computer Science & IT…”
Get full text