scientific article; zbMATH DE number 3304995
From MaRDI portal
Publication:5586299
zbMath0192.05502MaRDI QIDQ5586299
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Monadic second-order definable graph transductions: a survey ⋮ Trees, grids, and MSO decidability: from graphs to matroids ⋮ Succinct definitions in the first order theory of graphs ⋮ Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries ⋮ The undecidability of the lattice of r. e. closed subsets of an effective topological space ⋮ Some general incompleteness results for partial correctness logics ⋮ Unnamed Item ⋮ Relations in monadic third-order logic ⋮ The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ The recursive sets in certain monadic second order fragments of arithmetic ⋮ The monadic second-order logic of graphs. IX: Machines and their behaviours ⋮ The monadic second-order logic of graphs. VII: Graphs as relational structures ⋮ A new method for undecidability proofs of first order theories ⋮ Further Generalizations of Results on Structures of Continuous Functions ⋮ There are just four second-order quantifiers ⋮ Some new results on decidability for elementary algebra and geometry ⋮ The undecidability of the elementary theory of lattices of all equational theories of large signature ⋮ Undecidability of Brouwerian semilattices ⋮ The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings ⋮ The monadic second-order logic of graphs. VIII: Orientations ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ First order theory of permutation groups ⋮ On infinite transition graphs having a decidable monadic theory ⋮ The structure of the models of decidable monadic theories of graphs
This page was built for publication:
