Message sequence charts (MSCs) naturally arise as executions of communicating finite-state machines (CFMs), in which processes exchange messages through unbounded FIFO channels. We study the first-order logic MSCs, featuring Lamport's happened-before relation. To this end, we introduce a star-free version propositional dynamic (PDL) with loop and converse. Our main results state that (i) every ...

Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such as of the λ-binder of the lambda-calculus or the ∀binder of first-order logic. It also allows us to finitely axiomatise arithmetic, and similarly to axiomatise ‘nominal’ datatypes-with-binding. Just like ...

In this paper, we discourse an analysis of classical first-order predicate logic as a constraint satisfaction problem, CSP. First, will offer our general framework for CSPs, and then apply it to logic. We claim would function new semantics, Then, prove the soundness completeness theorems with respect semantics. The latter theorem, which be proven by proof-search method, implies cut-elimination ...