On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras (Q3170559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of equations valid in algebras of relations. I: Strong non-finitizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epimorphisms in cylindric algebras and definability in finite variable logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary polyadic algebras from cylindric algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cylindric Algebras Satisfying Merry-go-round Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonfinitizability of classes of representable polyadic algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The representation of relation algebras. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonfinitizability of classes of representable cylindric algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability with Finitely Many Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cylindric modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modal Logic for Quantification and Substitution / rank
 
Normal rank

Latest revision as of 11:25, 4 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
scientific article

    Statements

    Identifiers