Ekaterina Piotrovskaya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ekaterina Piotrovskaya has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Elaine Pimentel
Department of Computer Science, University College London, London, UK
2 shared publications - Victor Barroso-Nascimento
University College London
2 shared publications - Fabio Zanasi
University College London, United Kingdom
1 shared publication - Leo Lobski
University College London
1 shared publication
Latest Publications
- Open Access
- 20 December 2025
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Electronic Notes in Theoretical Informatics and Computer Science
- Vol. ume 5 - Pr
A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of all contexts that can be used to prove it (e.g. phase semantics) or by assigning meaning directly to proofs (e.g. coherence spaces). This work proposes a different perspective on assigning meaning to proofs by adopting a proof-theoretic perspective. More specifically, we employ base-extension semantics (BeS) to characterise proofs through the notion of base support. Recent developments have shown that BeS is powerful enough to capture proof-theoretic notions in structurally rich logics such as intuitionistic linear logic. In this paper, we extend this framework to the classical case, presenting a proof-theoretic approach to the semantics of the multiplicative-additive fragment of linear logic (MALL). Technical Report
- 20 December 2025
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Electronic Notes in Theoretical Informatics and Computer Science
- Vol. ume 5 - Pr
Open AccessA Proof-Theoretic Approach to the Semantics of Classical Linear Logic
Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of all contexts that can be used to prove it (e.g. phase semantics) or by assigning meaning directly to proofs (e.g. coherence spaces). This work proposes a different perspective on assigning meaning to proofs by adopting a proof-theoretic perspective. More specifically, we employ base-extension semantics (BeS) to characterise proofs through the notion of base support. Recent developments have shown that BeS is powerful enough to capture proof-theoretic notions in structurally rich logics such as intuitionistic linear logic. In this paper, we extend this framework to the classical case, presenting a proof-theoretic approach to the semantics of the multiplicative-additive fragment of linear logic (MALL). Technical Report
- Open Access
- 25 September 2025
- Published by Springer Nature
- p. 3-21
A Sequent Calculus Perspective on Base-Extension Semantics
We define base-extension semantics ( $$\textsf{BeS}$$ ) using atomic systems based on sequent calculus rather than natural deduction. While traditional $$\textsf{BeS}$$ aligns naturally with intuitionistic logic due to its constructive foundations, we show that sequent calculi with multiple conclusions yield a $$\textsf{BeS}$$ framework more suited to classical semantics. The harmony in classical sequents leads to straightforward semantic clauses derived solely from right introduction rules. This framework enables a Sandqvist-style completeness proof that extracts a sequent calculus proof from any valid semantic consequence. Moreover, we show that the inclusion or omission of atomic cut rules meaningfully affects the semantics, yet completeness holds in both cases.- 25 September 2025
- Published by Springer Nature
- p. 3-21
Open AccessA Sequent Calculus Perspective on Base-Extension Semantics
We define base-extension semantics ( $$\textsf{BeS}$$ ) using atomic systems based on sequent calculus rather than natural deduction. While traditional $$\textsf{BeS}$$ aligns naturally with intuitionistic logic due to its constructive foundations, we show that sequent calculi with multiple conclusions yield a $$\textsf{BeS}$$ framework more suited to classical semantics. The harmony in classical sequents leads to straightforward semantic clauses derived solely from right introduction rules. This framework enables a Sandqvist-style completeness proof that extracts a sequent calculus proof from any valid semantic consequence. Moreover, we show that the inclusion or omission of atomic cut rules meaningfully affects the semantics, yet completeness holds in both cases. - 22 November 2024
- Published by Springer Nature
- p. 78-95
Learning Closed Signal Flow Graphs