Export 300 results:
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).
Steila, S.: Some algebraic equivalent forms of R ⊆ L. Fundamenta Mathematicae. (In Press).
Doder, D., Savić, N., Ognjanović, Z.: A Decidable Multi-agent Logic with Iterations of Upper and Lower Probability Operators. Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings. pp. 170–185 (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., Steila, S.: About some fixed point axioms and related principles in Kripke-Platek environments. The Journal of Symbolic Logic. 83, 642-668 (2018).
Ghilezan, S., Ivetic, J., Kasterovic, S., Ognjanović, Z., Savić, N.: Probabilistic Reasoning About Simply Typed Lambda Terms. Logical Foundations of Computer Science - International Symposium, {LFCS} 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings. pp. 170–189 (2018).
Rosebrock, T.: Some Models and Semi-decidability Notions of Applicative Theories. (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).
Jäger, G., Rosebrock, T., Sato, K.: Truncation and Semi-Decidability Notions in Applicative Theories. The Journal of Symbolic Logic. 83, 967-990 (2018).
Strahm, T.: Unfolding schematic systems. In: Jäger, G. and Sieg, W. Feferman on Foundations - Logic, Mathematics, Philosophy. Springer (2018).
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).