Model-interpretability into trees and applications

DOI10.1007/BF02276797MaRDI QIDQ4087166zbMATH OpenFDO

Authors Ivan Korec, Wolfgang Rautenberg

Publication date 1976

Published in Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137911

Mathematics Subject Classification ID

Trees (05C05) Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3266604 (Why is no real title available?)
• An application of games to the completeness problem for formalized theories
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Definability in structures of finite valency
• Interpretierbarkeit und Entscheidbarkeit in der Graphentheorie I
• Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory

Cited in

(3)

• A list of arithmetical structures complete with respect to the first-order definability
• The structure of the models of decidable monadic theories of graphs
• A uniform method for proving lower bounds on the computational complexity of logical theories

This page was built for publication: Model-interpretability into trees and applications

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