Publications

Export 300 results:
2000
Balsiger, P., Heuerding, A., Schwendimann, S.: A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning. 24, 297-317 (2000).
Kahle, R., Studer, T.: A theory of explicit mathematics equivalent to ${ \mathsf{ID} }_1$. In: Clote, P. and Schwichtenberg, H. Proceedings of Computer Science Logic. pp. 356-370. Springer (2000).
Strahm, T.: Autonomous fixed point progressions and fixed point transfinite recursion. In: Buss, S.S., Hajek, P., and Pudlak, P. Proceedings of Logic Colloquium '98. pp. 449-464. AK Peters (2000).
Krebs, M.: Einige Aspekte der Modallogik $\mathsf{S5}_n$ mit Allgemeinwissen. (2000).
Tupailo, S.: Finitary reductions for local predicativity, I: recursively regular ordinals. In: Buss, S.S., Hajek, P., and Pudlak, P. Proceedings of Logic Colloquium '98. pp. 465-499. AK Peters (2000).
Jäger, G., Strahm, T.: Fixed point theories and dependent choice. Archive for Mathematical Logic. 39, 493-508 (2000).
Rüede, C.: Metapredicative Subsystems of Analysis. (2000).
Kahle, R.: N-strictness in applicative theories. Archive for Mathematical Logic. 39, 125-144 (2000).
Strahm, T.: The non-constructive $μ$-operator, fixed point theories with ordinals, and the bar rule. Annals of Pure and Applied Logic. 104, 305-324 (2000).
Feferman, S., Strahm, T.: The unfolding of non-finitist arithmetic. Annals of Pure and Applied Logic. 104, 75-96 (2000).
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).

Pages