Articles

• Revue internationale avec comité de lecture

  • Patrick Cégielski, La théorie élémentaire de la multiplication, C.R. Acad. Sc. Paris, t.290 (2 juin 1980), pp. 935-938 [See Chapter in a book, reference 1, for the complete version.]
  • Patrick Cégielski, La théorie élémentaire de la multiplication est conséquence d'un nombre fini d'axiomes de ISigmaZéro, C.R. Acad. Sc. Paris, t.293 (26 octobre 1981), Série I, pp.351-352.
  • Patrick Cégielski, La théorie élémentaire de la divisibilité est finiment axiomatisable, C.R. Acad. Sc. Paris, t.299, Série I, 1984, pp.367-369 [Présentation abrégée de l'article suivant.]
  • Patrick Cégielski, The Elementary Theory of the Natural Lattice is Finitely Axiomatizable, Notre Dame Journal of Formal Logic, vol.30, 1989, pp.138-150.
  • Patrick Cégielski, La théorie des corps réels-clos inductifs est une extension conservative de l'arithmétique de Peano , C.R. Acad. Sc. Paris, t.310, Série I, p.239-242, 1990.
  • Patrick Cégielski, La théorie des corps inductifs archimédiens rationnellement complets, C.R. Acad. Sc. Paris, t.311, Série I, p.847-850, 1990.
  • Patrick Cégielski and Denis Richard, Indécidabilité de la théorie des entiers naturels munis d'une énumération des premiers et de la divisibilité, C.R. Acad. Sc. Paris, t. 315, Série I, p. 1431-1434, 1992.
  • Patrick Cégielski, Definability, decidability and complexity, Mathematics and Computer Science, Annals of Mathematics on Artificial Intelligence, vol. 111, april 1996, pp.311-341. Preliminary version
  • Patrick Cégielski, Yuri Matiyasevich, and Denis Richard, Definability and decidability issues in extensions of the integers with the divisibility predicate, The Journal of Symbolic Logic, vol.61, June 1996, pp.515-540. https://doi.org/10.2307/2275673
  • Patrick Cégielski, Leszek Pacholski, Denis Richard, Jerzy Tomasik, and Alex Wilkie, Preface, Logic Colloquium '94 21-30 July 1994 - Clermont-Ferrand, France, Annals of Pure and Applied Logic,vol. 89, 1997, p. 1.
  • Patrick Cégielski and Denis Richard, On arithmetical first-order theories allowing encoding and decoding of lists, Theoretical Computer Science, vol. 222, pp. 55-75, 1999.
  • Patrick Cégielski, Serge Grigorieff et Denis Richard, La théorie élémentaire de la fonction de couplage de Cantor des entiers naturels est décidable, Comptes rendus de l'Académie des Sciences de Paris, t. 331 , Série I, pp. 107-110, 2000.
  • Patrick Cégielski and Denis Richard, Decidability of natural integers equipped with Cantor pairing function and successor, Theoretical Computer Science, vol. 257, issue 1-2, pp. 51-77, 2001.
  • Patrick Cégielski and Denis Richard, What are Weak Arithmetics?, Theoretical Computer Science, vol. 257, pp. 17-29, 2001. Preliminary version
  • Luc Boasson, Patrick Cégielski, Irène Guessarian, and Yuri Matiyasevich, Window-Accumulated Subsequence matching Problem is linear, Annals of Pure and Applied Logic, vol. 113, 2002, p. 59-80. Preliminary version
  • Patrick Cégielski, François Heroult, and Denis Richard, On the amplitude of intervals of natural numbers whose every element is coprime with no extremety, Theoretical Computer Science, vol. 303, pp. 53-62, 2003. DOI 10.1016/S0304-3975(02)00444-9
  • Patrick Cégielski, Decidability and p-destinies, Zapiski Nauchnyh Seminarov POMI, vol. 304, 2003, pp. 121-127.
  • Patrick Cégielski and Malika More, Foreword - Weak Arithmetics, Theoretical Computer Science - B, vol. 322, Number 1, 2004, pp. 1-3.
  • Ruy de Queiroz and Patrick Cégielski, Preface, Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 04), Electronic Notes on Theoretical Computer Science, vol. 123, 1st March 2005, 240 p.
  • Patrick Cégielski, Decidability and p-destinies, Journal of Mathematical Sciences, Springer, volume 130, october 2005, pp. 4620-4623. Premiminary version
  • Patrick Cégielski, Irène Guessarian, and Yuri Matiyasevich, Multiple serial episodes matching, Information Processing Letters, vol. 98, issue 6, 2006, pp. 211-218. Preliminary version
  • Patrick Cégielski and Ruy de Queiroz, Foreword WoLLIC'04, Theoretical Computer Science - B, vol. 364, issue 2, 2006, pp. 143-270.
  • Patrick Cégielski, Denis Richard, and Maxim Vsemirnov, On the additive theory of prime numbers, Fundamenta Informaticae, vol. 81, 2007, pp. 83-96. Preliminary version
  • Patrick Cégielski, Denis Richard, and Maxim Vsemirnov, On the additive theory of prime numbers, version for The Journal of Symbolic Logic lost by editors
  • Patrick Cégielski, Irène Guessarian, and Yuri Matiyasevich, Tree inclusion problems, RAIRO-Theor. inf. Appl., vol. 42, 2008, pp. 5-20
  • Alexis Bès and Patrick Cégielski, Weakly maximal decidable structures, RAIRO-Theor. inf. Appl., vol. 42, 2008, pp. 137-145. Preliminary version
  • Alexis Bès and Patrick Cégielski, Non decidable maximal structures, Journal of Mathematical Sciences, vol. 158, 2009, pp. 615-622. Preliminary version
  • Irène Guessarian and Patrick Cégielski, Tree inclusions in windows and slices, Journal of Mathematical Sciences, vol. 158, 2009, pp. 623-632. Preliminary version
  • Patrick Cégielski and Arnaud Durand, Editor's Preface, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, ISBN 978-3-939897-42-2, LIPICS Vol. 16, 2012.
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, On Lattices of Regular Sets of Natural Integers Closed Under Decrementation, Information Processing Letters, vol. 114, April 2014, pp. 197-202. Prelimary version
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Newton representation of functions over natural intergers having integral difference ratios, International Journal of Number Theory, Volume 11 No 7, 2015, pp. 2109-2139. Preliminary version
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Characterizing congruence preserving functions Z/nZ --> Z/nZ via rational polynomials, Integers, 2016, Vol.16, paper A50.
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Congruence preserving functions on free monoids, Algebra Universalis, Birkhäuser, vol. 78, Issue 3, November 2017, pp. 389-406. Published online 20 october 2017. DOI 10.1007/s00012-017-0464-x
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Congruence Preservation, Lattices and Recognizability, to appear in Journal of Mathematical Sciences. Preliminary version
  • André Arnold, Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Affine completeness of the algebra of full binary trees, Algebra universalis, vol. 81, 2020. doi. Preliminary version
  • André Arnold, Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, The algebra of binary trees is affine complete, Discrete Mathematics and Theoretical Computer Science DMTCS, vol. 23, n^o 2, 2021.
  • André Arnold, Patrick Cégielski, and Irène Guessarian, Affine completeness of some free binary algebras, Fundamenta Informaticae, 2022.

