Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata

Mathematical Logic Quarterly 26 (1‐6):41-49 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Cellularity of Pseudo-Tree Algebras.Jennifer Brown - 2006 - Notre Dame Journal of Formal Logic 47 (3):353-359.
Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.
Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
A hierarchy of tree-automatic structures.Olivier Finkel & Stevo Todorčević - 2012 - Journal of Symbolic Logic 77 (1):350-368.
Reals n-Generic Relative to Some Perfect Tree.Bernard A. Anderson - 2008 - Journal of Symbolic Logic 73 (2):401 - 411.
An $mathbb{S}_{max}$ Variation for One Souslin Tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81-98.
The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
Basic Properties of Quantum Automata.Stanley Gudder - 2000 - Foundations of Physics 30 (2):301-319.
Building iteration trees.Alessandro Andretta - 1991 - Journal of Symbolic Logic 56 (4):1369-1384.

Analytics

Added to PP
2013-11-24

Downloads
9 (#1,236,107)

6 months
3 (#987,746)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references