Ambiguous classes in μ -calculi hierarchies

A classical result by Rabin states that if a set of trees and its complement are both Büchi definable in the monadic second order logic, then these sets are weakly definable. In the language of μ -calculi, this theorem asserts the equality between the complexity classes Σ 2 ∩ Π 2 and Comp ( Σ 1 , Π...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 333; no. 1; pp. 265 - 296
Main Authors:	Santocanale, Luigi, Arnold, André
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Amsterdam Elsevier B.V 01.03.2005 Elsevier
Series:	Foundations of Software Science and Computation Structures
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Distributed, Parallel, and Cluster Computing Exact sciences and technology General logic Graph theory Logic and foundations Mathematical logic, foundations, set theory Mathematics Sciences and techniques of general use Theoretical computing Complexity class Hierarchy Second order logic Fix point Separation Computer theory Propositional calculus Mu calculus Parity Tree automaton Monadic logic Depth
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!