Structure vs. Invariants in Proofs (StrIP)

Filter
Conference contribution

Search results

  • 2024

    Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics

    Das, A., van der Giessen, I. & Marin, S., 7 Feb 2024, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Murano, A. & Silva, A. (eds.). Schloss Dagstuhl, p. 22:1-22:18 18 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 288).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    72 Downloads (Pure)
  • 2023

    Computational expressivity of (circular) proofs with fixed points

    Curzi, G. & Das, A., 14 Jul 2023, 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Institute of Electrical and Electronics Engineers (IEEE), 13 p. 10175772. (Proceedings - Symposium on Logic in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Cyclic Proofs for Arithmetical Inductive Definitions

    Das, A. & Melgaard, L., 28 Jun 2023, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023). Gaboardi, M. & van Raamsdonk, F. (eds.). Schloss Dagstuhl, 18 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 260).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    25 Downloads (Pure)
  • Non-Uniform Complexity via Non-Wellfounded Proofs

    Curzi, G. & Das, A., 1 Feb 2023, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Klin, B. & Pimentel, E. (eds.). Schloss Dagstuhl, 18 p. 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 252).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    18 Downloads (Pure)
  • 2022

    Cyclic Implicit Complexity

    Curzi, G. & Das, A., 4 Aug 2022, LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Baier, C. (ed.). Association for Computing Machinery (ACM), 13 p. 19. (LICS: Logic in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Cyclic Proofs, Hypersequents, and Transitive Closure Logic

    Das, A. & Girlando, M., 17 Jul 2022, Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022, Proceedings. Blanchette, J., Kovács, L. & Pattinson, D. (eds.). 1 ed. Springer, p. 509-528 20 p. (Lecture Notes in Computer Science; vol. 13385).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    2 Citations (Scopus)
    11 Downloads (Pure)
  • Decision Problems for Linear Logic with Least and Greatest Fixed Points

    Das, A., De, A. & Saurin, A., 28 Jun 2022, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Felty, A. P. (ed.). Schloss Dagstuhl, 20 p. 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 228).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    1 Citation (Scopus)
    11 Downloads (Pure)
  • Proof Complexity of Monotone Branching Programs

    Das, A. & Delkos, A., 26 Jun 2022, Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings. Berger, U., Franklin, J. N. Y., Manea, F. & Pauly, A. (eds.). 1 ed. Springer, p. 74-87 14 p. (Lecture Notes in Computer Science; vol. 13359).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution