Gianluca Curzi |  Anupam Das -  《2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science: LICS 2023, Boston, Massachusetts, USA, 26-29 June 2023, [v.1]》 -  Annual ACM/IEEE Symposium on Logic in Computer Science - 2023, - 1～13 - 共13页

摘要：We study the computational expressivity of proof systems with fixed point operators, within the ‘proofs-as-programs’ paradigm. We start with a calculus μLJ (due to Clairambault) that extends intuition...

关键词： Computer science |  Upper bound |  Computational modeling |  Calculus |  Mathematical models |  Standards |  Arithmetic

Alessandro Aldini |  Gianluca Curzi... -  《Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th European Conference, ECSQARU 2021, Prague, Czech Republic, September 21-24, 2021, Proceedings》 -  European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 2021, - 575～589 - 共15页

摘要：We investigate the application of a modal language a la Hennessy-Milner to the specific domain of evidence-based trust estimations. In particular, we refer to a context-aware notion of computational t...

关键词： Probabilistic modal logic |  Trust |  Completeness

NSTL主题词： Formal logic |  Nonprofit Organizations |  trust logics |  trust |  Trust

Matteo Acclavio |  Gianluca Curzi... -  《Contaduría y Administración》 - 2024,288(Feb) - 1～19 - 共19页

摘要：We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data...

关键词： cut-elimination |  non-wellfounded proofs |  parsimonious logic |  linear logic |  proof theory |  approximation |  sequent calculus |  non-uniform proofs