This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean alge
A Note on the Hyperarithmetical Hierarchy
β Scribed by H. B. Enderton and Hilary Putnam
- Book ID
- 124971893
- Publisher
- Association for Symbolic Logic
- Year
- 1970
- Tongue
- English
- Weight
- 290 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0022-4812
- DOI
- 10.2307/2270699
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The realized (observed) value of Landau's dominance hierarchy index is examined. Under a model of constant pairwise dominance probabilities, the observed index is shown to be a strongly consistent estimator of the underlying (true) index. However, a large number of encounters between animals is show
This note explores the debate between proponents of organizational learning who have criticized hierarchy as an obstacle to learning and those who have defended hierarchy as indispensable for large organizations. By considering hierarchy and team as ideal-typical information systems, it is argued th