Accepted Submissions
Accepted Contributed Talks USWPT 2022
We are glad to let you know that the accepted contributed talks are determined. Please find them below and contact us if you have any questions.
| Name | Title |
| Juan Pablo Aguilera, Joost Joosten, José Martínez Fernández and Fedor Pakhomov | Challenges to Instrumentalism |
| Alexandra Pavlova | Provability games for Modal Logics |
| Gianluca Curzi and Anupam Das | Non-uniform complexity via non-wellfounded proofs |
| Giovanni Solda | On the uniform strength of some additive Ramseyan principles |
| Philipp Provenzano | The reverse mathematical strength of hyperations |
| Anupam Das and Avgerinos Delkos | Proof complexity of (nondeterministic) branching programs via games |
| Masaya Taniguchi | Decidable Parsing Algorithm for Categorial Grammar with Type-raising |
| Juan Aguilera and Fedor Pakhomov | Proof theory of Pi^1_2-unsound theories |
| Jan Rooduijn | A cyclic proof system for Guarded Kleene Algebra with tests |
| Cosimo Perini Brogi | Results and ideas on proof theory for interpretability logics |
| Matteo Acclavio and Lutz Straßburger | On Proof Equivalence via Combinatorial Proofs |
| Fabio De Martin Polo | Reduced Routley-Meyer models and labelled sequent calculi for relevant logics. |
| Anupam Das and Lukas Melgaard | A cyclic system for arithmetical inductive definitions |
| Amirhossein Akbar Tabatabai and Raheleh Jalali | Universal Proof Theory: Constructive Rules and Feasible Admissibility |
| Juan Miguel Lopez Munive | A Defense of Proof-Theoretic Logical Pluralism |
| Iris van der Giessen, Herman Geuvers and Tonny Hurkens | Natural deduction derived from truth tables |
| Anupam Das and Marianna Girlando | Intuitionistic versions of modal fixed point logics |
| David Cerna, Anela Lolic and Alexander Leitsch | PANDAFOREST: Proof analysis AND Automated deduction FOr REcursive STructures (Project Announcement) |
| Will Stafford | Proof-Theoretic Validity and Intuitionistic Logic |
| Paulo Guilherme Santos, Isabel Oitavem and Reinhard Kahle | ‘Provability Implies Provable Provability’ in FLINSPACE |
| Morenikeji Neri and Thomas Powell | A computational study of a class of recursive inequalities |
| Arnold Beckmann, Sam Buss and Anupam Das | Towards higher order proof complexity |
| Antonio Piccolomini d’Aragona | The proof-theoretic square |
| Anela Lolic and Matthias Baaz | First-Order Interpolation Derived from Propositional Interpolation |
| Takahiro Yamada | A reconstruction of Crispin Wright’s strict finitistic logic: With the existence predicate |
| Johannes Kloibhofer, Johannes Marti and Yde Venema | A new proof system for the modal µ-calculus inspired by determinisation of automata |
| Sofía Santiago Fernández, María José Hidalgo Doblado and José Antonio Alonso Jiménez | Propositional Model Existence theorem’s formalisation in Isabelle/HOL |
| Agata Tomczyk | Sequent Calculi for Two non-Fregean Theories |
| Masanobu Toyooka | A Tree-Sequent Method for Intermediate Predicate Logic CD Expanded with Empirical Negation |
| Marianela Morales and Lutz Strassburger | Looking inside the modalities: subatomic proof theory for modal logics |
| Fedor Pakhomov and Juan Aguilera | Π¹₂ proof-theoretic analysis of well-ordering principles |