Publications

Export 291 results:
1999
Studer, T.: A semantics for $\lambda^{ \{ \} }_{ \mathsf {str }}$: a calculus with overloading and late-binding. (1999).
Jäger, G., Strahm, T.: Bar induction and $\omega$ model reflection. Annals of Pure and Applied Logic. 97, 221-230 (1999).
Wirz, M.: Characterizing the Grzegorczyk hierarchy by safe recursion. (1999).
Wirz, M.: Charakterisierungen kleiner Komplexitätsklassen mittels geschichteter N-Prädikate. (1999).
Probst, D.: Dependent Choice in Explicit Mathematics. (1999).
Mints, G., Tupailo, S.: Epsilon-substitution method for the ramified language and $Δ^1_1$-comprehension rule. In: Cantini, A., Casari, E., and Minari, P. Logic and Foundation of Mathematics. pp. 107-130. Kluwer (1999).
Bucher, I.: Extension of the Modal System KT4. (1999).
Strahm, T.: First steps into metapredicativity in explicit mathematics. In: Cooper, B.S. and Truss, J.K. Sets and Proofs. pp. 383-402. Cambridge University Press (1999).
Brignioni, J.: Konstruktion von Gegenmodellen intuitionistisch unbeweisbarer Sequenzen. (1999).
Boroumand, A.D.: Logics Workbench für Window System. (1999).
Jäger, G., Kahle, R., Strahm, T.: On applicative theories. In: Cantini, A., Casari, E., and Minari, P. Logic and Foundations of Mathematics. pp. 83-92. Kluwer (1999).
Jäger, G., Kahle, R., Setzer, A., Strahm, T.: The proof-theoretic analysis of transfinitely iterated fixed point theories. The Journal of Symbolic Logic. 64, 53-67 (1999).
1998
Schwendimann, S.: A new one-pass tableau calculus for $\mathsf{PLTL}$. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 277-292. Springer (1998).
Jäger, G., Stärk, R.F.: A proof-theoretic framework for logic programming. In: Buss, S.S. Handbook of Proof Theory. pp. 639-682. North-Holland (1998).
Schwendimann, S.: Aspects of Computational Logic. (1998).
Balsiger, P., Heuerding, A.: Comparison of Theorem Provers for Modal Logics – Introduction and Summary. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 25-26. Springer (1998).
Kahle, R.: Frege structures for partial applicative theories. Journal of Logic and Computation. 8, 683-700 (1998).
Balsiger, P., Heuerding, A.: Logics Workbench 1.0. In: de Swart, H.C.M. Proceedings of Tableaux '98. pp. 35-37. Springer (1998).
Schlingloff, H., Heinle, W.: Relation Algebra and Modal Logics. In: Brink, C., Kahl, W., and Schmidt, G. Relational Methods in Computer Science. pp. 20-89. Springer (1998).
Heuerding, A.: Sequent Calculi for Proof Search in some Modal Logics. (1998).
Marzetta, M., Strahm, T.: The $μ$ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. Archive for Mathematical Logic. 37, 391-413 (1998).

Pages