Validity and Entailment in Modal and Propositional Dependence Logics

Subjects: “…Computer Science & IT…”
Get full text

Generalised Mermin-type non-locality arguments

Subjects: “…Computer Science & IT…”
Get full text

Canonical Models and the Complexity of Modal Team Logic

Subjects: “…Computer Science & IT…”
Get full text

Streamability of nested word transductions

Subjects: “…Computer Science & IT…”
Get full text

Abstract Hidden Markov Models: a monadic account of quantitative information flow

Subjects: “…Computer Science & IT…”
Get full text

Moschovakis Extension of Represented Spaces

Subjects: “…Computer Science & IT…”
Get full text

Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture

Subjects: “…Computer Science & IT…”
Get full text

On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory

Subjects: “…Computer Science & IT…”
Get full text

A classical groupoid model for quantum networks

Subjects: “…Computer Science & IT…”
Get full text

Proving Soundness of Extensional Normal-Form Bisimilarities

Subjects: “…Computer Science & IT…”
Get full text

Topological Scott Convergence Theorem

Subjects: “…Computer Science & IT…”
Get full text

Initial Semantics for Reduction Rules

Subjects: “…Computer Science & IT…”
Get full text

Stone-Type Dualities for Separation Logics

Subjects: “…Computer Science & IT…”
Get full text

On the First-Order Complexity of Induced Subgraph Isomorphism

Subjects: “…Computer Science & IT…”
Get full text

Capturing Polynomial Time using Modular Decomposition

Subjects: “…Computer Science & IT…”
Get full text

Web spaces and worldwide web spaces: topological aspects of domain theory

Subjects: “…Computer Science & IT…”
Get full text

The principle of pointfree continuity

Subjects: “…Computer Science & IT…”
Get full text

On the Incomparability of Cache Algorithms in Terms of Timing Leakage

Subjects: “…Computer Science & IT…”
Get full text

Displayed Categories

Subjects: “…Computer Science & IT…”
Get full text

Shortest paths in one-counter systems

Subjects: “…Computer Science & IT…”
Get full text