• Communications internationales avec comité de lecture parues dans un livre (Springer, North Holland, ACM Press, IOS Press, CSLI Publications)

  • Patrick Cegielski, La théorie élémentaire de la multiplication, in Model Theory and Arithmetic, Lecture Notes in Mathematics, vol. 890, Springer, 1981, pp.44-89. Preliminary version
  • Patrick Cegielski, Kenneth McAloon, and George Wilmers, Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels, Logic colloquium 80, D. van Dalen ed., North-Holland, 1982, pp.57-68. Preliminary version
  • Luc Boasson, Patrick Cegielski, Irène Guessarian, and Yuri Matiyasevich, Window-Accumulated Subsequence matching Problem is linear, PODS'99 (Principle Of Databases Systems), ACM Press, 1999, pp. 327-336. Preliminary version
  • Patrick Cégielski, Irène Guessarian, Yuri Lifshits, and Yuri Matiyasevich, Window Subsequence Problem for Compressed Texts, Lecture Note in Computer Science 3967, Computer Science: Theory and Applications, Springer, 2006, XVI + 684 p., pp. 127-136.Preliminary version
  • Patrick Cégielski, Denis Richard, and Maxim Vsemirnov, On the additive theory of prime numbers II, Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science, In Recognition of Professor Andrzej Grzegorczyk, S. Krajeavski, W. Marek, G. Markowska, A. Salwicki, J. Wolenski, eds, IOS Press, 2007, viii + 349 p., pp. 83-96. Part of the choice on Google Books. and Premiminary version
  • Patrick Cégielski, Introduction to weak arithmetics, Studies in Weak Arithmetics, Lecture Notes 196, CSLI Publications, Stanford, 2010, vii + 213 p., pp. 1-12.
  • Patrick Cégielski and Irène Guessarian, Normalization of Some Extended Abstract State Machines, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion to His 70th Birthday, Lecture Notes in Computer Science 6300, Springer, 2010, pp. 100-116 Preliminary version
  • Patrick Cégielski and Denis Richard, In memoriam of Alan Robert Woods, in Patrick Cégielski, Charalampos Cornaros, and Costas Dimitracopoulos, New Studies in Weak Arithmetics, Lecture Notes 211, CSLI Publications, Stanford, 2013, xiv + 448 p., pp. 15-31. Preliminary version
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Integral Difference Ratio Functions on Integers, Lecture Notes in Computer Science 8808, Springer, 2014, pp. 277-291. Complete proof version and Survey version including results on regular sets
  • Patrick Cégielski, Serge Grigorieff, and Irène Guessarian, Arithmetical Congruence Preservation: From Finite to Infinite, Lecture Notes in Computer Science 9300, Springer, 2015, pp. 210-225. Preliminary version
  • Patrick Cégielski and Julien Cervelle, Study of Stepwise Simulation Between ASM, Computing with Foresight and Industry 15th Conference on Computability in Europe, CiE 2019 Durham, UK, July 15-19, 2019, Lecture Notes in Computer Science 11558, Springer, 2019, pp. 156-167. DOI Preliminary version

