scientific article; zbMATH DE number 3304995

Cited in

(25)

Trees, grids, and MSO decidability: from graphs to matroids
The monadic second-order logic of graphs. VII: Graphs as relational structures
Succinct definitions in the first order theory of graphs
The structure of the models of decidable monadic theories of graphs
Some new results on decidability for elementary algebra and geometry
The undecidability of the lattice of r. e. closed subsets of an effective topological space
A new method for undecidability proofs of first order theories
Algorithmic uses of the Feferman-Vaught theorem
Some general incompleteness results for partial correctness logics
The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences
Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
Monadic second-order definable graph transductions: a survey
Undecidability of Brouwerian semilattices
scientific article; zbMATH DE number 3578867 (Why is no real title available?)
First order theory of permutation groups
The recursive sets in certain monadic second order fragments of arithmetic
There are just four second-order quantifiers
The monadic second-order logic of graphs. VIII: Orientations
The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
On infinite transition graphs having a decidable monadic theory
The undecidability of the elementary theory of lattices of all equational theories of large signature
A logic-based approach to incremental reasoning on multi-agent systems
Relations in monadic third-order logic
Further generalizations of results on structures of continuous functions
The monadic second-order logic of graphs. IX: Machines and their behaviours

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586299)