Export 300 results:
Jäger, G., Studer, T.: Extending the system $\mathsf{T}_0$ of explicit mathematics: the limit and Mahlo axioms. Annals of Pure and Applied Logic. 114, 79-101 (2002).
Keller, P.: Information Flow – Logics for the (R)age of Information. (2002).
Rüede, C., Strahm, T.: Intuitionistic fixed point theories for strictly positive operators. Mathematical Logic Quarterly. 48, 195-202 (2002).
Kretz, M.: On the Treatment of Predicative Polymorphism in Theories of Explicit Mathematics. (2002).
Ostrin, G.E., Wainer, S.S.: Proof theoretic complexity. In: Schwichtenberg, H. and Steinbrüggen, R. Proof and System Reliability. pp. 369-398. Springer (2002).
Alberucci, L.: Strictness of the modal $μ$-calculus hierarchy. In: Grädel, E., Thomas, W., and Wilke, T. Automata, Logics and infinite Games: A Guide to Current Research. pp. 185-201. Springer (2002).
Alberucci, L.: The Modal $μ$-Calculus and the Logic of Common Knowledge. (2002).
Jäger, G., Strahm, T.: The proof-theoretic analysis of the Suslin operator in applicative theories. In: Sieg, W., Sommer, R., and Talcott, C. Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. pp. 270-292. AK Peters (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).
Studer, T.: A semantics for $\lambda^{\{\}}_{\mathsf str}$: a calculus with overloading and late-binding. Journal of Logic and Computation. 11, 527-544 (2001).
Studer, T.: Constructive foundations for Featherweight Java. In: Kahle, R., Schroeder-Heister, P., and Stärk, R.F. Proceedings of the International Seminar on Proof Theory in Computer Science. pp. 202-238. Springer (2001).
Jäger, G.: First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo. The Journal of Symbolic Logic. 66, 1073-1089 (2001).
Kahle, R., Studer, T.: Formalizing non-termination of recursive programs. Journal of Logic and Algebraic Programming. 49, 1-14 (2001).
Probst, D., Studer, T.: How to normalize the Jay. Theoretical Computer Science. 254, 677-681 (2001).
Studer, T.: Object-Oriented Programming in Explicit Mathematics: Towards the Mathematics of Objects. (2001).
Strahm, T.: Proof-theoretic contributions to explicit mathematics. (2001).
Steiner, D.: Proof-Theoretic Strength of $\mathsf{PRON}$ with Various Extensions. (2001).
Tupailo, S.: Realization of analysis into explicit mathematics. The Journal of Symbolic Logic. 66, 1848-1864 (2001).
Balsiger, P.: The MacLWB and the Logic of Likelihood. (2001).
Heissenbüttel, M.: Theories of Ordinal Strength $\varphi 2 0$ and $\varphi 2 \varepsilon_0$. (2001).