Conservative reduction classes of Krom formulas (Q3947642): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3905252 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The decision problem for formulas with a small number of atomic subformulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3856727 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5590814 / rank | |||
Normal rank | |||
Latest revision as of 15:58, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conservative reduction classes of Krom formulas |
scientific article |
Statements
Conservative reduction classes of Krom formulas (English)
0 references
1982
0 references
pure quantification theory
0 references
satisfiability
0 references
finite satisfiability
0 references
prenex conjuctive normal form
0 references
unsolvable decision problem
0 references
0 references
