Noncomplex sequences: characterizations and examples

Journal of Symbolic Logic 41 (3):626-638 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

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

General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.
On dividing chains in simple theories.Steffen Lewitzka & Ruy J. G. B. De Queiroz - 2005 - Archive for Mathematical Logic 44 (7):897-911.
Cofinally Invariant Sequences and Revision.Edoardo Rivello - 2015 - Studia Logica 103 (3):599-622.
If it is inevitable, it need not be imitated.Patricia J. Bauer - 1998 - Behavioral and Brain Sciences 21 (5):684-685.
On well-generated Boolean algebras.Robert Bonnet & Matatyahu Rubin - 2000 - Annals of Pure and Applied Logic 105 (1-3):1-50.
Learning without negative examples via variable-valued logic characterizations: the uniclass inductive program AQ7UNI.Robert Stepp - 1979 - Urbana: Dept. of Computer Science, University of Illinois at Urbana-Champaign.
JS Delmedigo as Teacher of Spinoza: The Case of Noncomplex Propositions.Jacob Adler - 2008 - Studia Spinozana: An International and Interdisciplinary Series 16:177-183.
Relative lawlessness in intuitionistic analysis.Joan Rand Moschovakis - 1987 - Journal of Symbolic Logic 52 (1):68-88.
Coherent sequences versus Radin sequences.James Cummings - 1994 - Annals of Pure and Applied Logic 70 (3):223-241.

Analytics

Added to PP
2009-01-28

Downloads
214 (#94,335)

6 months
7 (#433,721)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (13-14):207-224.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references