×

zbMATH — the first resource for mathematics

Leivant, Daniel M.

Compute Distance To:
Author ID: leivant.daniel-m Recent zbMATH articles by "Leivant, Daniel M."
Published as: Leivant, D.; Leivant, Daniel; Leivant, Daniel M.
Documents Indexed: 65 Publications since 1971, including 6 Books

Publications by Year

Citations contained in zbMATH

44 Publications have been cited 288 times in 211 Documents Cited by Year
The expressiveness of simple and second-order type structures. Zbl 0519.68046
Fortune, Steven; Leivant, Daniel; O’Donnell, Michael
33
1983
Ramified recurrence and computational complexity. I: Word recurrence and poly-time. Zbl 0844.03024
Leivant, Daniel
32
1995
Ramified recurrence and computational complexity. II: Substitution and poly-space. Zbl 1044.03526
Leivant, Daniel; Marion, Jean-Yves
21
1995
Lambda calculus characterizations of poly-time. Zbl 0781.68059
Leivant, Daniel; Marion, Jean-Yves
20
1993
Descriptive characterizations of computational complexity. Zbl 0677.68045
Leivant, Daniel
17
1989
On the proof theory of the modal logic for arithmetic provability. Zbl 0464.03019
Leivant, Daniel
15
1981
A foundational delineation of poly-time. Zbl 0799.03042
Leivant, Daniel
12
1994
The optimality of induction as an axiomatization of arithmetic. Zbl 0515.03018
Leivant, Daniel
12
1983
Proof theoretic methodology for propositional dynamic logic. Zbl 0467.03015
Leivant, Daniel
12
1981
Subrecursion and lambda representation over free algebras. Preliminary summary. Zbl 0772.03020
Leivant, Daniel
11
1990
Finitely stratified polymorphism. Zbl 0799.68041
Leivant, Daniel
10
1991
Typing and computational properties of lambda expressions. Zbl 0613.68020
Leivant, Daniel
10
1986
Syntactic translations and provably recursive functions. Zbl 0593.03038
Leivant, Daniel
9
1985
Predicative recurrence in finite types. Zbl 0947.03065
Leivant, Daniel
7
1994
Lambda calculus characterizations of poly-time. Zbl 0788.68051
Leivant, Daniel; Marion, Jean-Yves
6
1993
Inductive definitions over finite structures. Zbl 0718.03034
Leivant, Daniel
5
1990
Intrinsic reasoning about functional programs. I: First order theories. Zbl 0992.03037
Leivant, Daniel
4
2002
Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity. Zbl 0924.03071
Leivant, Daniel
4
1999
Assumption classes in natural deduction. Zbl 0408.03043
Leivant, Daniel
4
1979
Existential instantiation in a system of natural deduction for intuitionistic arithmetics. Zbl 0261.02015
Leivant, Daniel
4
1973
Ramified corecurrence and logspace. Zbl 1342.68139
Ramyaa, Ramyaa; Leivant, Daniel
3
2011
Propositional dynamic logic with program quantifiers. Zbl 1286.03119
Leivant, Daniel
3
2008
Implicit computational complexity for higher type functionals (extended abstract). Zbl 1020.03511
Leivant, Daniel
3
2002
Logic and computational complexity. International workshop, LCC ’94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers. Zbl 0847.00025
Leivant, Daniel (ed.)
3
1995
Unprovability of theorems of complexity theory in weak number theories. Zbl 0482.03025
Leivant, Daniel
3
1982
Feasible functions over co-inductive data. Zbl 1305.68088
Ramyaa, Ramyaa; Leivant, Daniel
2
2010
Termination proofs and complexity certification. Zbl 1087.68545
Leivant, Daniel
2
2001
Functions over free algebras definable in the simply typed lambda calculus. Zbl 0792.03006
Leivant, Daniel
2
1993
Computationally based set existence principles. Zbl 0693.03037
Leivant, Daniel
2
1990
Stratified polymorphism. Zbl 0716.68019
Leivant, Daniel
2
1989
Strong normalization for arithmetic. (Variations on a theme of Prawitz.). Zbl 0322.02030
Leivant, Daniel
2
1975
Evolving graph-structures and their implicit computational complexity. Zbl 1334.68048
Leivant, Daniel; Marion, Jean-Yves
1
2013
Inductive completeness of logics of programs. Zbl 1234.03018
Leivant, Daniel
1
2009
On the completeness of dynamic logic. Zbl 1234.03019
Leivant, Daniel
1
2009
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
Peano’s lambda calculus: The functional abstraction implicit in arithmetic. Zbl 1031.03019
Leivant, Daniel
1
2001
Applicative control and computational complexity. Zbl 0944.68070
Leivant, Daniel
1
1999
Stratified polymorphism and primitive recursion. Zbl 0935.03024
Danner, Norman; Leivant, Daniel
1
1999
Semantic characterizations of number theories. Zbl 0752.03019
Leivant, Daniel
1
1992
Partial-correctness theories as first-order theories. Zbl 0565.68009
Leivant, Daniel
1
1985
Implicational complexity in intuitionistic arithmetic. Zbl 0488.03032
Leivant, Daniel
1
1981
Innocuous substitutions. Zbl 0434.03041
Leivant, Daniel
1
1980
Failure of completeness properties of intuitionistic predicate logic for constructive models. Zbl 0362.02014
Leivant, Daniel
1
1976
Evolving graph-structures and their implicit computational complexity. Zbl 1334.68048
Leivant, Daniel; Marion, Jean-Yves
1
2013
Ramified corecurrence and logspace. Zbl 1342.68139
Ramyaa, Ramyaa; Leivant, Daniel
3
2011
Feasible functions over co-inductive data. Zbl 1305.68088
Ramyaa, Ramyaa; Leivant, Daniel
2
2010
Inductive completeness of logics of programs. Zbl 1234.03018
Leivant, Daniel
1
2009
On the completeness of dynamic logic. Zbl 1234.03019
Leivant, Daniel
1
2009
Propositional dynamic logic with program quantifiers. Zbl 1286.03119
Leivant, Daniel
3
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
4
2002
Implicit computational complexity for higher type functionals (extended abstract). Zbl 1020.03511
Leivant, Daniel
3
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
4
1999
Applicative control and computational complexity. Zbl 0944.68070
Leivant, Daniel
1
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
32
1995
Ramified recurrence and computational complexity. II: Substitution and poly-space. Zbl 1044.03526
Leivant, Daniel; Marion, Jean-Yves
21
1995
Logic and computational complexity. International workshop, LCC ’94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers. Zbl 0847.00025
Leivant, Daniel (ed.)
3
1995
A foundational delineation of poly-time. Zbl 0799.03042
Leivant, Daniel
12
1994
Predicative recurrence in finite types. Zbl 0947.03065
Leivant, Daniel
7
1994
Lambda calculus characterizations of poly-time. Zbl 0781.68059
Leivant, Daniel; Marion, Jean-Yves
20
1993
Lambda calculus characterizations of poly-time. Zbl 0788.68051
Leivant, Daniel; Marion, Jean-Yves
6
1993
Functions over free algebras definable in the simply typed lambda calculus. Zbl 0792.03006
Leivant, Daniel
2
1993
Semantic characterizations of number theories. Zbl 0752.03019
Leivant, Daniel
1
1992
Finitely stratified polymorphism. Zbl 0799.68041
Leivant, Daniel
10
1991
Subrecursion and lambda representation over free algebras. Preliminary summary. Zbl 0772.03020
Leivant, Daniel
11
1990
Inductive definitions over finite structures. Zbl 0718.03034
Leivant, Daniel
5
1990
Computationally based set existence principles. Zbl 0693.03037
Leivant, Daniel
2
1990
Descriptive characterizations of computational complexity. Zbl 0677.68045
Leivant, Daniel
17
1989
Stratified polymorphism. Zbl 0716.68019
Leivant, Daniel
2
1989
Typing and computational properties of lambda expressions. Zbl 0613.68020
Leivant, Daniel
10
1986
Syntactic translations and provably recursive functions. Zbl 0593.03038
Leivant, Daniel
9
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
33
1983
The optimality of induction as an axiomatization of arithmetic. Zbl 0515.03018
Leivant, Daniel
12
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
15
1981
Proof theoretic methodology for propositional dynamic logic. Zbl 0467.03015
Leivant, Daniel
12
1981
Implicational complexity in intuitionistic arithmetic. Zbl 0488.03032
Leivant, Daniel
1
1981
Innocuous substitutions. Zbl 0434.03041
Leivant, Daniel
1
1980
Assumption classes in natural deduction. Zbl 0408.03043
Leivant, Daniel
4
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
4
1973
all top 5

