A focus system for the alternation-free \(\mu \)-calculus (Q2142090): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5144634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal<i>μ</i>-calculus hierarchy over restricted classes of transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming with Focusing Proofs in Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudiments of \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of the Weak / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof System for the Linear Time μ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logics in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Tree Automata and Logics of Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the modal μ-calculus and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tableau System for the Modal μ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata, the weak monadic theory of trees and its complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games for the \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the proof theory of the modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus / rank
 
Normal rank

Latest revision as of 02:24, 29 July 2024

scientific article
Language Label Description Also known as
English
A focus system for the alternation-free \(\mu \)-calculus
scientific article

    Statements

    A focus system for the alternation-free \(\mu \)-calculus (English)
    0 references
    0 references
    0 references
    25 May 2022
    0 references
    alternation-free mu-calculus
    0 references
    infinitary proof system
    0 references
    circular proof system
    0 references
    soundness
    0 references
    completeness
    0 references

    Identifiers