Results 101 to 110 of about 1,681 (204)
On spectra of sentences of monadic second order logic with counting
Journal of Symbolic Logic, 2004 Abstract.We show that the spectrum of a sentence ϕ in Counting Monadic Second Order Logic (CMSOL) using one binary relation symbol and finitely many unary relation symbols, is ultimately periodic, provided all the models of ϕ are of clique width at most k, for some fixed k. We prove a similar statement for arbitrary finite relational vocabularies τ and
Eldar Fischer, Johann A. Makowsky
openaire +2 more sources
A Hierarchical Approach to Monadic Second-Order Logic over Graphs
, 1997 . The expressiveness of existential monadic second-order logic is investigated over several classes of finite graphs among them the graphs of bounded tree-width. A hierarchical approach to the decomposition of graphs is introduced which is related to the
Ina Schiering
core
On the Expressive Power of Some Extensions of Linear Temporal Logic
Моделирование и анализ информационных систем, 2018 One of the most simple models of computation which is suitable for representation of reactive systems behaviour is a finite state transducer which operates over an input alphabet of control signals and an output alphabet of basic actions.
Anton Gnatenko, Vladimir Zakharov
doaj +1 more source
A monadic logic of ordered abelian groups
, 2020 A many-valued modal logic with connectives interpreted in the ordered additive group of real numbers is introduced as a modal counterpart of the one-variable fragment of a (monadic) first-order real-valued logic.
Metcalfe, George, Tuyt, Olim
core
The monadic second-order logic of graphs X: Linear orderings
, 1996 Graphs are finite and handled as relational structures. We give some answers to the following general questions: 1.(1) For which classes of graphs C is it possible to specify a linear ordering of the set of vertices of each graph of C by fixed monadic ...
Courcelle, Bruno
core +1 more source
On Expansions of Monadic Second-Order Logic with Dynamical Predicates
CoRRExpansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of Büchi and Elgot & Rabin on the subject in the 1960s.
Nieuwveld, J., Ouaknine, J.
openaire +4 more sources
Counterpart semantics for a second-order mu-calculus
, 2010 We propose a novel approach to the semantics of quantified μ-calculi, considering models where states are algebras; the evolution relation is given by a counterpart relation (a family of partial homomorphisms), allowing for the creation, deletion, and ...
Gadducci, Fabio +10 more
core +1 more source
Bounded Model Construction for Monadic Second-Order Logics [PDF]
, 2000 The monadic logics M2L-Str and WS1S have been successfully used for verification, although they are nonelementary decidable. Motivated by ideas from bounded model checking, we investigate procedures for bounded model construction for these logics. The problem is, given a formula φ and a bound k, does there exist a word model for φ of length k.
Abdelwaheb Ayari, David A. Basin
openaire +1 more source
Fine-grained Meta-Theorems for Vertex Integrity [PDF]
Logical Methods in Computer ScienceVertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj +1 more source
First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification. [PDF]
J Autom Reason, 2023 Middeldorp A +2 more
europepmc +1 more source