Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (Q810494)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability |
scientific article; zbMATH DE number 4213953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability |
scientific article; zbMATH DE number 4213953 |
Statements
Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (English)
0 references
1991
0 references
decision problem
0 references
quantified formulae
0 references
first order set theoretic language
0 references
unquantified formulae
0 references
choice operator
0 references
strong reflection principles
0 references
hereditarily finite sets
0 references
finite satisfiability
0 references
0.8854027390480042
0 references
0.8737771511077881
0 references
0.8587638139724731
0 references
0.8453553915023804
0 references
