Finding paths through narrow and wide trees

Publisher： Cambridge University Press

E-ISSN： 1943-5886|74|1|349-360

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.74, Iss.1, 2009-03, pp. : 349-360

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

Π1 1 relations and paths through

By  

The Journal of Symbolic Logic, Vol. 69, Iss. 2, 2004-06 ,pp. : 585-611

Cambridge University Press

Access to resources Recommend Favorite

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D

By Agarwal Pankaj   Klein Rolf   Knauer Christian   Langerman Stefan   Morin Pat   Sharir Micha   Soss Michael  

Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. : 17-37

Springer Publishing Company

Access to resources Recommend Favorite

Trees

By  

The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. : 1-14

Cambridge University Press

Access to resources Recommend Favorite

Which number theoretic problems can be solved in recursive progressions on Π1 1-paths through O?

By  

The Journal of Symbolic Logic, Vol. 37, Iss. 2, 1972-06 ,pp. : 311-334

Cambridge University Press

Access to resources Recommend Favorite

Finding pseudoprimes

By  

The Mathematical Gazette, Vol. 95, Iss. 534, 2011-11 ,pp. : 420-432

Cambridge University Press

Access to resources Recommend Favorite