Growing Commas. A Study of Sequentiality and Concatenation
Visser, Albert
Notre Dame J. Formal Logic, Tome 50 (2009) no. 1, p. 61-85 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
In his paper "Undecidability without arithmetization," Andrzej Grzegorczyk introduces a theory of concatenation $\mathsf{TC}$ . We show that pairing is not definable in $\mathsf{TC}$ . We determine a reasonable extension of $\mathsf{TC}$ that is sequential, that is, has a good sequence coding.
Publié le : 2009-01-15
Classification:  concatenation,  strings,  sequentiality,  03B25,  03F25 
@article{1232375163,
     author = {Visser, Albert},
     title = {Growing Commas. A Study of Sequentiality and Concatenation},
     journal = {Notre Dame J. Formal Logic},
     volume = {50},
     number = {1},
     year = {2009},
     pages = { 61-85},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1232375163}
}

Visser, Albert. Growing Commas. A Study of Sequentiality and Concatenation. Notre Dame J. Formal Logic, Tome 50 (2009) no. 1, pp.  61-85. http://gdmltest.u-ga.fr/item/1232375163/