scientific article; zbMATH DE number 3266604
From MaRDI portal
Publication:5551141
zbMath0166.25801MaRDI QIDQ5551141
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (50)
On the Ehrenfeucht-Fraïssé game in theoretical computer science ⋮ On the complexity of theories of permutations ⋮ The complexity of first-order and monadic second-order logic revisited ⋮ A logical approach to locality in pictures languages ⋮ Existential MSO over two successors is strictly weaker than over linear orders ⋮ Virtual algebraic isomorphisms between predicate calculi of finite rich signatures ⋮ The complexity of model checking multi-stack systems ⋮ Algebraic and model-theoretic properties of tilings ⋮ Logische Kategorien ⋮ Subshifts as models for MSO logic ⋮ Property Testing for Bounded Degree Databases ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Solutions and query rewriting in data exchange ⋮ Composition Over the Natural Number Ordering with an Extra Binary Relation ⋮ Analysis and application of adaptive sampling ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Expressive power of SQL. ⋮ First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories ⋮ Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes ⋮ Locality and modular Ehrenfeucht-Fraïssé games ⋮ An optimal construction of Hanf sentences ⋮ Unnamed Item ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ The property of being a model complete theory is preserved by Cartesian extensions ⋮ Unnamed Item ⋮ Classifying regular events in symbolic logic ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Model-interpretability into trees and applications ⋮ Muller message-passing automata and logics ⋮ Myhill's work in recursion theory ⋮ Game-based notions of locality over finite models ⋮ Faith \& falsity ⋮ On elementary theories of graphs and Abelian loops ⋮ Message-passing automata are expressively equivalent to EMSO logic ⋮ The theory of successor with an extra predicate ⋮ Matrix hierarchies of first-order languages and their applications ⋮ A technique for proving decidability of containment and equivalence of linear constraint queries ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ A.D. Taimanov and model theory in Kazakhstan ⋮ An Automaton over Data Words That Captures EMSO Logic ⋮ Subshifts, Languages and Logic ⋮ On winning strategies in Ehrenfeucht-Fraïssé games ⋮ Some notes on graph automata, tiling systems and partition logic ⋮ A decision problem for decision problems ⋮ Local properties of query languages ⋮ The closure of monadic NP ⋮ Succinctness as a source of complexity in logical formalisms ⋮ Counting modulo quantifiers on finite structures ⋮ Turing machine computations in finitely axiomatizable theories ⋮ An explicit construction of graphs of bounded degree that are far from being Hamiltonian
This page was built for publication:
