Edit Profile (opens in new tab) Leivant, Daniel M. Co-Author Distance Author ID: leivant.daniel-m Published as: Leivant, Daniel; Leivant, Daniel M. Documents Indexed: 63 Publications since 1971, including 2 Books and 1 Additional arXiv Preprint 7 Contributions as Editor Co-Authors: 12 Co-Authors with 18 Joint Publications 221 Co-Co-Authors all top 5 Co-Authors 52 single-authored 5 Marion, Jean-Yves 4 Ramyaa, Ramyaa 3 De Queiroz, Ruy José Guerra Barretto 2 Dawar, Anuj 2 de Paiva, Valeria 1 Danner, Norman 1 de Oliveira, Anjolina Grisi 1 Fernando, Tim 1 Fortune, Steven 1 Moss, Larry 1 O’Donnell, Michael J. 1 Queiroz, Ruy J. G. B. all top 5 Serials 5 The Journal of Symbolic Logic 5 Information and Computation 4 Theoretical Computer Science 3 Lecture Notes in Computer Science 2 Journal of the Association for Computing Machinery 2 Annals of Pure and Applied Logic 2 MSCS. Mathematical Structures in Computer Science 2 Logic Journal of the IGPL 2 Logical Methods in Computer Science 1 Annales Scientifiques de l’Université de Clermont-Ferrand II. Mathématiques 1 Journal of Computer and System Sciences 1 Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 1 Annales Societatis Mathematicae Polonae. Series IV 1 Journal of Logic and Computation 1 Archive for Mathematical Logic 1 Fundamenta Informaticae Fields 62 Mathematical logic and foundations (03-XX) 46 Computer science (68-XX) 7 General and overarching topics; collections (00-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 47 Publications have been cited 363 times in 261 Documents Cited by ▼ Year ▼ Ramified recurrence and computational complexity. I: Word recurrence and poly-time. Zbl 0844.03024 Leivant, Daniel 47 1995 The expressiveness of simple and second-order type structures. Zbl 0519.68046 Fortune, Steven; Leivant, Daniel; O’Donnell, Michael 38 1983 Ramified recurrence and computational complexity. II: Substitution and poly-space. Zbl 1044.03526 Leivant, Daniel; Marion, Jean-Yves 30 1995 Lambda calculus characterizations of poly-time. Zbl 0781.68059 Leivant, Daniel; Marion, Jean-Yves 19 1993 Descriptive characterizations of computational complexity. Zbl 0677.68045 Leivant, Daniel 16 1989 On the proof theory of the modal logic for arithmetic provability. Zbl 0464.03019 Leivant, Daniel 16 1981 The optimality of induction as an axiomatization of arithmetic. Zbl 0515.03018 Leivant, Daniel 15 1983 A foundational delineation of poly-time. Zbl 0799.03042 Leivant, Daniel 15 1994 Proof theoretic methodology for propositional dynamic logic. Zbl 0467.03015 Leivant, Daniel 14 1981 Subrecursion and lambda representation over free algebras. Preliminary summary. Zbl 0772.03020 Leivant, Daniel 14 1990 Syntactic translations and provably recursive functions. Zbl 0593.03038 Leivant, Daniel 13 1985 Finitely stratified polymorphism. Zbl 0799.68041 Leivant, Daniel 13 1991 Typing and computational properties of lambda expressions. Zbl 0613.68020 Leivant, Daniel 12 1986 Lambda calculus characterizations of poly-time. Zbl 0788.68051 Leivant, Daniel; Marion, Jean-Yves 9 1993 Predicative recurrence in finite types. Zbl 0947.03065 Leivant, Daniel 8 1994 Inductive definitions over finite structures. Zbl 0718.03034 Leivant, Daniel 7 1990 Assumption classes in natural deduction. Zbl 0408.03043 Leivant, Daniel 7 1979 Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity. Zbl 0924.03071 Leivant, Daniel 5 1999 Intrinsic reasoning about functional programs. I: First order theories. Zbl 0992.03037 Leivant, Daniel 5 2002 Existential instantiation in a system of natural deduction for intuitionistic arithmetics. Zbl 0261.02015 Leivant, Daniel 5 1973 Implicational complexity in intuitionistic arithmetic. Zbl 0488.03032 Leivant, Daniel 4 1981 Ramified corecurrence and logspace. Zbl 1342.68139 Ramyaa, Ramyaa; Leivant, Daniel 4 2011 Implicit computational complexity for higher type functionals (extended abstract). Zbl 1020.03511 Leivant, Daniel 4 2002 Evolving graph-structures and their implicit computational complexity. Zbl 1334.68048 Leivant, Daniel; Marion, Jean-Yves 4 2013 Propositional dynamic logic with program quantifiers. Zbl 1286.03119 Leivant, Daniel 4 2008 Unprovability of theorems of complexity theory in weak number theories. Zbl 0482.03025 Leivant, Daniel 3 1982 Logic and computational complexity. International workshop, LCC ’94, Indianapolis, IN, USA, October 13–16, 1994. Selected Papers. Zbl 0847.00025 3 1995 Functions over free algebras definable in the simply typed lambda calculus. Zbl 0792.03006 Leivant, Daniel 3 1993 Computationally based set existence principles. Zbl 0693.03037 Leivant, Daniel 2 1990 Applicative control and computational complexity. Zbl 0944.68070 Leivant, Daniel 2 1999 Termination proofs and complexity certification. Zbl 1087.68545 Leivant, Daniel 2 2001 Strong normalization for arithmetic. (Variations on a theme of Prawitz.). Zbl 0322.02030 Leivant, Daniel 2 1975 Stratified polymorphism. Zbl 0716.68019 Leivant, Daniel 2 1989 Semantic characterizations of number theories. Zbl 0752.03019 Leivant, Daniel 2 1992 Feasible functions over co-inductive data. Zbl 1305.68088 Ramyaa, Ramyaa; Leivant, Daniel 2 2010 Partial correctness assertions provable in dynamic logics. Zbl 1126.03314 Leivant, Daniel 1 2004 Reasoning in dynamic logic about program termination. Zbl 1133.03334 Leivant, Daniel 1 2008 Stratified polymorphism and primitive recursion. Zbl 0935.03024 Danner, Norman; Leivant, Daniel 1 1999 Partial-correctness theories as first-order theories. Zbl 0565.68009 Leivant, Daniel 1 1985 Failure of completeness properties of intuitionistic predicate logic for constructive models. Zbl 0362.02014 Leivant, Daniel 1 1976 On the completeness of dynamic logic. Zbl 1234.03019 Leivant, Daniel 1 2009 Innocuous substitutions. Zbl 0434.03041 Leivant, Daniel 1 1980 The computational contents of ramified corecurrence. Zbl 1459.68070 Leivant, Daniel; Ramyaa, Ramyaa 1 2015 Inductive completeness of logics of programs. Zbl 1234.03018 Leivant, Daniel 1 2009 Peano’s lambda calculus: The functional abstraction implicit in arithmetic. Zbl 1031.03019 Leivant, Daniel 1 2001 Intrinsic theories and computational complexity. Zbl 07776720 Leivant, Daniel 1 1995 Primitive recursion in the abstract. Zbl 1435.68064 Leivant, Daniel; Marion, Jean-Yves 1 2020 Primitive recursion in the abstract. Zbl 1435.68064 Leivant, Daniel; Marion, Jean-Yves 1 2020 The computational contents of ramified corecurrence. Zbl 1459.68070 Leivant, Daniel; Ramyaa, Ramyaa 1 2015 Evolving graph-structures and their implicit computational complexity. Zbl 1334.68048 Leivant, Daniel; Marion, Jean-Yves 4 2013 Ramified corecurrence and logspace. Zbl 1342.68139 Ramyaa, Ramyaa; Leivant, Daniel 4 2011 Feasible functions over co-inductive data. Zbl 1305.68088 Ramyaa, Ramyaa; Leivant, Daniel 2 2010 On the completeness of dynamic logic. Zbl 1234.03019 Leivant, Daniel 1 2009 Inductive completeness of logics of programs. Zbl 1234.03018 Leivant, Daniel 1 2009 Propositional dynamic logic with program quantifiers. Zbl 1286.03119 Leivant, Daniel 4 2008 Reasoning in dynamic logic about program termination. Zbl 1133.03334 Leivant, Daniel 1 2008 Partial correctness assertions provable in dynamic logics. Zbl 1126.03314 Leivant, Daniel 1 2004 Intrinsic reasoning about functional programs. I: First order theories. Zbl 0992.03037 Leivant, Daniel 5 2002 Implicit computational complexity for higher type functionals (extended abstract). Zbl 1020.03511 Leivant, Daniel 4 2002 Termination proofs and complexity certification. Zbl 1087.68545 Leivant, Daniel 2 2001 Peano’s lambda calculus: The functional abstraction implicit in arithmetic. Zbl 1031.03019 Leivant, Daniel 1 2001 Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity. Zbl 0924.03071 Leivant, Daniel 5 1999 Applicative control and computational complexity. Zbl 0944.68070 Leivant, Daniel 2 1999 Stratified polymorphism and primitive recursion. Zbl 0935.03024 Danner, Norman; Leivant, Daniel 1 1999 Ramified recurrence and computational complexity. I: Word recurrence and poly-time. Zbl 0844.03024 Leivant, Daniel 47 1995 Ramified recurrence and computational complexity. II: Substitution and poly-space. Zbl 1044.03526 Leivant, Daniel; Marion, Jean-Yves 30 1995 Logic and computational complexity. International workshop, LCC ’94, Indianapolis, IN, USA, October 13–16, 1994. Selected Papers. Zbl 0847.00025 3 1995 Intrinsic theories and computational complexity. Zbl 07776720 Leivant, Daniel 1 1995 A foundational delineation of poly-time. Zbl 0799.03042 Leivant, Daniel 15 1994 Predicative recurrence in finite types. Zbl 0947.03065 Leivant, Daniel 8 1994 Lambda calculus characterizations of poly-time. Zbl 0781.68059 Leivant, Daniel; Marion, Jean-Yves 19 1993 Lambda calculus characterizations of poly-time. Zbl 0788.68051 Leivant, Daniel; Marion, Jean-Yves 9 1993 Functions over free algebras definable in the simply typed lambda calculus. Zbl 0792.03006 Leivant, Daniel 3 1993 Semantic characterizations of number theories. Zbl 0752.03019 Leivant, Daniel 2 1992 Finitely stratified polymorphism. Zbl 0799.68041 Leivant, Daniel 13 1991 Subrecursion and lambda representation over free algebras. Preliminary summary. Zbl 0772.03020 Leivant, Daniel 14 1990 Inductive definitions over finite structures. Zbl 0718.03034 Leivant, Daniel 7 1990 Computationally based set existence principles. Zbl 0693.03037 Leivant, Daniel 2 1990 Descriptive characterizations of computational complexity. Zbl 0677.68045 Leivant, Daniel 16 1989 Stratified polymorphism. Zbl 0716.68019 Leivant, Daniel 2 1989 Typing and computational properties of lambda expressions. Zbl 0613.68020 Leivant, Daniel 12 1986 Syntactic translations and provably recursive functions. Zbl 0593.03038 Leivant, Daniel 13 1985 Partial-correctness theories as first-order theories. Zbl 0565.68009 Leivant, Daniel 1 1985 The expressiveness of simple and second-order type structures. Zbl 0519.68046 Fortune, Steven; Leivant, Daniel; O’Donnell, Michael 38 1983 The optimality of induction as an axiomatization of arithmetic. Zbl 0515.03018 Leivant, Daniel 15 1983 Unprovability of theorems of complexity theory in weak number theories. Zbl 0482.03025 Leivant, Daniel 3 1982 On the proof theory of the modal logic for arithmetic provability. Zbl 0464.03019 Leivant, Daniel 16 1981 Proof theoretic methodology for propositional dynamic logic. Zbl 0467.03015 Leivant, Daniel 14 1981 Implicational complexity in intuitionistic arithmetic. Zbl 0488.03032 Leivant, Daniel 4 1981 Innocuous substitutions. Zbl 0434.03041 Leivant, Daniel 1 1980 Assumption classes in natural deduction. Zbl 0408.03043 Leivant, Daniel 7 1979 Failure of completeness properties of intuitionistic predicate logic for constructive models. Zbl 0362.02014 Leivant, Daniel 1 1976 Strong normalization for arithmetic. (Variations on a theme of Prawitz.). Zbl 0322.02030 Leivant, Daniel 2 1975 Existential instantiation in a system of natural deduction for intuitionistic arithmetics. Zbl 0261.02015 Leivant, Daniel 5 1973 all cited Publications top 5 cited Publications all top 5 Cited by 289 Authors 14 Leivant, Daniel M. 9 Dal Lago, Ugo 7 Péchoux, Romain 6 Baillot, Patrick 6 Hainry, Emmanuel 6 Marion, Jean-Yves 6 Schwichtenberg, Helmut 5 Beklemishev, Lev D. 5 Bellantoni, Stephen J. 5 Hella, Lauri T. 4 Berger, Ulrich 4 Bournez, Olivier 4 Coquand, Thierry 4 Dezani-Ciancaglini, Mariangiola 4 Hofmann, Martin 4 Joosten, Joost J. 4 Oitavem, Isabel 4 Schubert, Aleksy 3 Abiteboul, Serge 3 Colson, Loïc 3 Constable, Robert Lee 3 Cook, Stephen Arthur 3 Danner, Norman 3 Eguchi, Naohi 3 Eiter, Thomas 3 Gottlob, Georg 3 Kapron, Bruce M. 3 Kuusisto, Antti 3 Mazza, Damiano 3 Mints, Grigoriĭ Efroimovich 3 Niggl, Karl-Heinz 3 Redmond, Brian F. 3 Ronchi Della Rocca, Simona 3 Strahm, Thomas 3 Studer, Thomas 3 Stump, Aaron 3 Terui, Kazushige 3 Turull Torres, Jose Maria 3 Vianu, Victor 2 Aehlig, Klaus 2 Avanzini, Martin 2 Bloch, Stephen A. 2 Caporaso, Salvatore 2 Cockett, J. Robin B. 2 Cordón-Franco, Andrés 2 Damnjanovic, Zlatan 2 Dawar, Anuj 2 Doria, Francisco Antonio 2 Fernández Duque, David 2 Fernández, Maribel 2 Fujita, Ken-etsu 2 Gaboardi, Marco 2 Girard, Jean-Yves 2 Goré, Rajeev Prabhakar 2 Ishihara, Hajime 2 Kamareddine, Fairouz D. 2 Kfoury, Assaf J. 2 Kolaitis, Phokion G. 2 Lara-Martín, Francisco Felix 2 Mitchell, John C. 2 Monin, François 2 Nemoto, Takako 2 Nishimura, Hirokazu 2 Pliuškevičius, Regimantas 2 Roversi, Luca 2 Royer, James S. 2 Schwentick, Thomas 2 Shamkanov, Daniyar S. 2 Standefer, Shawn 2 Tiuryn, Jerzy 2 Urzyczyn, Paweł 2 Valentini, Silvio 2 van Bakel, Steffen 2 Vercelli, Luca 2 Visser, Albert 2 Wijesekera, Duminda 1 Alexi, Werner 1 Alonderis, Romas 1 Amadio, Roberto M. 1 Asperti, Andrea 1 Ayala-Rincón, Mauricio 1 Barbanera, Franco 1 Bárcenas, Everardo 1 Barendsen, Erik 1 Barthe, Gilles 1 Bentkamp, Alexander 1 Benzinger, Ralph 1 Berarducci, Alessandro 1 Berline, Chantal 1 Bezem, Marc 1 Bhaskar, Siddharth 1 Bickford, Mark 1 Bir, E. 1 Blanc, Manon 1 Blanchette, Jasmin Christian 1 Blass, Andreas Raphael 1 Böhm, Corrado 1 Bonfante, Guillaume 1 Borga, Marco 1 Bou, Félix ...and 189 more Authors all top 5 Cited in 37 Serials 44 Theoretical Computer Science 30 Information and Computation 27 Annals of Pure and Applied Logic 11 The Journal of Symbolic Logic 7 Mathematical Logic Quarterly (MLQ) 7 The Bulletin of Symbolic Logic 6 Studia Logica 6 Archive for Mathematical Logic 5 Notre Dame Journal of Formal Logic 5 Logical Methods in Computer Science 4 Journal of Computer and System Sciences 4 Journal of Philosophical Logic 4 Journal of Functional Programming 4 The Journal of Logic and Algebraic Programming 4 ACM Transactions on Computational Logic 3 MSCS. Mathematical Structures in Computer Science 3 Computational Complexity 3 The Review of Symbolic Logic 2 Information Processing Letters 2 Lithuanian Mathematical Journal 2 Publications of the Research Institute for Mathematical Sciences, Kyoto University 2 Synthese 2 Bulletin of the Section of Logic 2 International Journal of Foundations of Computer Science 1 Archiv für Mathematische Logik und Grundlagenforschung 1 Mathematical Notes 1 Applied Mathematics and Computation 1 Journal of Soviet Mathematics 1 Proceedings of the American Mathematical Society 1 Journal of Symbolic Computation 1 Journal of Automated Reasoning 1 Journal of Applied Non-Classical Logics 1 Journal of Mathematical Sciences (New York) 1 Annals of Mathematics and Artificial Intelligence 1 Sbornik: Mathematics 1 Theory of Computing Systems 1 Theory and Practice of Logic Programming all top 5 Cited in 10 Fields 206 Mathematical logic and foundations (03-XX) 148 Computer science (68-XX) 7 General and overarching topics; collections (00-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 2 General algebraic systems (08-XX) 2 Category theory; homological algebra (18-XX) 2 Information and communication theory, circuits (94-XX) 1 Number theory (11-XX) 1 Numerical analysis (65-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Citations by Year