3 papers
cs.CC2026
Prover-Adversary games for systems over (non-deterministic) branching programs
Anupam Das, Avgerinos Delkos
We introduce Pudlak-Buss style Prover-Adversary games to characterise proof systems reasoning over deterministic branching programs (BPs) and non-deterministic branching programs (…
cs.CC2025
Proof complexity of positive branching programs
Anupam Das, Avgerinos Delkos
We investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes,…
cs.LO2025
A significance-based account of ceteris paribus counterfactuals
Avgerinos Delkos, Marianna Girlando
When evaluating a counterfactual statement, it is often convenient to specify conditions that ought to be kept unchanged. Formally, this can be done by associating to each counterf…