Export 291 results:
Probst, D.: On the relationship between fixed points and iteration in admissible set theory without foundation. Archive for Mathematical Logic. 44, 561-580 (2005).
Brünnler, K., Lengrand, S.: On two forms of bureaucracy in derivations. In: Bruscoli, P., Lamarche, F., and Stewart, C. Proceedings of Structures and Deduction. pp. 65-74. Technische Universität Dresden (2005).
Studer, T.: Papers in Explicit Mathematics. (2005).
Dürig, M., Studer, T.: Probabilistic ABox reasoning: preliminary results. In: Horrocks, I., Sattler, U., and Wolter, F. Proceedings of Description Logics '05. pp. 104-111. (2005).
Stoffel, K., Studer, T.: Provable data privacy. In: Andersen, K.V., Debenham, J.K., and Wagner, R. Proceedings of 16th International Conference on Database and Expert Systems Applications. pp. 324-332. Springer (2005).
Probst, D.: Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics. (2005).
Jäger, G., Strahm, T.: Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136, 116-133 (2005).
Studer, T.: Relational representation of $\mathcal{ALN}$ knowledge bases. In: Isaías, P., Nunes, M.B., and dos Reis, A.P. Proceedings of Multi '05. pp. 271-278. International Association for Development of the Information Society (2005).
Wirz, M.: Wellordering Two Sorts: A Slow-Growing Proof Theory for Variable Separation. (2005).