Publications
Export 123 results:
Filters: Type is Journal Article [Clear All Filters]
A flexible type system for the small Veblen ordinal. (Submitted).
: : Some algebraic equivalent forms of R ⊆ L. Fundamenta Mathematicae. (In Press).
: A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. The Journal of Symbolic Logic. 1-14 (2018).
: About some fixed point axioms and related principles in Kripke-Platek environments. The Journal of Symbolic Logic. 83, 642-668 (2018).
: The strength of SCT soundness. Journal of Logic and Computation. (2018).
: Truncation and Semi-Decidability Notions in Applicative Theories. The Journal of Symbolic Logic. 83, 967-990 (2018).
: Expressivity in Chain-Based Modal Logics. Archive for Mathematical Logic. 57, 361-380 (2017).
: Generic Large Cardinals and Systems of Filters. The Journal of Symbolic Logic. 82, 860-892 (2017).
: Logics with lower and upper probability operators. International Journal of Approximate Reasoning. 88, 148-168 (2017).
: Ramsey's Theorem for Pairs and k Colors as a Sub-Classical Principle of Arithmetic. Journal of Symbolic Logic. 82, 737-753 (2017).
: Intuitionistic common knowledge or belief. Journal of Applied Logic. 18, (2016).
: Intuitionistic modal logic made explicit. IfCoLog Journal of Logics and their Applications. 3, 877-901 (2016).
: Relativizing operational set theory. The Bulletin of Symbolic Logic. 22, 332-352 (2016).
: Reverse mathematical bounds for the Termination Theorem. Annals of Pure and Applied Logic. (2016).
: Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL. 24, 424-440 (2016).
: 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).
: 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).
: Applicative theories for logarithmic complexity classes. Theoretical Computer Science. 585, 115-135 (2015).
: First steps towards probabilistic justification logic. Logic Journal of IGPL. 23, 662-687 (2015).
: Full and hat inductive definitions are equivalent in NBG. Archive for Mathematical Logic. 54, 75-112 (2015).
: Modal interpolation via nested sequents. Annals of pure and applied logic. 166, 274-305 (2015).
: A feasible theory of truth over combinatory algebra. Annals of Pure and Applied Logic. 165, 1009-1033 (2014).
: A note on the theory $\mathsf{SID}_{{<}\omega}$ of stratified induction. Mathematical Logic Quarterly. 60, 487-497 (2014).
: Censors for Boolean Description Logic. Transactions on Data Privacy. 7, 223-252 (2014).
: