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
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Manuel Lerman / rank
Normal rank
 
Property / author
 
Property / author: Manuel Lerman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2275790 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092944937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4921532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of the recursively enumerable weak truth-table degrees is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak truth table degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal pairs and complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublattices of the polynomial time degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cupping and noncapping in the r.e. weak truth table and turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:16, 24 May 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
    0 references
    0 references
    0 references
    0 references
    0 references
    3 June 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references