Results 11 to 20 of about 759,615 (239)
Finite dimensional Hilbert spaces are complete for dagger compact closed categories [PDF]
Logical Methods in Computer Science, 2012 We show that an equation follows from the axioms of dagger compact closed categories if and only if it holds in finite dimensional Hilbert spaces.
Peter Selinger
doaj +1 more source
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +1 more source
Reasoning about Data Repetitions with Counter Systems [PDF]
Logical Methods in Computer Science, 2016 We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past.
Stephane Demri +2 more
doaj +1 more source
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet [PDF]
Logical Methods in Computer Science, 2008 We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations.
Alexis Bès
doaj +1 more source
First-Order and Temporal Logics for Nested Words [PDF]
Logical Methods in Computer Science, 2008 Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML.
Rajeev Alur +5 more
doaj +1 more source
Event Structures for Petri nets with Persistence [PDF]
Logical Methods in Computer Science, 2018 Event structures are a well-accepted model of concurrency. In a seminal paper by Nielsen, Plotkin and Winskel, they are used to establish a bridge between the theory of domains and the approach to concurrency proposed by Petri.
Paolo Baldan +5 more
doaj +1 more source
A rich hierarchy of functionals of finite types [PDF]
Logical Methods in Computer Science, 2009 We are considering typed hierarchies of total, continuous functionals using complete, separable metric spaces at the base types. We pay special attention to the so called Urysohn space constructed by P. Urysohn. One of the properties of the Urysohn space
Dag Normann
doaj +1 more source
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
Logical Methods in Computer Science, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj +1 more source
Algebraic Notions of Termination [PDF]
Logical Methods in Computer Science, 2011 Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation.
Desharnais Jules +2 more
doaj +1 more source
Knowledge-Based Synthesis of Distributed Systems Using Event Structures [PDF]
Logical Methods in Computer Science, 2011 To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a
Mark Bickford +3 more
doaj +1 more source