Some undecidable theories with monadic predicates and without equality
From MaRDI portal
Publication:3931375
DOI10.1007/BF02011640zbMATH Open0475.03022MaRDI QIDQ3931375FDOQ3931375
Authors: 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
Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- Title not available (Why is that?)
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Computability of Recursive Functions
- The reachability problem for Petri nets and decision problems for Skolem arithmetic
- The Undecidability of Theories of Groupoids with an Extra Predicate
This page was built for publication: Some undecidable theories with monadic predicates and without equality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931375)