Expressive power and succinctness of the positive calculus of binary relations (Q2141281): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Expressive Power and Succinctness of the Positive Calculus of Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Relation Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of relations as a foundation for mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of FO3 and the calculus of relations with just one binary relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equational theory of union-free algebras of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> ! lower bound on formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: The succinctness of first-order logic on linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the succinctness of some modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formula size games for modal logic and μ-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allegories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of existential positive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cylindric algebras. Part II / rank
 
Normal rank

Revision as of 01:46, 29 July 2024

scientific article
Language Label Description Also known as
English
Expressive power and succinctness of the positive calculus of binary relations
scientific article

    Statements

    Expressive power and succinctness of the positive calculus of binary relations (English)
    0 references
    0 references
    25 May 2022
    0 references
    expressive power
    0 references
    succinctness
    0 references
    the positive calculus of relations
    0 references
    existential positive logic
    0 references

    Identifiers