Publications

Export 296 results:
Filters: Pubitems is alb08  [Clear All Filters]
In Press
Steila, S.: A combinatorial bound for a restricted form of the Termination Theorem. In: Schuster, P., Seisenberger, M., and Weiermann, A. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Springer (In Press).
Jäger, G., Steila, S.: About some fixed point axioms and related principles in Kripke-Platek environments. The Journal of Symbolic Logic. (In Press).
2018
Oliva, P., Steila, S.: A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. The Journal of Symbolic Logic. 1-14 (2018).
Brünnler, K., Flumini, D., Studer, T.: A Logic of Blockchain Updates. In: Artemov, S. and Nerode, A. Logical Foundations of Computer Science. pp. 107-119. Springer International Publishing, Cham (2018).
Jäger, G.: The Operational Penumbra: Some Ontological Aspects. Feferman on Foundations - Logic, Mathematics, Philosophy. Springer International Publishing (2018).
Marti, M., Studer, T.: The Proof Theory of Common Knowledge. In: van Ditmarsch, H. and Sandu, G. Jaakko Hintikka on knowledge and game theoretical semantics. Springer (2018).
Frittaion, E., Pelupessy, F., Steila, S., Yokoyama, K.: The strength of SCT soundness. Journal of Logic and Computation. (2018).
Strahm, T.: Unfolding schematic systems. In: Jäger, G. and Sieg, W. Feferman on Foundations - Logic, Mathematics, Philosophy. Springer (2018).
2017
Savić, N., Doder, D., Ognjanović, Z.: A First-Order Logic for Reasoning About Higher-Order Upper and Lower Probabilities. In: Antonucci, A., Cholvy, L., and Papini, O. Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 14th European Conference, ECSQARU 2017, Lugano, Switzerland, July 10–14, 2017, Proceedings. pp. 491-500. Springer International Publishing, Cham (2017).
Probst, D.: A modular ordinal analysis of metapredicative subsystems of second order arithmetic. (2017).
Marti, M.: Contributions to Intuitionistic Epistemic Logic. (2017).
Marti, M., Metcalfe, G.: Expressivity in Chain-Based Modal Logics. Archive for Mathematical Logic. 57, 361-380 (2017).
Jäger, G., Sieg, W.: Feferman on Foundations: Logic, Mathematics, Philosophy. Springer International Publishing (2017).
Audrito, G., Steila, S.: Generic Large Cardinals and Systems of Filters. The Journal of Symbolic Logic. 82, 860-892 (2017).
Ognjanović, Z., Savić, N., Studer, T.: Justification Logic with approximate conditional probabilities. (2017).
Savić, N., Doder, D., Ognjanović, Z.: Logics with lower and upper probability operators. International Journal of Approximate Reasoning. 88, 148-168 (2017).
Berardi, S., Steila, S.: Ramsey's Theorem for Pairs and k Colors as a Sub-Classical Principle of Arithmetic. Journal of Symbolic Logic. 82, 737-753 (2017).
Bucheli, S., Ghari, M., Studer, T.: Temporal Justification Logic. In: Ghosh, S. and Ramanujam, R. Proceedings of the Ninth Workshop on Methods for Modalities, Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017. pp. 59-74. Open Publishing Association (2017).
Frittaion, E., Steila, S., Yokoyama, K.: The Strength of the SCT Criterion. In: Gopal, T.V., Jäger, G., and Steila, S. Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. pp. 260-273 (2017).
Gopal, T.V., Jäger, G., Steila, S.: Theory and Applications of Models of Computation TAMC 2017. Springer International Publishing, Cham (2017).

Pages