The decision problem for formulas in prenex conjunctive normal form with binary disjunctions (Q5607225): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A property of sentences that define quasi-order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universality of Tag Systems with <i>P</i> = 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tag systems and lag systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Decision Problem for Segregated Formulas in First-Order Logic. / 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: Introduction to model theory and to the metamathematics of algebra / rank | |||
Normal rank |
Latest revision as of 02:31, 12 June 2024
scientific article; zbMATH DE number 3329003
Language | Label | Description | Also known as |
---|---|---|---|
English | The decision problem for formulas in prenex conjunctive normal form with binary disjunctions |
scientific article; zbMATH DE number 3329003 |
Statements
The decision problem for formulas in prenex conjunctive normal form with binary disjunctions (English)
0 references
1970
0 references
0 references