Sandra Quickert

According to our database, Sandra Quickert authored at least 5 papers between 2001 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2017

Σ^μ₂ is decidable for Π^μ₂.

Karoliina Lehtinen, Sandra Quickert

CoRR, 2017

∑^μ₂ is decidable for ∏^μ₂.

Karoliina Lehtinen, Sandra Quickert

Proceedings of the Unveiling Dynamics and Complexity, 2017

2015

Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction.

Karoliina Lehtinen, Sandra Quickert

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2005

Transfinite Extension of the Mu-Calculus.

Julian C. Bradfield, Jacques Duparc, Sandra Quickert

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2001

On Sacks forcing and the Sacks property.

Stefan Geschke, Sandra Quickert

Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001