Publisher： Cambridge University Press
E-ISSN： 1943-5886|75|4|1489-1498
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.75, Iss.4, 2010-12, pp. : 1489-1498
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
An Asymptotic Ratio in the Complete Binary Tree
By Kubicki Grzegorz Lehel Jenő Morayne Michał
Order, Vol. 20, Iss. 2, 2003-01 ,pp. :
Access to resources
Recommend
An axiomatization of full Computation Tree Logic
The Journal of Symbolic Logic, Vol. 66, Iss. 3, 2001-09 ,pp. :
A model in which the base-matrix tree cannot have cofinal branches
The Journal of Symbolic Logic, Vol. 52, Iss. 3, 1987-09 ,pp. :
Chain recurrent points of a tree map
Bulletin of the Australian Mathematical Society, Vol. 59, Iss. 2, 1999-04 ,pp. :
Pointwise chain recurrent maps of the tree
Bulletin of the Australian Mathematical Society, Vol. 69, Iss. 1, 2004-02 ,pp. :