Publications

Export 122 results:
Filters: Type is Journal Article  [Clear All Filters]
2005
Studer, T.: Explicit mathematics: power types and overloading. Annals of Pure and Applied Logic. 134, 284-302 (2005).
Probst, D.: On the relationship between fixed points and iteration in admissible set theory without foundation. Archive for Mathematical Logic. 44, 561-580 (2005).
: Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136, 116-133 (2005).
2004
Strahm, T.: A proof-theoretic characterization of the basic feasible functionals. Theoretical Computer Science. 329, 159-176 (2004).
Jäger, G.: An intensional fixed point theory over first order arithmetic. Annals of Pure and Applied Logic. 128, 197-213 (2004).
: On modal $μ$-calculus and non-well-founded set theory. Journal of Philosophical Logic. 33, 343-360 (2004).
: Variation on a theme of Schütte. Mathematical Logic Quarterly. 50, 258-264 (2004).
2003
Tupailo, S.: Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic. 120, 165-196 (2003).
Rüede, C.: The proof-theoretic analysis of $Σ^1_1$ transfinite dependent choice. Annals of Pure and Applied Logic. 122, 195-234 (2003).
Strahm, T.: Theories with self-application and computational complexity. Information and Computation. 185, 263-297 (2003).
Rüede, C.: Universes in metapredicative analysis. Archive for Mathematical Logic. 42, 129-151 (2003).
2002
: Extending the system $\mathsf{T}_0$ of explicit mathematics: the limit and Mahlo axioms. Annals of Pure and Applied Logic. 114, 79-101 (2002).
: Intuitionistic fixed point theories for strictly positive operators. Mathematical Logic Quarterly. 48, 195-202 (2002).
Rüede, C.: Transfinite dependent choice and $\omega$-model reflection. The Journal of Symbolic Logic. 67, 1153-1168 (2002).
Strahm, T.: Wellordering proofs for metapredicative Mahlo. The Journal of Symbolic Logic. 67, 260-278 (2002).
2001
Studer, T.: A semantics for $\lambda^{\{\}}_{\mathsf str}$: a calculus with overloading and late-binding. Journal of Logic and Computation. 11, 527-544 (2001).
Jäger, G.: First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo. The Journal of Symbolic Logic. 66, 1073-1089 (2001).
: Formalizing non-termination of recursive programs. Journal of Logic and Algebraic Programming. 49, 1-14 (2001).
: How to normalize the Jay. Theoretical Computer Science. 254, 677-681 (2001).
Tupailo, S.: Realization of analysis into explicit mathematics. The Journal of Symbolic Logic. 66, 1848-1864 (2001).
: Universes in explicit mathematics. Annals of Pure and Applied Logic. 109, 141-162 (2001).
: Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. The Journal of Symbolic Logic. 66, 935-958 (2001).
2000
: A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning. 24, 297-317 (2000).
: Fixed point theories and dependent choice. Archive for Mathematical Logic. 39, 493-508 (2000).
Kahle, R.: N-strictness in applicative theories. Archive for Mathematical Logic. 39, 125-144 (2000).