Guarded fixed point logics and the monadic theory of countable trees

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.288, Iss.1, 2002-10, pp. : 129-152

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Monadic partition logics and finite automata

By Enshao S. Qijia T.

Theoretical Computer Science, Vol. 166, Iss. 1, 1996-10 ,pp. : 63-81

Elsevier

Access to resources Recommend Favorite

On infinite transition graphs having a decidable monadic theory

By Caucal D.

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 79-115

Elsevier

Access to resources Recommend Favorite

Formalization of Fixed-Point Arithmetic in HOL

By Akbarpour Behzad Tahar Sofiène Dekdouk Abdelkader

Formal Methods in System Design, Vol. 27, Iss. 1-2, 2005-09 ,pp. : 173-200

Springer Publishing Company

Access to resources Recommend Favorite

On the greatest fixed point of a set functor

By Adamek J. Koubek V.

Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. : 57-75

Elsevier

Access to resources Recommend Favorite

On Gabbay's temporal fixed point operator

By Hodkinson I.

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 1-25

Elsevier

Access to resources Recommend Favorite