Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (Q391322): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the structure of hoops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite embeddability property for residuated lattices, pocrims and BCK-algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite embeddability property for residuated ordered groupoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Uniform Word Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word and generator problems for lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddability and the word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Word Problem for Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddability and the Word Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for some classes of sentences without quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On closed elements in closure algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank

Latest revision as of 04:47, 7 July 2024

scientific article
Language Label Description Also known as
English
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
scientific article

    Statements

    Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (English)
    0 references
    10 January 2014
    0 references
    partial algebra
    0 references
    partial structure
    0 references
    distributive lattice
    0 references
    Boolean algebra
    0 references
    Heyting algebra
    0 references
    complexity of satisfiability
    0 references
    universal theory
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references