Results 131 to 140 of about 1,681 (204)

Monadic Second-order Logic for Parameterized Verification

open access: yes, 1994
Much work in automatic verification considers families of similar finite-state systems. But an often overlooked property is that sometimes a single finite-state system can be used to describe a parameterized, infinite family of systems. Thus verification
Jensen, Jakob L.   +2 more
core  

A Syntactic Proof of the Decidability of First-Order Monadic Logic

open access: yes
Decidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided.
Tesi, Matteo   +1 more
core   +1 more source

Choice functions and well-orderings over the infinite binary tree

open access: yesOpen Mathematics, 2010
Carayol Arnaud   +3 more
doaj   +1 more source

The Monadic Second-Order Logic of Graphs XII: Planar graphs and planar maps

open access: yes, 1998
We prove that we can specify by formulas of monadic second-order logic the unique planar embedding of a 3-connected planar graph. If the planar graph is not 3-connected but given with a linear order of its set of edges, we can also define a planar ...
Bruno Courcelle
core  

Monadic Second-Order Logic, Graphs and Unfoldings of Transition Systems

open access: yes, 1995
We prove that every monadic second-order property of the unfoldingof a transition system is a monadic second-order property of thesystem itself.
Courcelle, Bruno, Walukiewicz, Igor
core  

Home - About - Disclaimer - Privacy