Some undecidable theories with monadic predicates and without equality

DOI10.1007/BF02011640zbMath0475.03022MaRDI QIDQ3931375

Hans Kleine Büning

Publication date: 1981

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

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

zbMATH Keywords

groupoiddecision problems for restricted first order theories

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Cites Work

• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The reachability problem for Petri nets and decision problems for Skolem arithmetic
• The Undecidability of Theories of Groupoids with an Extra Predicate
• Computability of Recursive Functions

This page was built for publication: Some undecidable theories with monadic predicates and without equality