Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 3 of 3

Order by Relevance | Title | Year of publication

On independence-friendly fixpoint logics

J. C. Bradfield — 2004

Philosophia Scientiae

We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi.

Fixpoint alternation : arithmetic, transition systems, and the binary tree

J. C. Bradfield — 1999

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Fixpoint alternation: arithmetic, transition systems, and the binary tree

J. C. Bradfield — 2010

RAIRO - Theoretical Informatics and Applications

We provide an elementary proof of the fixpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mu-calculus alternation hierarchy. We further show that the alternation hierarchy on the binary tree is strict, resolving a problem of Niwiński.

Page 1

Download Results (CSV)