Edit Profile (opens in new tab) Lescanne, Pierre Co-Author Distance Author ID: lescanne.pierre Published as: Lescanne, Pierre; Lescanne, P. External Links: MGP · Wikidata · dblp · GND · IdRef · theses.fr Documents Indexed: 66 Publications since 1977, including 1 Book 7 Contributions as Editor Co-Authors: 53 Co-Authors with 48 Joint Publications 698 Co-Co-Authors all top 5 Co-Authors 24 single-authored 7 Ghilezan, Silvia 5 Grygiel, Katarzyna 4 Bendkowski, Maciej 4 Dougherty, Dan 4 Dougherty, Daniel J. 4 Likavec, Silvia 4 Zaionc, Marek 3 Bellegarde, Françoise 3 Ivetić, Jelena 3 van Bakel, Steffen 2 Ben Cherifa, Ahlem 2 David, Rene 2 Grabowski, Jan 2 Jouannaud, Jean-Pierre 2 Kirchner, Hélène 2 Lang, Frédéric 2 Lengrand, Stéphane Jean Eric 2 Liquori, Luigi 2 Rouyer-Degli, Jocelyne 2 Wechler, Wolfgang 1 Benaissa, Zine-el-Abidine 1 Bidoit, Michel 1 Briaud, Daniel 1 Cichon, Adam 1 Comon, Hubert 1 Dauchet, Max 1 Dezani-Ciancaglini, Mariangiola 1 Finance, Jean-Pierre 1 Gardy, Danièle 1 Gnaedig, Isabelle 1 Guyard, Jacques 1 Heuillard, Thierry 1 Hsiang, Jieh 1 Huc, B. 1 Jaray, Jacques 1 Kirchner, Claude 1 Kreowski, Hans-Jörg 1 Kucherov, Gregory 1 Lazrek, Azeddine 1 Maroldt, J. 1 Mosses, Peter D. 1 Pair, Claude 1 Perrinel, Matthieu 1 Quere, A. 1 Reinig, Fernand 1 Remy, Jean-Luc 1 Réty, Pierre 1 Rusinowitch, Michaël 1 Sannella, Donald T. 1 Steyaert, Jean-Marc 1 Thiel, Jean-Jacques 1 Tison, Sophie 1 Žunić, Dragisa all top 5 Serials 4 Theoretical Computer Science 3 Information and Computation 3 MSCS. Mathematical Structures in Computer Science 3 Journal of Functional Programming 3 Lecture Notes in Computer Science 2 RAIRO, Informatique Théorique 2 Journal of Symbolic Computation 2 Bulletin of the European Association for Theoretical Computer Science (EATCS) 2 Applicable Algebra in Engineering, Communication and Computing 1 Acta Informatica 1 Information Processing Letters 1 The Computer Journal. Section A / Section B 1 Publications de l’Institut Mathématique. Nouvelle Série 1 Science of Computer Programming 1 The Journal of Logic Programming 1 Journal of Automated Reasoning 1 Formal Aspects of Computing 1 Journal of Logic and Computation 1 Annals of Mathematics and Artificial Intelligence 1 The Journal of Functional and Logic Programming 1 ACM Transactions on Computational Logic 1 Electronic Notes in Theoretical Computer Science 1 Logical Methods in Computer Science 1 Journal of Formalized Reasoning 1 RAIRO. Theoretical Informatics and Applications 1 Discrete Mathematics & Theoretical Computer Science. Proceedings 1 Mathematical Research all top 5 Fields 61 Computer science (68-XX) 30 Mathematical logic and foundations (03-XX) 6 General and overarching topics; collections (00-XX) 5 Combinatorics (05-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 3 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 General algebraic systems (08-XX) 2 Group theory and generalizations (20-XX) 1 History and biography (01-XX) 1 Number theory (11-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 54 Publications have been cited 422 times in 309 Documents Cited by ▼ Year ▼ Equational problems and disunification. Zbl 0678.68093Comon, Hubert; Lescanne, Pierre 65 1989 Termination of rewriting systems by polynomial interpretations and its implementation. Zbl 0625.68036Ben Cherifa, Ahlem; Lescanne, Pierre 51 1987 Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Zbl 0705.68067Dauchet, Max; Heuillard, Thierry; Lescanne, Pierre; Tison, Sophie 36 1990 \(\lambda\nu\), a calculus of explicit substitutions which preserves strong normalisation. Zbl 0873.68108Benaissa, Zine-El-Abidine; Briaud, Daniel; Lescanne, Pierre; Rouyer-Degli, Jocelyne 28 1996 Termination by completion. Zbl 0723.68056Bellegarde, Françoise; Lescanne, Pierre 17 1990 On multiset orderings. Zbl 0486.68041Jouannaud, Jean-Pierre; Lescanne, Pierre 16 1982 Counting and generating lambda terms. Zbl 1311.68045Grygiel, Katarzyna; Lescanne, Pierre 13 2013 Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness. Zbl 0691.68026Lazrek, Azeddine; Lescanne, Pierre; Thiel, Jean-Jacques 11 1990 Recursive decomposition ordering. Zbl 0513.68026Jouannaud, Jean-Pierre; Lescanne, Pierre; Reinig, Fernand 11 1983 Algebraic system specification and development. A survey and annotated bibliography. Zbl 0875.68642 9 1991 On the recursive decomposition ordering with lexicographical status and other related orderings. Zbl 0698.68031Lescanne, Pierre 9 1990 NARROWER: a new algorithm for unification and its application to logic programming. Zbl 0576.68002Rety, Pierre; Kirchner, Claude; Kirchner, Hélène; Lescanne, Pierre 9 1985 Explicit substitutions with de Bruijn’s levels. Zbl 1503.03028Lescanne, Pierre; Rouyer-Degli, Jocelyne 8 1995 Polynomial interpretations and the complexity of algorithms. Zbl 0925.68266Cichon, Adam; Lescanne, Pierre 8 1992 A natural counting of lambda terms. Zbl 1428.68095Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek 7 2016 Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems. Zbl 0518.68025Lescanne, Pierre 7 1982 Transformation ordering. Zbl 0621.68022Bellegarde, F.; Lescanne, P. 7 1987 Counting and generating terms in the binary lambda calculus. Zbl 1419.68039Grygiel, Katarzyna; Lescanne, Pierre 7 2015 Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage. Zbl 1146.68028Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre 6 2008 Proving termination of associative commutative rewriting systems by rewriting. Zbl 0642.68037Gnaedig, Isabelle; Lescanne, Pierre 6 1986 Intersection types for explicit substitutions. Zbl 1082.68014Lengrand, Stéphane; Lescanne, Pierre; Dougherty, Dan; Dezani-Ciancaglini, Mariangiola; van Bakel, Steffen 6 2004 On counting untyped lambda terms. Zbl 1259.68028Lescanne, Pierre 6 2013 Uniform termination of term rewriting systems. Recursive decomposition ordering with status. Zbl 0546.68020Lescanne, Pierre 5 1984 An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations. Zbl 0642.68038Ben Cherifa, Ahlem; Lescanne, Pierre 5 1986 Combinatorics of \(\lambda\)-terms: a natural approach. Zbl 1444.03017Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek 5 2017 “Backward” coinduction, Nash equilibrium and the rationality of escalation. Zbl 1262.91039Lescanne, Pierre; Perrinel, Matthieu 5 2012 Strong normalization of the dual classical sequent calculus. Zbl 1143.03360Dougherty, Daniel; Ghilezan, Silvia; Lescanne, Pierre; Likavec, Silvia 4 2005 The language \(\mathcal X\): Circuits, computations and classical logic. Zbl 1171.68411van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre 4 2005 Termination of rewrite systems by elementary interpretations. Zbl 0817.68095Lescanne, Pierre 4 1995 Counting terms in the binary lambda calculus. Zbl 1352.68042Grygiel, Katarzyna; Lescanne, Pierre 3 2014 Addressed term rewriting systems: syntax, semantics, and pragmatics (extended abstract). Zbl 1272.68177Dougherty, Dan; Lescanne, Pierre; Liquori, Luigi; Lang, Frédéric 3 2005 Computation with classical sequents. Zbl 1173.03011van Bakel, Steffen; Lescanne, Pierre 3 2008 On termination of one rule rewrite systems. Zbl 0938.68687Lescanne, Pierre 3 1994 Reductions, intersection types, and explicit substitutions. Zbl 0981.68024Dougherty, Dan; Lescanne, Pierre 3 2001 Divergence of the Knuth-Bendix completion procedure and termination orderings. Zbl 1023.68595Lescanne, Pierre 3 1986 The term rewriting approach to automated theorem proving. Zbl 0754.68100Hsiang, Jieh; Kirchner, Hélène; Lescanne, Pierre; Rusinowitch, Michaël 2 1992 Well rewrite orderings and well quasi-orderings. Zbl 0778.68048Lescanne, Pierre 2 1992 Term rewriting systems and algebra. Zbl 0546.68079Lescanne, Pierre 2 1984 Modeles non déterministes de types abstraits. Zbl 0491.68013Lescanne, Pierre 2 1982 On the study data structures: Binary tournaments with repeated keys. Zbl 0516.68020Lescanne, P.; Steyaert, J. M. 2 1983 Medee: A type of language for the deductive programming method. Zbl 0408.68014Bellegarde, F.; Finance, J. P.; Huc, B.; Jaray, J.; Lescanne, P.; Maroldt, J.; Pair, C.; Quere, A.; Remy, J. L. 2 1979 Rewriting techniques and applications. Bordeaux, France, May 25–27, 1987. Proceedings. (2nd International Conference). Zbl 0619.00025 2 1987 Addressed term rewriting systems: application to a typed object calculus. Zbl 1122.68069Dougherty, Daniel J.; Lescanne, Pierre; Liquori, Luigi 2 2006 Reductions, intersection types, and explicit substitutions. Zbl 1029.03006Dougherty, Dan; Lescanne, Pierre 2 2003 Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus. Zbl 1272.03078Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre 2 2005 Well quasi-ordering in a paper by Maurice Janet. Zbl 0712.06001Lescanne, Pierre 1 1989 Algèbres de mots et algèbre universelle. Zbl 0487.08010Lescanne, Pierre 1 1978 Behavioural categoricity of abstract data type specifications. Zbl 0517.68040Lescanne, Pierre 1 1983 Mechanizing common knowledge logic using COQ. Zbl 1122.03007Lescanne, Pierre 1 2006 Intersection types for the resource control lambda calculi. Zbl 1351.03008Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Likavec, Silvia 1 2011 Intuitionistic sequent-style calculus with explicit structural rules. Zbl 1341.03019Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Žunić, Dragisa 1 2011 On the enumeration of closures and environments with an application to random generation. Zbl 1442.68023Bendkowski, Maciej; Lescanne, Pierre 1 2019 Quantitative aspects of linear and affine closed lambda terms. Zbl 1407.03013Lescanne, Pierre 1 2018 Common knowledge logic in a higher order proof assistant. Zbl 1383.68078Lescanne, Pierre 1 2013 On the enumeration of closures and environments with an application to random generation. Zbl 1442.68023Bendkowski, Maciej; Lescanne, Pierre 1 2019 Quantitative aspects of linear and affine closed lambda terms. Zbl 1407.03013Lescanne, Pierre 1 2018 Combinatorics of \(\lambda\)-terms: a natural approach. Zbl 1444.03017Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek 5 2017 A natural counting of lambda terms. Zbl 1428.68095Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek 7 2016 Counting and generating terms in the binary lambda calculus. Zbl 1419.68039Grygiel, Katarzyna; Lescanne, Pierre 7 2015 Counting terms in the binary lambda calculus. Zbl 1352.68042Grygiel, Katarzyna; Lescanne, Pierre 3 2014 Counting and generating lambda terms. Zbl 1311.68045Grygiel, Katarzyna; Lescanne, Pierre 13 2013 On counting untyped lambda terms. Zbl 1259.68028Lescanne, Pierre 6 2013 Common knowledge logic in a higher order proof assistant. Zbl 1383.68078Lescanne, Pierre 1 2013 “Backward” coinduction, Nash equilibrium and the rationality of escalation. Zbl 1262.91039Lescanne, Pierre; Perrinel, Matthieu 5 2012 Intersection types for the resource control lambda calculi. Zbl 1351.03008Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Likavec, Silvia 1 2011 Intuitionistic sequent-style calculus with explicit structural rules. Zbl 1341.03019Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Žunić, Dragisa 1 2011 Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage. Zbl 1146.68028Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre 6 2008 Computation with classical sequents. Zbl 1173.03011van Bakel, Steffen; Lescanne, Pierre 3 2008 Addressed term rewriting systems: application to a typed object calculus. Zbl 1122.68069Dougherty, Daniel J.; Lescanne, Pierre; Liquori, Luigi 2 2006 Mechanizing common knowledge logic using COQ. Zbl 1122.03007Lescanne, Pierre 1 2006 Strong normalization of the dual classical sequent calculus. Zbl 1143.03360Dougherty, Daniel; Ghilezan, Silvia; Lescanne, Pierre; Likavec, Silvia 4 2005 The language \(\mathcal X\): Circuits, computations and classical logic. Zbl 1171.68411van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre 4 2005 Addressed term rewriting systems: syntax, semantics, and pragmatics (extended abstract). Zbl 1272.68177Dougherty, Dan; Lescanne, Pierre; Liquori, Luigi; Lang, Frédéric 3 2005 Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus. Zbl 1272.03078Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre 2 2005 Intersection types for explicit substitutions. Zbl 1082.68014Lengrand, Stéphane; Lescanne, Pierre; Dougherty, Dan; Dezani-Ciancaglini, Mariangiola; van Bakel, Steffen 6 2004 Reductions, intersection types, and explicit substitutions. Zbl 1029.03006Dougherty, Dan; Lescanne, Pierre 2 2003 Reductions, intersection types, and explicit substitutions. Zbl 0981.68024Dougherty, Dan; Lescanne, Pierre 3 2001 \(\lambda\nu\), a calculus of explicit substitutions which preserves strong normalisation. Zbl 0873.68108Benaissa, Zine-El-Abidine; Briaud, Daniel; Lescanne, Pierre; Rouyer-Degli, Jocelyne 28 1996 Explicit substitutions with de Bruijn’s levels. Zbl 1503.03028Lescanne, Pierre; Rouyer-Degli, Jocelyne 8 1995 Termination of rewrite systems by elementary interpretations. Zbl 0817.68095Lescanne, Pierre 4 1995 On termination of one rule rewrite systems. Zbl 0938.68687Lescanne, Pierre 3 1994 Polynomial interpretations and the complexity of algorithms. Zbl 0925.68266Cichon, Adam; Lescanne, Pierre 8 1992 The term rewriting approach to automated theorem proving. Zbl 0754.68100Hsiang, Jieh; Kirchner, Hélène; Lescanne, Pierre; Rusinowitch, Michaël 2 1992 Well rewrite orderings and well quasi-orderings. Zbl 0778.68048Lescanne, Pierre 2 1992 Algebraic system specification and development. A survey and annotated bibliography. Zbl 0875.68642 9 1991 Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Zbl 0705.68067Dauchet, Max; Heuillard, Thierry; Lescanne, Pierre; Tison, Sophie 36 1990 Termination by completion. Zbl 0723.68056Bellegarde, Françoise; Lescanne, Pierre 17 1990 Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness. Zbl 0691.68026Lazrek, Azeddine; Lescanne, Pierre; Thiel, Jean-Jacques 11 1990 On the recursive decomposition ordering with lexicographical status and other related orderings. Zbl 0698.68031Lescanne, Pierre 9 1990 Equational problems and disunification. Zbl 0678.68093Comon, Hubert; Lescanne, Pierre 65 1989 Well quasi-ordering in a paper by Maurice Janet. Zbl 0712.06001Lescanne, Pierre 1 1989 Termination of rewriting systems by polynomial interpretations and its implementation. Zbl 0625.68036Ben Cherifa, Ahlem; Lescanne, Pierre 51 1987 Transformation ordering. Zbl 0621.68022Bellegarde, F.; Lescanne, P. 7 1987 Rewriting techniques and applications. Bordeaux, France, May 25–27, 1987. Proceedings. (2nd International Conference). Zbl 0619.00025 2 1987 Proving termination of associative commutative rewriting systems by rewriting. Zbl 0642.68037Gnaedig, Isabelle; Lescanne, Pierre 6 1986 An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations. Zbl 0642.68038Ben Cherifa, Ahlem; Lescanne, Pierre 5 1986 Divergence of the Knuth-Bendix completion procedure and termination orderings. Zbl 1023.68595Lescanne, Pierre 3 1986 NARROWER: a new algorithm for unification and its application to logic programming. Zbl 0576.68002Rety, Pierre; Kirchner, Claude; Kirchner, Hélène; Lescanne, Pierre 9 1985 Uniform termination of term rewriting systems. Recursive decomposition ordering with status. Zbl 0546.68020Lescanne, Pierre 5 1984 Term rewriting systems and algebra. Zbl 0546.68079Lescanne, Pierre 2 1984 Recursive decomposition ordering. Zbl 0513.68026Jouannaud, Jean-Pierre; Lescanne, Pierre; Reinig, Fernand 11 1983 On the study data structures: Binary tournaments with repeated keys. Zbl 0516.68020Lescanne, P.; Steyaert, J. M. 2 1983 Behavioural categoricity of abstract data type specifications. Zbl 0517.68040Lescanne, Pierre 1 1983 On multiset orderings. Zbl 0486.68041Jouannaud, Jean-Pierre; Lescanne, Pierre 16 1982 Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems. Zbl 0518.68025Lescanne, Pierre 7 1982 Modeles non déterministes de types abstraits. Zbl 0491.68013Lescanne, Pierre 2 1982 Medee: A type of language for the deductive programming method. Zbl 0408.68014Bellegarde, F.; Finance, J. P.; Huc, B.; Jaray, J.; Lescanne, P.; Maroldt, J.; Pair, C.; Quere, A.; Remy, J. L. 2 1979 Algèbres de mots et algèbre universelle. Zbl 0487.08010Lescanne, Pierre 1 1978 all cited Publications top 5 cited Publications all top 5 Cited by 343 Authors 14 Lescanne, Pierre 12 Peltier, Nicolas 12 Zantema, Hans 10 Vágvölgyi, Sándor 9 Dershowitz, Nachum 9 Middeldorp, Aart 8 Fernández, Maribel 8 Kesner, Delia 8 Martin, Ursula 7 Bendkowski, Maciej 7 Meseguer Guaita, José 6 Lucas, Salvador 6 van Bakel, Steffen 5 Ayala-Rincón, Mauricio 5 Horbach, Matthias 5 Pichler, Reinhard 5 Steinbach, Joachim 5 Treinen, Ralf 4 Bodini, Olivier 4 Caferra, Ricardo 4 Ferreira, Maria C. F. 4 Geser, Alfons 4 Ghilezan, Silvia 4 Giesl, Jürgen 4 Gittenberger, Bernhard 4 Jacquemard, Florent 4 Jouannaud, Jean-Pierre 4 Kamareddine, Fairouz D. 4 Kirchner, Hélène 4 Lengrand, Stéphane Jean Eric 4 Nieuwenhuis, Robert 4 Rusinowitch, Michaël 4 Tarau, Paul 3 Baader, Franz 3 Bellegarde, Françoise 3 Comon, Hubert 3 Courcelle, Bruno 3 Dauchet, Max 3 Cavalcanti de Moura, Flávio Leonardo 3 Durand, Irène A. 3 Geuvers, Jan Herman 3 Gnaedig, Isabelle 3 Grygiel, Katarzyna 3 Klop, Jan Willem 3 Marché, Claude 3 Rubio, Albert 3 Sannella, Donald T. 3 Tarlecki, Andrzej 3 Weidenbach, Christoph 3 Winkler, Sarah 2 Aoto, Takahito 2 Asada, Kazuyuki 2 Bachmair, Leo 2 Backofen, Rolf 2 Balland, Emilie 2 Berardi, Stefano 2 Bergstra, Jan A. 2 Bloo, Roel 2 Bockmayr, Alexander 2 Bonfante, Guillaume 2 Bouhoula, Adel 2 Bourely, Christophe 2 Comon-Lundh, Hubert 2 Coquidé, Jean-Luc 2 Défourneaux, Gilles 2 Delaune, Stéphanie 2 de’Liguoro, Ugo 2 Dovgal, Sergey 2 Durán, Francisco 2 Fokkink, Willem Jan 2 Gołȩbiewski, Zbigniew 2 Hedges, Jules 2 Hermann, Miki 2 Hirokawa, Nao 2 Hoot, Charles 2 Ivetić, Jelena 2 Kikuchi, Kentaro 2 Kirchner, Claude 2 Kobayashi, Naoki 2 Lautemann, Clemens 2 Likavec, Silvia 2 Meadows, Catherine A. 2 Moreau, Pierre-Etienne 2 Nadathur, Gopalan 2 Narendran, Paliath 2 Nederpelt, Rob 2 Nishida, Naoki 2 Ohlebusch, Enno 2 Plaisted, David Alan 2 Remy, Jean-Luc 2 Roşu, Grigore 2 Sato, Taisuke 2 Schneider-Kamp, Peter 2 Schulz, Klaus U. 2 Scott, Elizabeth A. 2 Şerbănuţă, Traian Florin 2 Simonsen, Jakob Grue 2 Sin’ya, Ryoma 2 Skeirik, Stephen 2 Snyder, Wayne ...and 243 more Authors all top 5 Cited in 38 Serials 59 Theoretical Computer Science 22 Information and Computation 20 Journal of Symbolic Computation 15 Journal of Automated Reasoning 9 Applicable Algebra in Engineering, Communication and Computing 7 Annals of Pure and Applied Logic 6 Journal of Functional Programming 5 Acta Informatica 5 Information Processing Letters 5 RAIRO, Informatique Théorique 5 MSCS. Mathematical Structures in Computer Science 4 Formal Aspects of Computing 4 Logical Methods in Computer Science 3 The Journal of Logic and Algebraic Programming 3 Theory and Practice of Logic Programming 3 Journal of Logical and Algebraic Methods in Programming 2 Notre Dame Journal of Formal Logic 2 RAIRO. Informatique Théorique et Applications 2 The Electronic Journal of Combinatorics 2 Annals of Mathematics and Artificial Intelligence 2 Higher-Order and Symbolic Computation 2 Journal of Applied Logic 1 Discrete Applied Mathematics 1 Journal of Soviet Mathematics 1 The Journal of Symbolic Logic 1 Algorithmica 1 International Journal of Intelligent Systems 1 Journal of Cryptology 1 International Journal of Foundations of Computer Science 1 Archive for Mathematical Logic 1 Indagationes Mathematicae. New Series 1 Combinatorics, Probability and Computing 1 Journal of Mathematical Sciences (New York) 1 Theory of Computing Systems 1 Annals of Combinatorics 1 RAIRO. Theoretical Informatics and Applications 1 Fundamenta Informaticae 1 Formalized Mathematics all top 5 Cited in 17 Fields 275 Computer science (68-XX) 120 Mathematical logic and foundations (03-XX) 9 Combinatorics (05-XX) 9 General algebraic systems (08-XX) 7 Order, lattices, ordered algebraic structures (06-XX) 5 Category theory; homological algebra (18-XX) 5 Information and communication theory, circuits (94-XX) 4 Group theory and generalizations (20-XX) 4 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 3 History and biography (01-XX) 2 Number theory (11-XX) 2 Commutative algebra (13-XX) 2 Algebraic geometry (14-XX) 2 Probability theory and stochastic processes (60-XX) 1 Field theory and polynomials (12-XX) 1 Statistics (62-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.