[1] Martin Hofmann, Jaap van Oosten, and Thomas Streicher. Well-foundedness in realizability. Archive for Mathematical Logic, 45(7):795-805, 2006. [ bib ]
[2] Steve Awodey, Carsten Butz, Alex Simpson, and Streicher Thomas. Relating first-order set theories and elementary toposes. Bulletin of Symbolic Logic, 13(3):340-358, 2007. [ bib ]
[3] Paulo Oliva and Streicher Thomas. On krivine's realizability interpretation of classical second-order arithmetic. Fundamenta Mathematicae, page (to appear), 2008. [ bib ]
[4] T. Löw and T. Streicher. Universality results for models in locally boolean domains. In Proceedings of CSL 2006, volume 4207 of Lecture Notes in Computer Science, pages 456-470,. Springer Verlag, 2006. [ bib ]
[5] G. Gruenhage and T. Streicher. Quotients of countably based spaces are not closed under sobrification. MSCS, 16(2):223-229, 2006. [ bib ]
[6] T. Streicher. Universes in toposes. In L. Crosilla and P. Schuster, editors, From sets and types to topology and analysis, pages 78-90. Oxford University Press, 2005. [ bib ]
[7] B. Reus and T. Streicher. About hoare logics for higher-order store. In Proceedings of ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 1337-1348,. Springer Verlag, 2005. [ bib ]
[8] J. Bénabou and T. Streicher. Partial toposes. Theory Appl. Categ., 11:309-320, 2003. [ bib ]
[9] M. Escardó, M. Hofmann, and T. Streicher. On the non-sequential nature of the interval-domain model of real-number computation. Math. Struct. Comp. Sc., 14(6):803-814, 2004. [ bib ]
[10] M. Bunge, J. Funk, M. Jibladze, and T. Streicher. Definable completeness. Cah. Topol. Géom. Différ. Catég., 45(4):243-266, 2004. [ bib ]
[11] B. Reus and T. Streicher. Semantics and logic of object calculi. Theoret. Comp. Sc., 316(1-3):191-213, 2004. [ bib ]
[12] M. Bunge, J. Funk, M. Jibladze, and T. Streicher. The michael completion of a topos spread. J. Pure Appl. Algebra, 175(1-3):63-91, 2002. [ bib ]
[13] M. Bunge, J. Funk, M. Jibladze, and T. Streicher. Distribution algebras and duality. Adv. Math., 156(1):133-155, 2000. [ bib ]
[14] M. Escardó and T. Streicher. In domain realizability, not all functionals on c[-1,1] are continuous. Math. Log.Qu., 48(suppl.1):41-44, 2002. [ bib ]
[15] M. Hofmann and T. Streicher. Completeness of continuation models for λμ-calculus. Inform. and Comp., 179(2):332-355, 2002. [ bib ]
[16] P. Lietz and T. Streicher. Impredicativity entails untypedness. Math. Struct. Comp. Sc., 12(3):335-347, 2002. [ bib ]
[17] M. Marz, A. Rohr, and T. Streicher. Full abstraction and universality via realisability. In Proceedings of LICS'99, pages 174-182. IEEE Computer Soc, 1999. [ bib ]
[18] T. Streicher. Denotational completness revisited. Electron. Notes Theor. Comp. Sc., 29:288-300, 1999. [ bib ]
[19] T. Streicher. Inductive construction of repletion. Appl. Categ. Struct., 7(1-2):185-207, 1999. [ bib ]
[20] B. Reus and T. Streicher. General synthetic domain theory-a logical approach. Math. Structures Comput. Sci., 210(1):121-157, 1999. [ bib ]
[21] M. Escardó and T. Streicher. Induction and recursion on the partial real line with applications to real pcf. Theoret. Comp. Sci., 9(2):177-223, 1999. [ bib ]
[22] B. Reus and T. Streicher. Classical logic, continuation semantics and abstract machines. J. Funct. Prog., 8(6):543-572, 1998. [ bib ]
[23] M. Hofmann and T. Streicher. The groupoid interpretation of type theory. In Twenty-five years of constructive type theory, volume 36 of Oxford Logic Guides, pages 83-111. Oxford University Press, 1998. [ bib ]
[24] B. Reus and T. Streicher. General synthetic domain theory-a logical approach (extended abstract). In Proceedings of CTCS'96, volume 1290 of Lecture Notes in Computer Science, pages 293-313. Springer, 1997. [ bib ]
[25] T. Altenkirch, M. Hofmann, and T. Streicher. Reduction-free normalisation for a polymorphic system. In Proceedings of LICS'96, pages 98-106. IEEE Computer Soc, 1996. [ bib ]
[26] T. Altenkirch, M. Hofmann, and T. Streicher. Categorical reconstruction of a reduction free normalization proof. In Proceedings of CTCS'95, volume 953 of Lecture Notes in Computer Science, pages 182-199. Springer, 1995. [ bib ]
[27] A. Mück, T. Streicher, and H. Lock. A tiny constraint functional logic language and its continuation semantics. In Proceedings of ESOP'94, volume 788 of Lecture Notes in Computer Science, pages 439-453. Springer, 1994. [ bib ]
[28] T. Streicher. A universality theorem for pcf with recursive types, parallel-or and there exists. 4(1):111-115, 1994. [ bib ]
[29] T. Streicher. Independence of the induction principle and the axiom of choice in the pure calculus of constructions. Theoret. Comput. Sc., 103(2):395-408, 1992. [ bib ]
[30] T. Streicher. Dependence and independence results for (impredicative) calculi of dependent types. Math. Struct. Comput. Sc., 2(1):29-54, 1992. [ bib ]
[31] M. Broy and T. Streicher. Modular functional modelling of petri nets with individual tokens. In Advances in Petri Nets 1992, volume 609 of Lecture Notes in Computer Science, pages 70-88. Springer, 1992. [ bib ]
[32] T. Streicher. Semantics of Type Theory. Progress in Theoretical Computer Science. Birkhaeuser Boston, Inc., 1991. [ bib ]
[33] T. Streicher. Domain-theoretic Foundations of Functional Programming. World Scientific, 2006. [ bib ]
[34] B. Jacobs, E. Moggi, and T. Streicher. Relating models of impredicative type theories. In Proceedings of CTCS'91, volume 530 of Lecture Notes in Computer Science, pages 197-218. Springer, 1991. [ bib ]
[35] M. Broy and T. Streicher. Specification and design of shared resource arbitration. Int. J. Parallel Program., 20(1):1-22, 1991. [ bib ]
[36] T. Streicher. Independence results for calculi of dependent types. In Proceedings of CTCS'89, volume 389 of Lecture Notes in Computer Science, pages 141-154. Springer, 1989. [ bib ]
[37] M. Broy and T. Streicher. Views of distributed systems. In Mathematical models for the semantics of parallelism, volume 280 of Lecture Notes in Computer Science, pages 114-143. Springer, 1987. [ bib ]
[38] Martin Otto. Elementary proof of the van Benthem-Rosen characterisation theorem. Technical Report 2342, Department of Mathematics, Darmstadt University of Technology, 2004. [ bib ]
[39] Martin Otto. Modal and guarded characterisation theorems over finite transition systems. Annals of Pure and Applied Logic, 130:173-205, 2004. [ bib ]
[40] Ian Hodkinson and Martin Otto. Finite conformal hypergraph covers and Gaifman cliques in finite structures. The Bulletin of Symbolic Logic, 9:387-405, 2003. [ bib ]
[41] Stephan Kreutzer, Martin Otto, and Nicole Schweikardt. Boundedness of monadic FO over acyclic structures. In Arge et al., editors, Proceedings of ICALP'2007, volume 4596 of LNCS, pages 571-582. Springer-Verlag, 2007. [ bib ]
[42] Eva Hoogland, Marten Marx, and Martin Otto. Beth definability for the guarded fragment. In Proceedings of LPAR'99, volume 1705 of LNAI, pages 273-285. Springer-Verlag, 1999. See also in: JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, J. Gebrandy, M. Marx, M. de Rijke and Y. Venema (ed.), CD-ROM, Amsterdam University Press 1999. [ bib ]
[43] Erich Grädel, Colin Hirsch, and Martin Otto. Back and forth between guarded and modal logics. ACM Transactions on Computational Logic, 3:418-463, 2002. [ bib ]
[44] Erich Grädel, Colin Hirsch, and Martin Otto. Back and forth between guarded and modal logics. In Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS'00, pages 217-228, 2000. [ bib ]
[45] Martin Otto. An interpolation theorem. Bulletin of Symbolic Logic, 6:447-462, 2000. [ bib ]
[46] Martin Otto. Epsilon-logic is more expressive than first-order logic over finite structures. Journal of Symbolic Logic, 65:1749-1757, 2000. [ bib ]
[47] Martin Otto. Two-variable first-order logic over ordered domains. Journal of Symbolic Logic, 66:685-702, 2001. [ bib ]
[48] Martin Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237-265, 1999. [ bib ]
[49] Martin Otto. Eliminating recursion in the mu-calculus. In C. Meinel and S. Tison, editors, Proceedings of STACS'99, volume 1563 of LNCS, pages 531-540. Springer-Verlag, 1999. [ bib ]
[50] Erich Grädel and Martin Otto. On logics with two variables. Theoretical Computer Science, 224:73-113, 1999. [ bib ]
[51] Erich Grädel, Martin Otto, and Eric Rosen. Undecidability results for two-variable logics. Archive for Mathematical Logic, 38:313-354, 1999. [ bib ]
[52] Martin Otto. Bounded-variable logics: two, three, and more. Archive for Mathematical Logic, 38:235-256, 1999. [ bib ]
[53] Martin Otto. Automorphism properties of stationary logic. Journal of Symbolic Logic, 57:231-237, 1992. [ bib ]
[54] Martin Otto. EM functors for a class of generalized quantifiers. Archive for Mathematical Logic, 31:355-371, 1992. [ bib ]
[55] Martin Otto. Note on the number of monadic quantifiers in monadic σ11. Information Processing Letters, 53:337-339, 1995. [ bib ]
[56] Martin Otto. Canonization for two variables and puzzles on the square. Annals of Pure and Applied Logic, 85:243-282, 1997. [ bib ]
[57] Martin Otto. The logic of explicitly representation-invariant circuits. 1258:369-384, 1997. [ bib ]
[58] Martin Otto and Jan Van den Bussche. First-order queries on databases embedded in an infinite structure. Information Processing Letters, 60:37-41, 1996. [ bib ]
[59] Martin Otto. Capturing bisimulation-invariant Ptime. In Proceedings of 4th Symposium on Logical Foundations of Computer Science, LFCS `97, volume 1234 of LNCS, pages 294-305. Springer-Verlag, 1997. [ bib ]
[60] Martin Otto. Ptime canonization for two variables with counting. In Proceedings of 10th IEEE Symposium on Logic in Computer Science LICS `95, pages 342-352, 1995. [ bib ]
[61] Martin Otto. The expressive power of fixed-point logic with counting. Journal of Symbolic Logic, 61:147-176, 1996. [ bib ]
[62] Martin Otto. Generalized quantifiers for simple properties. In Proceedings of 9th IEEE Symposium on Logic in Computer Science LICS `94, pages 30-39, 1994. [ bib ]
[63] Phokion Kolaitis and Martin Otto. On the boundedness problem for two-variable first-order logic. In Proceedings of IEEE Symposium on Logic in Computer Science LICS `98, pages 513-524, 1998. [ bib ]
[64] Frank Neven, Martin Otto, Jerzy Tyszkiewicz, and Jan Van den Bussche. Adding FOR-loops to first-order logic. Information and Computation, 168:156-186, 2001. proceedings version in: ICDT'99, LNCS 1540, 1999, pp. 58-69. [ bib ]
[65] Frank Neven, Martin Otto, Jerzy Tyszkiewicz, and Jan Van den Bussche. Adding FOR-loops to first-order logic. In Proceedings of ICDT'99, volume 1540 of LNCS, pages 58-69. Springer-Verlag, 1999. [ bib ]
[66] Martin Otto. A reduction scheme for phase spaces with almost-Kähler symmetry - regularity results for momentum level sets. Journal of Geometry and Physics, 4:101-118, 1987. [ bib ]
[67] Martin Otto. Modal and guarded characterisation theorems over finite transition systems. In Proceedings of 17th IEEE Symposium on Logic in Computer Science LICS'02, pages 371-380, 2002. [ bib ]
[68] Martin Otto. Bisimulation invariance and finite models. In Z. Chatzidakis, P. Koepke, and W. Pohlers, editors, Logic Colloquium '02, Lecture Notes in Logic. ASL, 2006. [ bib ]
[69] Valentin Goranko and Martin Otto. Model theory of modal logic. In P. Blackburn, F. Wolter, and J. van Benthem, editors, Handbook of Modal Logic, pages 255-325. Elsevier, 2006. [ bib ]
[70] Anuj Dawar and Martin Otto. Modal characterisation theorems over special classes of frames. In Proceedings of 20th IEEE Symposium on Logic in Computer Science LICS'05, pages 21-30, 2005. [ bib ]
[71] Martin Otto. The boundedness problem for monadic universal first-order logic. In Proceedings of 21st IEEE Symposium on Logic in Computer Science LICS'06, pages 37-46, 2006. [ bib ]
[72] Emanuel Kieronski and Martin Otto. Small substructures and decidability issues for two-variable first-order logic. In Proceedings of 20th IEEE Symposium on Logic in Computer Science LICS'05, pages 448-457, 2005. [ bib ]
[73] Martin Otto. Bounded variable logics and counting - A study in finite models, volume 9. Springer-Verlag, 1997. IX+183 pages. [ bib ]
[74] Yohji Akama, Stefano Berardi, Susumu Hayashi, and Ulrich Kohlenbach. An arithmetical hierarchy of the law of excluded middle and related principles. In H. Ganzinger, editor, Proc. of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pages 192-201. IEEE Computer Society Press, 2004. [ bib ]
[75] Ben Cohen, Martin Escardo, and Klaus Keimel. The extended probabilistic power domain monad over stably compact spaces. In Jin-Yi Cai, S. Barry Cooper, and Angsheng Li, editors, Proceedings of TAMC 2006: Theory and Applications of Models of Computation, volume 3959 of Lecture Notes in Computer Science, pages 566-575. Springer Verlag, 2006. [ bib ]
[76] Klaus Keimel. The monad of probability measures over compact ordered spaces and its eilenberg-moore algebras. Topology and its Applications, to appear:18 pages, 2008. [ bib ]
[77] Klaus Keimel. Topological cones: functional analysis in a t0-setting. Semigroup Forum, 77:108-142, 2008. [ bib ]
[78] Klaus Keimel and Thomas Streicher. Predicate transformer semantics. Annals of Pure and Applied Logic, to appear:20 pages, 2008. [ bib ]
[79] Samy Abbes and Klaus Keimel. Projective topology on bifinite domains and applications. Theoretical Computer Science, 365:171-183, 2006. [ bib ]
[80] Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael Mislove, and Dana S. Scott. Continuous Lattices and Domains, volume 93 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2003. [ bib ]
[81] Michael Huth, Achim Jung, and Klaus Keimel. Linear types, approximation, and topology. Mathematical Structures in Computer Science, 10:719-746, 2000. [ bib ]
[82] Klaus Keimel. Topological cones: Foundations for a domain theoretical semantics combining probability and nondeterminism. Electronic Notes in Theoretical Computer Science, 155:423-443, 2006. [ bib ]
[83] Klaus Keimel and Walter Roth. Ordered Cones and Approximation, volume 1517 of Lectures Notes in Mathematics. Springer Verlag, 1992. [ bib ]
[84] Klaus Keimel and Jimmie D. Lawson. Measure extension theorems for t0-spaces. Topology and its Applications, 149:57-83, 2005. [ bib ]
[85] Regina Tix, Klaus Keimel, and Gordon D. Plotkin. Semantic domains for combining probability and non-determinism. Electronic Notes in Theoretical Computer Science, 129:1-104, 2005. [ bib ]
[86] George Georgescu, Lauren~tiu Leu~stean, and Viorel Preoteasa. Pseudo-hoops. Journal of Multiple-Valued Logic and Soft Computing, 11(1-2):153-184, 2005. [ bib ]
[87] George Georgescu and Lauren~tiu Leu~stean. Some classes of pseudo-bl algebras. Journal of Australian Mathematical Society, 73(1):127-153, 2002. [ bib ]
[88] Philipp Gerhardy. Improved Complexity Analysis of Cut Elimination and Herbrand's Theorem. Master's thesis, Aarhus, 2003. [ bib ]
[89] Philipp Gerhardy. Refined Complexity Analysis of Cut Elimination. In Matthias Baaz and Johann Makovsky, editors, Proceedings of the 17th International Workshop CSL 2003, volume 2803 of LNCS, pages 212-225. Springer-Verlag, Berlin, 2003. [ bib ]
[90] Philipp Gerhardy. The Role of Quantifier Alternations in Cut Elimination. Notre Dame Journal of Formal Logic, 46:165-171, 2005. [ bib ]
[91] Philipp Gerhardy. A quantitative version of Kirk's fixed point theorem for asymptotic contractions. J. Math. Anal. Appl., 316:339-345, 2006. [ bib ]
[92] Philipp Gerhardy and Ulrich Kohlenbach. Extracting Herbrand Disjuntions by Functional Interpretation. Arch. Math. Logic, 44:633-644, 2005. [ bib ]
[93] Philipp Gerhardy and Ulrich Kohlenbach. Strongly uniform bounds from semi-constructive proofs. Ann. Pure Appl. Logic, 141:89-107, 2006. [ bib ]
[94] Philipp Gerhardy and Ulrich Kohlenbach. General logical metatheorems for functional analysis. Trans. Amer. Math. Soc., 2007. [ bib ]
[95] Ulrich Kohlenbach. A logical uniform boundedness principle for abstract metric and hyperbolic spaces. Electronic Notes in Theoretical Computer Science, 165:81-93, 2006. [ bib ]
[96] Philipp Gerhardy and Ulrich Kohlenbach. General Logical Metatheorems for Functional Analysis. BRICS Research Report, 21:65pp., 2005. [ bib ]
[97] Mircea-Dan Hernest and Ulrich Kohlenbach. A Complexity Analysis of Functional Interpretations. Theoretical Computer Science, 338:200-246, 2005. [ bib ]
[98] Ulrich Kohlenbach. Things that can and things that can't be done in PRA. Annals of Pure and Applied Logic, 102:223-245, 2000. [ bib ]
[99] Ulrich Kohlenbach. A note on Spector's quantifier-free rule of extensionality. Arch. Math. Logic, 40:89-92, 2001. [ bib ]
[100] Ulrich Kohlenbach. A quantitative version of a theorem due to Borwein-Reich-Shafrir. Numer. Funct. Anal. and Optimiz., 22:641-656, 2001. [ bib ]
[101] Ulrich Kohlenbach. On the computational content of the krasnoselski and ishikawa fixed point theorems. In J. Blanck, V. Brattka, and P. Hertling, editors, Proc. of the Fourth Workshop on Computability and Complexity in Analysis, pages 119-145. Spinger Lecture Notes in Computer Science LNCS 2064, 2001. [ bib ]
[102] Ulrich Kohlenbach. Effective bounds from proofs in abstract functional analysis. In B. Cooper, B. Loewe, and A. Sorbi, editors, New Computational Paradigms. Changing Conceptions of What is Computable, pages 223-258. Springer Publishers, 2008. [ bib ]
[103] Ulrich Kohlenbach. Iinterview on the philosophy of mathematics. In V. Henricks and H. Leitgeb, editors, Philosophy of Mathematics: 5 Questions, pages 183-190. Automatic Press/VIP, 2008. [ bib ]
[104] Ulrich Kohlenbach. Goedel's functional interpretation and its use in current mathematics. In Matthias Baaz, editor, Horizons of Truth: Goedel Centenary. Cambridge University Press, 2008. Reprinted in: dialectica Vol. 62, no. 2, pp. 223-267 (2008). [ bib ]
[105] Ulrich Kohlenbach. Applied Proof Theory: Proof Interpretations and their Use in Mathematics. Springer Monographs in Mathematics. Springer Verlag, 2008. [ bib ]
[106] Ulrich Kohlenbach. Intuitionistic choice and restricted classical logic. Math. Logic Quaterly, 47:455-460, 2001. [ bib ]
[107] Ulrich Kohlenbach. Herbrand's theorem and extractive proof theory. SMF - Gazette des Mathematiciens, 118:29-41, 2001. [ bib ]
[108] Ulrich Kohlenbach. On uniform weak König's lemma. Annals of Pure and Applied Logic, 114:103-116, 2002. [ bib ]
[109] Ulrich Kohlenbach. On weak Markov's principle. Math. Logic Quaterly, 48, supp.1:59-65, 2002. [ bib ]
[110] Ulrich Kohlenbach. Applied foundations: proof mining in analysis. Newsletter of the Danish Mathematical Society (Mathilde), 13:7-9, 2002. [ bib ]
[111] Ulrich Kohlenbach. Foundational and mathematical uses of higher types. In W. Sieg, R. Sommer, and C. Talcott, editors, Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman., volume 15 of Lecture Notes in Logic, pages 92-116. ASL and A K Peters, 2002. [ bib ]
[112] Ulrich Kohlenbach. Some Logical Metatheorems with Applications in Functional Analysis. Trans. Amer. Math. Soc., 357:89-128, 2005. [ bib ]
[113] Ulrich Kohlenbach. Uniform asymptotic regularity for Mann iterates. J. Math. Anal. Appl., 279:531-544, 2003. [ bib ]
[114] Ulrich Kohlenbach. Proof interpretations and the computational content of proofs, 2005. Draft, December 2005, ii+395pp, http://www.mathematik.tu-darmstadt.de/~kohlenbach/newcourse.ps.gz. [ bib ]
[115] Ulrich Kohlenbach. Some computational aspects of metric fixed point theory. Nonlinear Analysis, 61:823-837, 2005. [ bib ]
[116] Ulrich Kohlenbach. Higher order reverse mathematics. In S.G. Simpson, editor, Reverse Mathematics 2001, volume 21 of Lecture Notes in Logic, pages 281-295. ASL and A K Peters, 2005. [ bib ]
[117] Ulrich Kohlenbach and Branimir Lambov. Bounds on iterations of asymptotically quasi-non-expansive mappings. In J.G. Falset, E.L. Fuster, and B. Sims, editors, Proc. International Conference on Fixed Point Theory and Applications, Valencia 2003, pages 143-172. Yokohama Publishers, 2004. [ bib ]
[118] Ulrich Kohlenbach and Lauren~tiu Leu~stean. Approximate fixed points of nonexpansive functions in product spaces. In Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy, editors, Mathematics, Algorithms, Proofs, number 05021 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany, 2006. <http://drops.dagstuhl.de/opus/volltexte/2006/433> [date of citation: 2006-01-01]. [ bib ]
[119] Thomas Streicher and Ulrich Kohlenbach. Shoenfield is goedel after krivine. Mathematical Logic Quarterly, 53:176-179, 2007. [ bib ]
[120] Ulrich Kohlenbach. Proof interpretations and the computational content of proofs in mathematics. Bulletin EATCS, 93:143-173, 2007. [ bib ]
[121] Ulrich Kohlenbach. Proof mining in functional analysis (abstract). In S.B. Cooper, B. Loewe, and L. Torenvliet, editors, CiE 2005, LNCS, pages 233-234. Springer Verlag, 2005. [ bib ]
[122] Ulrich Kohlenbach and Paulo Oliva. Proof Mining: A Systematic Way of Analyzing Proofs in Mathematics. Proc. Steklov Inst. Math, 242:136-164, 2003. [ bib ]
[123] Mauricio Alvarez Manilla, Achim Jung, and Klaus Keimel. Valuations and measures on stably compact spaces. Theoretical Computer Science, 328:221-244, 2004. [ bib ]
[124] Klaus Keimel. The probabilistic powerdomain for the upwards topology of a compact ordered space. Electronic Notes in Theoretical Computer Science, 87:225-238, 2004. [ bib ]
[125] Klaus Keimel and Ji-Hua Liang. Order environments of topological spaces. Acta Mathematica Sinica, 20:943-948, 2004. [ bib ]
[126] Klaus Keimel and Ji-Hua Liang. Compact continuous l-domains. Computers and Mathematics with Applications, 38:81-89, 1999. [ bib ]
[127] Klaus Keimel. Bi-continuous valuations. Electronic Notes in Theoretical Computer Science, 13, 1998. [ bib ]
[128] Thomas Erker, Martín Escardo, and Klaus Keimel. The way-below relation of function spaces over semantic domains. Topology and its applications, 89:61-74, 1998. [ bib ]
[129] Klaus Keimel. Some trends in lattice-ordered groups and rings. In K.A. Baker and R. Wille, editors, Lattice Theory and its Applications, pages 131-161. Heldermann Verlag, 1995. [ bib ]
[130] Klaus Keimel and Gordon D. Plotkin. Predicate transformers for convex powerdomains. submitted, page 40pp., 2007. [ bib ]
[131] Klaus Keimel and Jimmie D. Lawson. d-completions and the d-topology. Annals of Pure and Applied Logic, to appear:27pp., 2008. [ bib ]
[132] Ulrich Kohlenbach and Paulo Oliva. Proof mining in L1-approximation. Annals of Pure and Applied Logic, 121:1-38, 2003. [ bib ]
[133] Ulrich Kohlenbach. On the no-counterexample interpretation. J. Symbolic Logic, 64:1491-1511, 1999. [ bib ]
[134] Ulrich Kohlenbach. A note on Goodman's theorem. Studia Logica, 63:1-5, 1999. [ bib ]
[135] Ulrich Kohlenbach. The use of a logical principle of uniform boundedness in analysis. In Cantini A., E. Casari, and P. Minari, editors, Logic and Foundations of Mathematics. Synthese Library 280, pages 93-106. Kluwer Academic Publishers, 1999. [ bib ]
[136] Ulrich Kohlenbach. On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness. Annals of Pure and Applied Logic, 95:257-285, 1998. [ bib ]
[137] Ulrich Kohlenbach. Relative constructivity. Journal of Symbolic Logic, 63:1218-1238, 1998. [ bib ]
[138] Ulrich Kohlenbach. Proof theory and computational analysis. Electronic Notes in Theoretical Computer Science, 13:34pp., 1998. [ bib ]
[139] Ulrich Kohlenbach. Elimination of skolem functions for monotone formulas in analysis. Arch. Math. Logic, 37:363-390, 1998. [ bib ]
[140] Ulrich Kohlenbach. Arithmetizing proofs in analysis. In J.M. Larrazabal, D. Lascar, and G. Mints, editors, Proceeedings of the Logic Colloquium'96, Lecture Notes in Logic, pages 115-158. Springerverlag, 1998. [ bib ]
[141] Ulrich Kohlenbach. Mathematically strong subystems of analysis with low rate of growth of provably recursive functionals. Arch. Math. Logic, 36:31-71, 1996. [ bib ]
[142] Ulrich Kohlenbach. Analysing proofs in analysis. In W. Hodges, M. Hyland, Steinhorn C., and J. Truss, editors, Logic: from foundations to applications. Proceeedings of the Logic Colloquium'93, pages 225-260. Oxford University Press, 1996. [ bib ]
[143] Ulrich Kohlenbach. A note on the π02-induction rule. Arch. Math. Logic, 34:279-283, 1995. [ bib ]
[144] Ulrich Kohlenbach. Effective moduli from ineffective uniqueness proofs. an unwinding of de la vallee poussin's proof for chebycheff approximation. Annals of Pure and Logic, 64:27-94, 1993. [ bib ]
[145] Ulrich Kohlenbach. New effective moduli of uniqueness and uniform a-priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory. Numerical Functional Analysis and Optimization, 14:581-606, 1993. [ bib ]
[146] Ulrich Kohlenbach. Remarks on herbrand normal forms and herbrand realizations. Arch. Math. Logic, 31:305-317, 1992. [ bib ]
[147] Ulrich Kohlenbach. Pointwise hereditary majorization and some applications. Arch. Math. Logic, 31:227-241, 1992. [ bib ]
[148] Ulrich Kohlenbach. Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization. Journal of Symbolic Logic, 57:1239-1273, 1992. [ bib ]
[149] Ulrich Kohlenbach and Laurentiu Leu~stean. Mann iterates of directionally nonexpansive mappings in hyperbolic spaces. Abstract and Applied Analysis, 8:449-477, 2003. [ bib ]
[150] Ulrich Kohlenbach and Laurentiu Leu~stean. Approximate fixed point property in product spaces (abstract), 2005. In Oberwolfach Report 14/2005, Mathematisches Forschungsinstitut Oberwolfach, Workshop Mathematical Logic: Proof Theory, Type Theory and Constructive Mathematics, March 20-26 2005, 795-797. [ bib ]
[151] Ulrich Kohlenbach and Lauren~tiu Leu~stean. Approximate fixed points of nonexpansive functions in product spaces. Nonlinear Analysis, 66:806-818, 2007. [ bib ]
[152] Ulrich Kohlenbach and Lauren~tiu Leu~stean. Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces. Journal of the European Mathematical Society, 2008. to appear. [ bib ]
[153] Ulrich Kohlenbach and Lauren~tiu Leu~stean. A quantitative mean ergodic theorem for uniformly convex banach spaces. Ergodic Theory and Dynamical Systems, 2008. to appear. [ bib ]
[154] Costel Barb~alata and Lauren~tiu Leu~stean. Applications of feed-forward neural networks to ecological phenomena forecasting. In Angela Ioni~t a, editor, Proceedings of ICTPA'2000, Bucharest, Romania, October 18-20, 2000. [ bib ]
[155] Costel Barb~alata and Lauren~tiu Leu~stean. Average monthly liquid flow forecasting using neural networks, 2004. draft. [ bib ]
[156] Antonio Di Nola, George Georgescu, and Lauren~tiu Leu~stean. Boolean products of bl-algebras. Journal of Mathematical Analysis and Applications, 251:106-131, 2000. [ bib ]
[157] Antonio Di Nola and Lauren~tiu Leu~stean. Compact representations of bl-algebras. Archive for Mathematical Logic, 42(8):737-761, 2003. [ bib ]
[158] Lauren~tiu Leu~stean. Some algebraic properties of non-commutative fuzzy structures. Studies in Informatics and Control, 9(4):365-370, 2000. [ bib ]
[159] Lauren~tiu Leu~stean. Liquid flow time series prediction using feed-forward neural networks and rprop learning algorithm. Studies in Informatics and Control, 10(4):287-299, 2001. [ bib ]
[160] Lauren~tiu Leu~stean. Canonical models and filtrations in three-valued propositional modal logic. Journal of Multiple-Valued Logic, 8(1-2):577-590, 2002. [ bib ]
[161] Lauren~tiu Leu~stean. Liquid flow time series prediction using feed-forward neural networks and supersab learning algorithm. Buletinul stiintific al Universitatii Politehnica din Timisoara, 47(61)(1):77-82, 2002. [ bib ]
[162] Lauren~tiu Leu~stean. The prime and maximal spectra and the reticulation of bl-algebras. Central European Journal of Mathematics, 1(3):382-397, 2003. [ bib ]
[163] Lauren~tiu Leu~stean. Representations of many-valued algebras, 2004. PhD Thesis, University of Bucharest. [ bib ]
[164] Lauren~tiu Leu~stean. Sheaf representations of bl-algebras. Soft Computing - A Fusion of Foundations, Methodologies and Applications, 9(12):897-909, 2005. [ bib ]
[165] Lauren~tiu Leu~stean. Proof mining in r-trees and hyperbolic spaces. Electronic Notes in Theoretical Computer Science, 165:95-106, 2006. in Proceedings of the 13th Workshop on Logic, Language, Information and Computation (WoLLIC'2006), Stanford, CA, USA, July 18-21, 2006. [ bib ]
[166] Lauren~tiu Leu~stean. Baer extensions of bl-algebras. Journal of Multiple-Valued Logic and Soft Computing (to appear), 2006. [ bib ]
[167] Lauren~tiu Leu~stean. A quadratic rate of asymptotic regularity in cat(0)-spaces. Journal of Mathematical Analysis and Applications, 325(1):386-399, 2007. [ bib ]
[168] Lauren~tiu Leu~stean. Rates of asymptotic regularity for halpern iterations of nonexpansive mappings. Journal of Universal Computer Science, 13(11):1680-1691, 2007. in C.S. Calude, G. Stefanescu, and M. Zimand (Eds.): Combinatorics and Related Areas. A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu. [ bib ]
[169] Lauren~tiu Leu~stean and Grigore Ro~su. Certifying kalman filters. Technical Report TR.03.02, Research Institute for Advanced Computer Science (RIACS), NASA Ames Research Center, NASA Ames Research Center, Moffet Field, California, USA, January 2003. [ bib ]
[170] Costin Pribeanu and Lauren~tiu Leu~stean. Consistence evaluation of a man-machine interaction language using connectionist models. Revista Româna de Informatica si Automatica, 10(3):40-45, 2000. [ bib ]
[171] Grigore Ro~su, Ram Prasad Venkatesan, Jon Whittle, and Lauren~tiu Leu~stean. Certifying optimality of state estimation programs. In Warren A. Hunt Jr. and Fabio Somenzi, editors, Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, volume 2725 of Lecture Notes in Computer Science, pages 301-314. Springer, 2003. [ bib ]
[172] Peter Burmeister. Galois connections for partial algebras. In K. Denecke, M. Erné, and S.L. Wismath, editors, Galois Connections and Applications, volume 565 of Mathematics and its Applications, pages 345 - 370. Kluwer, 2004. [ bib ]
[173] Peter Burmeister. Algebraic theory of quasivarieties of heterogeneous partial algebras. In M.E. Adams, K.V. Adaricheva, W. Dzobiak, and A.V. Kravchenko, editors, Special Issue of Studia Logica: “Algebraic Theory of Quasivarieties”, volume 78 of Studia Logica, pages 129 - 153. Kluver Academic Publishers, 2004. [ bib ]
[174] A. Blumensath and S. Kreutzer. An Extension to Muchnik's Theorem. Journal of Logic and Computation, 15:59-74, 2005. [ bib ]
[175] A. Blumensath and E. Grädel. Finite Presentations of Infinite Structures: Automata and Interpretations. Theory of Computing Systems, 37:641-674, 2004. [ bib ]
[176] A. Blumensath. Axiomatising tree-interpretable structures. Theory of Computing Systems, 37:3-27, 2004. [ bib ]
[177] A. Blumensath. Structures of Bounded Partition Width. Ph.D.Thesis, RWTH Aachen, Aachen, 2003. [ bib ]
[178] D. Berwanger and A. Blumensath. The Monadic Theory of Tree-like Structures. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logic, and Infinite Games, LNCS 2500, pages 285-301. Springer Verlag, 2002. [ bib ]
[179] D. Berwanger and A. Blumensath. Automata for Guarded Fixed Point Logics. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logic, and Infinite Games, LNCS 2500, pages 343-355. Springer Verlag, 2002. [ bib ]
[180] A. Blumensath and E. Grädel. Finite Presentations of Infinite Structures: Automata and Interpretations. In Proc.2nd Int.Workshop on Complexity in Automata Deduction, CiAD, 2002. [ bib ]
[181] A. Blumensath. Axiomatising Tree-Interpretable Structures. In Proc.19th Int.Symp.on Theoretical Aspects of Computer Science, STACS, LNCS 2285, pages 596-607, 2003. [ bib ]
[182] A. Blumensath. Prefix-Recognisable Graphs and Monadic Second-Order Logic. Technical Report AIB-2001-06, RWTH Aachen, 2001. [ bib ]
[183] A. Blumensath. Bounded Arithmetic and Descriptive Complexity. In Proc.14th Ann. Conference of the European Association for Computer Science Logic, LNCS 1862, pages 232-246, 2000. [ bib ]
[184] A. Blumensath and E. Grädel. Automatic Structures. In Proc.15th IEEE Symp.on Logic in Computer Science, LICS, pages 51-62, 2000. [ bib ]
[185] A. Blumensath. Automatic Structures. Diploma Thesis, RWTH Aachen, Aachen, 1999. [ bib ]
[186] A. Blumensath. A Model Theoretic Characterisation of Clique-Width. Annals of Pure and Applied Logic, 142:321-350, 2006. [ bib ]
[187] A. Blumensath and B. Courcelle. Recognizability, Hypergraph Operations, and Logical Types. Information and Computation, 204:853-919, 2006. [ bib ]
[188] Annika M. Wille. The variety of lattice-ordered monoids generated by the natural numbers. Studia Logica, 76(2):275-290, 2004. [ bib ]
[189] Annika M. Wille. A gentzen system for involutive residuated lattices. Algebra Universalis, 54(4):449-463, 2005. [ bib ]
[190] Eyvind Martol Briseid. A rate of convergence for asymptotic contractions. Journal of Mathematical Analysis and Applications, 330:364-376, 2007. [ bib ]
[191] Eyvind Martol Briseid. Addendum to the paper: Some results on Kirk's asymptotic contractions. Fixed Point Theory, 8(2):321-322, 2007. [ bib ]
[192] Eyvind Martol Briseid. Some results on Kirk's asymptotic contractions. Fixed Point Theory, 8(1):17-27, 2007. [ bib ]

This file has been generated by bibtex2html 1.85.