Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies

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

Regular Separability of One Counter Automata

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

Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic

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

Bisimulations for Delimited-Control Operators

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

An $omega$-Algebra for Real-Time Energy Problems

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

The logical strength of Büchi's decidability theorem

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

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

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

Every metric space is separable in function realizability

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

On the Expressiveness and Monitoring of Metric Temporal Logic

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

A Denotational Semantics for SPARC TSO

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

A Strategy for Dynamic Programs: Start over and Muddle through

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

Covering and separation for logical fragments with modular predicates

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

Polishness of some topologies related to word or tree automata

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

Reasoning about effects: from lists to cyber-physical agents

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

The height of piecewise-testable languages and the complexity of the logic of subwords

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

All-Path Reachability Logic

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

Validity and Entailment in Modal and Propositional Dependence Logics

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

Generalised Mermin-type non-locality arguments

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

Canonical Models and the Complexity of Modal Team Logic

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

Streamability of nested word transductions

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