Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:57, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages |
scientific article |
Statements
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (English)
0 references
12 April 2023
0 references
satisfiability problem
0 references
computable set theory
0 references
Boolean set theory
0 references
expressibility
0 references
NP-completeness
0 references
proof verification
0 references
