Publications

Export 120 results:

Filters: Type is Journal Article [Clear All Filters]

Submitted

Ranzi, F., Strahm, T.: A flexible type system for the small Veblen ordinal. (Submitted).

Jäger, G., Steila, S.: About some fixed point axioms and related principles in Kripke-Platek environments. (Submitted).

Jäger, G., Rosebrock, T., Sato, K.: Truncation and Semi-Decidability Notions in Applicative Theories. (Submitted).

In Press

Oliva, P., Steila, S.: A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. Journal of Symbolic Logic. (In Press).

Marti, M., Metcalfe, G.: Expressivity in Chain-Based Modal Logics. Archive for Mathematical Logic. (In Press).

Audrito, G., Steila, S.: Generic Large Cardinals and Systems of Filters. Journal of Symbolic Logic. (In Press).

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).

2016

Jäger, G., Marti, M.: Intuitionistic common knowledge or belief. Journal of Applied Logic. 18, (2016).

Marti, M., Studer, T.: Intuitionistic modal logic made explicit. IfCoLog Journal of Logics and their Applications. 3, 877-901 (2016).

Jäger, G.: Relativizing operational set theory. The Bulletin of Symbolic Logic. 22, 332-352 (2016).

Steila, S., Yokoyama, K.: Reverse mathematical bounds for the Termination Theorem. Annals of Pure and Applied Logic. (2016).

Kuznets, R., Studer, T.: Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL. 24, 424-440 (2016).

2015

Sato, K., Zumbrunnen, R.: A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is $\Pi$1-equivalent to KP. Annals of pure and applied logic. 166, 121-186 (2015).

Sato, K.: A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T0. Annals of pure and applied logic. 166, 800-835 (2015).

Eberhard, S.: Applicative theories for logarithmic complexity classes. Theoretical Computer Science. 585, 115-135 (2015).

Kokkinis, I., Maksimović, P., Ognjanović, Z., Studer, T.: First steps towards probabilistic justification logic. Logic Journal of IGPL. 23, 662-687 (2015).

Sato, K.: Full and hat inductive definitions are equivalent in NBG. Archive for Mathematical Logic. 54, 75-112 (2015).

Fitting, M., Kuznets, R.: Modal interpolation via nested sequents. Annals of pure and applied logic. 166, 274-305 (2015).

2014

Eberhard, S.: A feasible theory of truth over combinatory algebra. Annals of Pure and Applied Logic. 165, 1009-1033 (2014).

Ranzi, F., Strahm, T.: A note on the theory $\mathsf{SID}_{{<}\omega}$ of stratified induction. Mathematical Logic Quarterly. 60, 487-497 (2014).

Studer, T., Werner, J.: Censors for Boolean Description Logic. Transactions on Data Privacy. 7, 223-252 (2014).

Jäger, G., Zumbrunnen, R.: Explicit mathematics and operational set theory: some ontological comparisons. The Bulletin of Symbolic Logic. 20, 275-292 (2014).

Sato, K.: Forcing for Hat Inductive Definitions in Arithmetic – One of the Simplest Applications of Forcing –. Mathematical Logic Quarterly. 60, 314-318 (2014).

Flumini, D., Sato, K.: From hierarchies to well-foundedness. Archive for Mathematical Logic. 53, (2014).

Pages