Full Text Available
Access Full Text at Repository
Search Results - Computer and Information Science
-
The Church Problem for Countable Ordinals
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
The Omega Rule is $mathbf{Pi_{1}^{1}}$-Complete in the $lambdabeta$-Calculus
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Footprints in Local Reasoning
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Neighbourhood Structures: Bisimilarity and Basic Model Theory
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
On tiered small jump operators
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Cut-Simulation and Impredicativity
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Antichains for the Automata-Based Approach to Model-Checking
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Datalog on Linear Orders
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Safe Lambda Calculus
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Beyond Language Equivalence on Visibly Pushdown Automata
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Bootstrapping Inductive and Coinductive Types in HasCASL
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the Expressive Power of 2-Stack Visibly Pushdown Automata
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Wadge Hierarchy of Deterministic Tree Languages
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Rational Deconstruction of Landin's SECD Machine with the J Operator
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
First-Order and Temporal Logics for Nested Words
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text