Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Some undecidable theories with monadic predicates and without equality

From MaRDI portal
Publication:3931375
Jump to:navigation, search

DOI10.1007/BF02011640zbMATH Open0475.03022MaRDI QIDQ3931375FDOQ3931375


Authors: Hans Kleine Büning Edit this on Wikidata


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

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3931375&oldid=17618330"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 22:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki