Adrian Carpentier M.. Creative sequences and double sequences. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 35–61 [Book Review]

Journal of Symbolic Logic 35 (4):590-590 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271484

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Creative sequences and double sequences.M. Adrian Carpentier - 1968 - Notre Dame Journal of Formal Logic 9 (1):35-61.
Review: M. Adrian Carpentier, Creative Sequences and Double Sequences. [REVIEW]J. P. Cleave - 1970 - Journal of Symbolic Logic 35 (4):590-590.
Complete enumerations and double sequences.M. Adrian Carpentier - 1969 - Mathematical Logic Quarterly 15 (1‐3):1-6.
An Undecidable Property of Recurrent Double Sequences.Mihai Prunescu - 2008 - Notre Dame Journal of Formal Logic 49 (2):143-151.
Complete enumerations and double sequences.M. Adrian Carpentier - 1969 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (1-3):1-6.
Formation sequences for propositional formulas.Martin M. Zuckerman - 1973 - Notre Dame Journal of Formal Logic 14 (1):134-138.
Note of the use of sequences in Logics and languages (Methuen, London, 1973).Max J. Cresswell - 1975 - Notre Dame Journal of Formal Logic 16 (3):445-448.
Itay Neeman. Forcing with sequences of models of two types. Notre Dame Journal of Formal Logic, vol. 55 , pp. 265–298. [REVIEW]Dima Sinapova - 2015 - Bulletin of Symbolic Logic 21 (3):339-341.
Uncompactness of Stit Logics Containing Generalized Refref Conditionals.Ming Xu - 1998 - Notre Dame Journal of Formal Logic 39 (4):485-506.
Double sequences, almost Cauchyness and BD-N.Josef Berger, Douglas Bridges & Erik Palmgren - 2012 - Logic Journal of the IGPL 20 (1):349-354.
Review: V. D. Vuckovic, Creative and Weakly Creative Sequences of R.E. Sets. [REVIEW]J. P. Cleave - 1969 - Journal of Symbolic Logic 34 (2):296-296.
Program Size Complexity for Possibly Infinite Computations.Verónica Becher, Santiago Figueira, André Nies & Silvana Picchi - 2005 - Notre Dame Journal of Formal Logic 46 (1):51-64.
Book Review: Mark van Atten. On Brouwer. [REVIEW]O. Bradley Bassler - 2006 - Notre Dame Journal of Formal Logic 47 (4):581-599.
V. D. Vuckovic. Creative and weakly creative sequences of r.e. sets. Proceedings of the American Mathematical Society, vol. 18 (1967), pp. 478–483. [REVIEW]J. P. Cleave - 1969 - Journal of Symbolic Logic 34 (2):296-296.
General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.

Analytics

Added to PP
2016-06-30

Downloads
13 (#1,013,785)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references