Some undecidable theories with monadic predicates and without equality (Q3931375): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The reachability problem for Petri nets and decision problems for Skolem arithmetic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Undecidability of Theories of Groupoids with an Extra Predicate / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computability of Recursive Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5537599 / rank | |||
Normal rank | |||
Latest revision as of 14:31, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some undecidable theories with monadic predicates and without equality |
scientific article |
Statements
Some undecidable theories with monadic predicates and without equality (English)
0 references
1981
0 references
decision problems for restricted first order theories
0 references
groupoid
0 references
0 references
