Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory (Q3768865)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4027423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory |
scientific article; zbMATH DE number 4027423 |
Statements
Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory (English)
0 references
1988
0 references
upper bounds
0 references
decidability
0 references
set theory
0 references
encoding of syntax
0 references
syntactic objects
0 references
diagonalization lemma
0 references
0.9271209
0 references
0.89420295
0 references
0.8928478
0 references
0.88158536
0 references
0.8778267
0 references
0.87609446
0 references
0.87464994
0 references
0.87449133
0 references
0 references