Cited by 230 Authors

12 Leivant, Daniel M.
7 Baillot, Patrick
7 Dal Lago, Ugo
5 Hella, Lauri T.
5 Schwichtenberg, Helmut
4 Abiteboul, Serge
4 Beklemishev, Lev D.
4 Bellantoni, Stephen J.
4 Coquand, Thierry
4 Dezani-Ciancaglini, Mariangiola
4 Hofmann, Martin
4 Marion, Jean-Yves
4 Schubert, Aleksy
4 Vianu, Victor
3 Colson, Loïc
3 Cook, Stephen Arthur
3 Danner, Norman
3 Eiter, Thomas
3 Gottlob, Georg
3 Joosten, Joost J.
3 Kuusisto, Antti
3 Mazza, Damiano
3 Niggl, Karl-Heinz
3 Redmond, Brian F.
3 Ronchi Della Rocca, Simona
3 Strahm, Thomas
3 Studer, Thomas
3 Terui, Kazushige
3 Turull Torres, Jose Maria
2 Aehlig, Klaus
2 Avanzini, Martin
2 Berger, Ulrich
2 Bournez, Olivier
2 Caporaso, Salvatore
2 Cockett, Robin
2 Constable, Robert Lee
2 Cordón-Franco, Andrés
2 Cucker, Felipe
2 Damnjanovic, Zlatan
2 de Naurois, Paulin Jacobé
2 Doria, Francisco Antonio
2 Fernández, Maribel
2 Fujita, Ken-etsu
2 Gaboardi, Marco
2 Goré, Rajeev Prabhakar
2 Hainry, Emmanuel
2 Kamareddine, Fairouz D.
2 Kfoury, Assaf J.
2 Kolaitis, Phokion G.
2 Kolmakov, Evgeny
2 Lara-Martín, Francisco Felix
2 Marion, J.-Y. J.-Y.
2 Mints, Grigoriĭ Efroimovich
2 Mitchell, John C.
2 Monin, François
2 Nishimura, Hirokazu
2 Oitavem, Isabel
2 Péchoux, Romain
2 Pliuškevičius, Regimantas
2 Roversi, Luca
2 Royer, James S.
2 Shamkanov, Daniyar S.
2 Stump, Aaron
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 Barendsen, Erik
1 Barthe, Gilles
1 Benzinger, Ralph
1 Berarducci, Alessandro
1 Berline, Chantal
1 Bezem, Marc
1 Bickford, Mark
1 Bir, E.
1 Blass, Andreas Raphael
1 Bloch, Stephen A.
1 Böhm, Corrado
1 Bonfante, Guillaume
1 Borga, Marco
1 Bou, Félix
1 Boudes, Pierre
1 Breazu-Tannen, Val
1 Bruce, Kim B.
1 Brunel, Aloïs
1 Buchholz, Wilfried
1 Burgess, John P.
1 Burrell, Mike
1 Buss, Sam
1 Carlström, Jesper
1 Carter, Nathan C.
...and 130 more Authors

Citations by Year