Ekaterina Piotrovskaya

dblp:382/6810 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0009-4217-6948ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2025 A Sequent Calculus Perspective on Base-Extension Semantics
abstract
Abstract We define base-extension semantics ( $$\textsf{BeS}$$ BeS ) using atomic systems based on sequent calculus rather than natural deduction. While traditional $$\textsf{BeS}$$ BeS aligns naturally with intuitionistic logic due to its constructive foundations, we show that sequent calculi with multiple conclusions yield a $$\textsf{BeS}$$ 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.
Victor Barroso-Nascimento, Ekaterina Piotrovskaya, Elaine Pimentel
TABLEAUX2
2024 Learning Closed Signal Flow Graphs
Ekaterina Piotrovskaya, Leo Lobski, Fabio Zanasi
ICTAC1