• Communications internationales avec comité de lecture parues dans un livre (other publishers)

  • Patrick Cegielski, Denis Richard, and Maxim Vsemirnov, On the additive theory of prime numbers I, CSIT'2003 (Computer Science and Information Technologies, September 22-26, 2003, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers, 459 p., pp. 90-99. Other version
  • Patrick Cégielski, Irène Guessarian, and Yuri Matiyasevich, Multiple serial episodes matching, CSIT'2005 (Computer Science and Information Technologies, September 19-23, 2005, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers, 633 p., pp. 26-38.
  • Patrick Cégielski, Denis Richard, and Maxim Vsemirnov, On the additive theory of prime numbers II, CSIT'2005 (Computer Science and Information Technologies, September 19-23, 2003, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers, 633 p., pp. 39-47.
  • Patrick Cegielski and Irène Guessarian, Tree inclusions in windows and slices, CSIT'2007 (Computer Science and Information Technologies, September 24-28, 2007, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers, ISBN 978-99941-2-086-4, 332 p., pp. 43-47. Preliminary version
  • Patrick Cégielski and Irène Guessarian, Normalization of Extended Abstract State Machines, CSIT'09 (Computer Science and Information Technologies, September 28-October 2, 2009, Yerevan, Armenia), The National Academy of Sciences of Armenia Publishers, ISBN 978-5-8080-0797-0, pp. 23-26. Preliminary version

• Communications nationales avec comité de lecture parues dans un livre

  • Patrick Cegielski, Historique de la théorie élémentaire des ensembles, Fragments d'histoire des mathématiques II, brochure A.P.M.E.P. 65, 1987, pp.161-210. Sommaire
  • Patrick Cegielski, Un fondement des Mathématiques, in Michel Serfati éd., La recherche de la vérité, ACL-éditions, 1999, pp. 175-209.
  • Patrick Cegielski, Comment vérifier l'accès à une page Web, CNR'IUT 2000, Presses Universitaires d'Orléans, ISBN 2.913454-06-2, tome 1, 2000, pp.249-256.
  • Patrick Cegielski, François Heroult, et Denis Richard, Théorie des nombres et informatique, CNR'IUT 2001, Presses Universitaires de Saint-Étienne, 2001, 479 + 530 p., pp. 97-104.

• Revue nationale avec comité de lecture

  • Patrick Cegielski, C'est é-lé-mentaire, Colloque National sur les Recherches en IUT, numéro spécial de la revue Quadrature, nº 24, avril 1996, Argenteuil, Éditions du choix, ISSN 1142-2785, pp.13-17.
  • Patrick Cegielski et Denis Richard, Décidabilité et indécidabilité de la théorie élémentaire des entiers naturels munis de la fonction de couplage de Cantor et d'une autre fonction, Actes des JAF'15, Université de Mons-Hainaut (Belgique), 11-12 décembre 1997, prépublication de l'université de Mons, 114 p., p.29-64.
  • Patrick Cégielski, Il faut revenir aux sources, L'Informatique Professionnelle, ISSN 0750-1080, pp.11-15, décembre 2004. Version préparatoire

• Éditeur invité d'une revue internationale avec comité de lecture

  • Patrick Cégielski, Leszek Pacholski, Denis Richard, Jerzy Tomasik, and Alex Wilkie, Logic Colloquium '94 21-30 July 1994 - Clermont-Ferrand, France, Annals of Pure and Applied Logic, Volume 89, Issue 1, Pages 1-99 (15 December 1997)
  • Patrick Cegielski and Malika More, Foreword - Weak Arithmetics, Theoretical Computer Science - B, vol. 322, pp.1-3, 2004.
  • Ruy de Queiroz and Patrick Cégielski, Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 04), Electronic Notes on Theoretical Computer Science, vol. 123, 1st March 2005, 240 p.
  • Patrick Cégielski and Ruy de Queiroz, Foreword WoLLIC'04, Theoretical Computer Science - B, vol. 364, issue 2, 2006, pp. 143-270. [Choix d'articles du congrès revus et étendus en revue papier.]
  • Patrick Cégielski and Arnaud Durand, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, ISBN 978-3-939897-42-2, LIPICS Vol. 16, 2012.

• Articles en ligne

  • Patrick Cegielski, Quelques notes sur Denis Richard, et ma collaboration avec lui, 17 mai 2002 : html et pdf.
  • Collectif Algocit, De l'algorithme administratif à l'algorithme public, Le Monde - Idées, 12 décembre 2016.

  Dernière mise à jour : 27 septembre 2022

  Patrick Cégielski