Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1049746 |
Changed an Item |
||
Property / author | |||
Property / author: Manuel Lerman / rank | |||
Normal rank |
Revision as of 10:43, 22 February 2024
scientific article; zbMATH DE number 957324
Language | Label | Description | Also known as |
---|---|---|---|
English | Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices |
scientific article; zbMATH DE number 957324 |
Statements
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (English)
0 references
3 June 1997
0 references
\(\forall \exists\)-theory of the weak truth-table degrees
0 references
recursively enumerable degree
0 references
recursive polynomial many-one degree
0 references
decidable fragment
0 references
decision procedure
0 references
finite lattices
0 references
distributive upper semi-lattice
0 references