We gratefully acknowledge support from
the Simons Foundation
and member institutions

Logic in Computer Science

Authors and titles for cs.LO in May 2012

[ total of 39 entries: 1-10 | 11-20 | 21-30 | 31-39 ]
[ showing 10 entries per page: fewer | more | all ]
[1]  arXiv:1205.0126 [pdf, ps, other]
Title: On the equivalence of game and denotational semantics for the probabilistic mu-calculus
Authors: Matteo Mio (LIX, Ecole Polytechnique)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 1, 2012) lmcs:787
Subjects: Logic in Computer Science (cs.LO)
[2]  arXiv:1205.0139 [pdf, other]
Title: $λ$-Scale, a lambda calculus for spaces with dilations
Authors: Marius Buliga
Comments: massively re-written version, condensed, relative calculus introduced
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO); Metric Geometry (math.MG); Rings and Algebras (math.RA)
[3]  arXiv:1205.0357 [pdf, ps, other]
Title: Modes of Convergence for Term Graph Rewriting
Authors: Patrick Bahr (Department of Computer Science, University of Copenhagen)
Comments: arXiv admin note: substantial text overlap with arXiv:1107.0666
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 1, 2012) lmcs:935
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[4]  arXiv:1205.0679 [pdf, ps, other]
Title: Lower Bounds for Existential Pebble Games and k-Consistency Tests
Authors: Christoph Berkholz (RWTH Aachen University)
Journal-ref: Logical Methods in Computer Science, Volume 9, Issue 4 (October 8, 2013) lmcs:1010
Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
[5]  arXiv:1205.0722 [pdf, other]
Title: Generalized Complexity of ALC Subsumption
Authors: Arne Meier
Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
[6]  arXiv:1205.0913 [pdf, ps, other]
Title: Pebble games with algebraic rules
Subjects: Logic in Computer Science (cs.LO)
[7]  arXiv:1205.0946 [pdf, other]
Title: Constraint LTL Satisfiability Checking without Automata
Comments: 39 pages
Subjects: Logic in Computer Science (cs.LO)
[8]  arXiv:1205.1358 [pdf, ps, other]
Title: Preservation under Substructures modulo Bounded Cores
Comments: From v2 to v3: Corrected typos, edited sentences for better readability; Conjecture 1 of v2 is now resolved so it is now Theorem 4, its proof is included in a new section (Section 7), Thm i in v2 is now Thm i+1 for i >= 4; everything else remains the same. From v1 to v2: Thm i is now Thm i-1 for i >= 7, Corrected the proof of Theorem 10 (now Theorem 9) for B > 2 (statement is still correct)
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[9]  arXiv:1205.2117 [pdf, ps, other]
Title: Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
Authors: Bas Luttik
Subjects: Logic in Computer Science (cs.LO)
[10]  arXiv:1205.2492 [pdf, ps, other]
Title: Refining Inductive Types
Authors: Robert Atkey (University of Strathclyde), Patricia Johann (University of Strathclyde), Neil Ghani (University of Strathclyde)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 4, 2012) lmcs:957
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[ total of 39 entries: 1-10 | 11-20 | 21-30 | 31-39 ]
[ showing 10 entries per page: fewer | more | all ]

Disable MathJax (What is MathJax?)