[et_pb_section fb_built=”1″ next_background_color=”#ffffff” _builder_version=”4.4.6″ background_color=”#8c8c8c” top_divider_color=”#b53319″ bottom_divider_style=”arrow3″ da_is_popup=”off” da_exit_intent=”off” da_has_close=”on” da_alt_close=”off” da_dark_close=”off” da_not_modal=”on” da_is_singular=”off” da_with_loader=”off” da_has_shadow=”on” da_disable_devices=”off|off|off”][et_pb_row _builder_version=”4.4.6″ custom_margin=”-26px|auto||auto||”][et_pb_column type=”4_4″ _builder_version=”4.4.6″][et_pb_text _builder_version=”4.4.6″]<\/p>\n
[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.4.6″ da_is_popup=”off” da_exit_intent=”off” da_has_close=”on” da_alt_close=”off” da_dark_close=”off” da_not_modal=”on” da_is_singular=”off” da_with_loader=”off” da_has_shadow=”on” da_disable_devices=”off|off|off”][et_pb_row _builder_version=”4.4.6″ width=”80.7%”][et_pb_column type=”4_4″ _builder_version=”4.4.6″][et_pb_text _builder_version=”4.4.6″]<\/p>\n
Fusible numbers and Peano Arithmetic –<\/strong>\u00a0<\/span>Jeff Erickson<\/a>,\u00a0<\/span>Gabriel Nivasch<\/a>\u00a0and Junyan Xu.<\/span><\/p>\n Asynchronous Template Games –<\/strong> Paul-Andr\u00e9 Melli\u00e8s<\/a><\/p>\n First-Order Reasoning and Efficient Semi-Algebraic Proofs<\/strong> – Fedor Part,\u00a0Neil Thapen<\/a>\u00a0and\u00a0Iddo Tzameret<\/a>.<\/p>\n PTAS for Sparse General-Valued CSPs<\/strong> –<\/strong> BalCizs F. Mezei,\u00a0Marcin Wrochna<\/a>\u00a0and\u00a0Stanislav\u00a0\u017divn\u00fd<\/a><\/a>.<\/p>\n Higher lenses –<\/strong> Paolo Capriotti,\u00a0Nils Anders Danielsson<\/a>\u00a0and Andrea Vezzosi.<\/p>\n Forbidden Induced Subgraphs and the Los-Tarski Theorem –\u00a0<\/strong>Yijia Chen<\/a>\u00a0and\u00a0J\u00f6rg\u00a0<\/span><\/span>Flum<\/a><\/p>\n Positive first-order logic on words –<\/strong>\u00a0Denis Kuperberg<\/a>.<\/p>\n Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory<\/strong> – Titouan Carette,\u00a0Simon Perdrix<\/a>\u00a0and Marc De Visme.<\/p>\n A Constructive Logic with Classical Proofs and Refutations –<\/strong>\u00a0Pablo Barenbaum<\/a>\u00a0and\u00a0Teodoro Freund<\/a>.<\/p>\n The smash product of monoidal theories –<\/strong>\u00a0Amar Hadzihasanovic<\/a>.<\/p>\n Jade Master and Michael Shulman.\u00a0Categories of Nets –<\/strong> John Baez,\u00a0Fabrizio Romano Genovese.<\/a><\/p>\n LovaLsz-type Theorems and Game Comonads –<\/strong>\u00a0Anuj Dawar<\/a>,\u00a0Tom\u00e1\u0161\u00a0Jakl\u00a0<\/a>and\u00a0Luca Reggio<\/a>.<\/p>\n Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments –<\/strong>\u00a0Jean Christoph Jung<\/a>\u00a0and\u00a0Frank Wolter<\/a>.<\/p>\n Inapproximability of Unique Games in Fixed-Point Logic with Counting –<\/strong>\u00a0Jamie Tucker-Foltz<\/a>.<\/p>\n Internal b\b\u2011-Categorical Models of Dependent Type Theory: Towards 2LTT Eating HoTT –<\/strong>\u00a0Nicolai Kraus<\/a>.<\/p>\n From Multisets over Distributions to Distributions over Multisets –<\/strong>\u00a0Bart Jacobs<\/a>.<\/p>\n Combinatorial Proofs and Decomposition Theorems for First-order Logic –\u00a0<\/strong>Dominic Hughes<\/a>,\u00a0Lutz Stra\u00dfburger<\/a>\u00a0and Jui-Hsuan Wu.<\/p>\n The Undecidability of System F Typability and Type Checking for Reductionists –<\/strong>\u00a0Andrej Dudenhefner<\/a>.<\/p>\n The Topological Mu-Calculus: completeness and decidability –<\/strong> Alexandru Baltag, Nick Bezhanishvili and David FernCindez-Duque.<\/p>\n Universal Semantics for the Stochastic Lambda-Calculus –\u00a0<\/strong>Pedro H Azevedo de Amorim<\/a>,\u00a0Dexter Kozen<\/a>,\u00a0Radu Mardare<\/a>,\u00a0Prakash Panangaden<\/a>\u00a0and Michael Roberts.<\/p>\n Parikh’s theorem for infinite alphabets – Piotr Hofman, Marta Juzepczuk,<\/strong>\u00a0S\u0142awomir Lasota<\/a>\u00a0and Mohnish Pattathurajan.<\/p>\n Multi-Structural Games and Number of Quantifiers –<\/strong> Ronald Fagin<\/a>, Jonathan Lenchner<\/a>, Kenneth W. Regan<\/a> and Nikhil Vyas<\/a>.<\/p>\n Commutative Monads for Probabilistic Programming Languages –<\/strong> Xiaodong Jia, Bert Lindenhovius,\u00a0Michael Mislove<\/a>\u00a0and\u00a0Vladimir Zamdzhiev<\/a>.<\/p>\n Zero-one laws for provability logic:Axiomatizing validity in almost all models and almost all frames –<\/strong> Rineke Verbrugge<\/a>.\u00a0<\/p>\n Some constructive variants of S4 with the finite model property –<\/strong> Philippe Balbiani,\u00a0Mart\u00edn Di\u00e9guez and David FernC!ndez-Duque.<\/p>\n Symbolic Time and Space Tradeoffs for Probabilistic Verification\u00a0–<\/strong> Krishnendu Chatterjee<\/a>,\u00a0Wolfgang Dvo\u0159\u00e1k<\/a><\/a>,\u00a0Monika Henzinger<\/a>\u00a0and\u00a0Alexander Svozil<\/a>.\u00a0<\/p>\n No-Rainbow Problem and the Surjective Constraint Satisfaction Problem –<\/strong> Dmitriy Zhuk.<\/p>\n Evidenced Frames: A Unifying Framework Broadening Realizability Models –<\/strong> Liron Cohen<\/a>, Etienne Miquey and\u00a0Ross Tate<\/a>.<\/p>\n Continuous One-Counter Automata –<\/strong> Michael Blondin<\/a>,\u00a0Tim Leys<\/a>,\u00a0Filip Mazowiecki<\/a>,\u00a0Philip Offtermatt<\/a>\u00a0and\u00a0Guillermo Perez<\/a>.<\/p>\n Combining nondeterminism, probability, and termination: equational and metric reasoning –<\/strong> Matteo Mio<\/a>, Ralph Sarkis and\u00a0Valeria Vignudelli<\/a>.<\/p>\n Normalization for Cubical Type Theory –<\/strong> Jonathan Sterling and Carlo Angiuli.<\/p>\n Separating Rank Logic from Polynomial Time –<\/strong> Moritz Lichter<\/a>.<\/p>\n Stochastic Processes with Expected Stopping Time –<\/strong> Krishnendu Chatterjee<\/a>\u00a0and\u00a0Laurent Doyen<\/a>.<\/p>\n Smart Choices and the Selection Monad –<\/strong> Martin Abadi and Gordon Plotkin.<\/p>\n A Quantum Interpretation of Bunched Logic & Quantum Separation Logic –<\/strong> Li Zhou,\u00a0Gilles Barthe<\/a>, Justin Hsu, Mingsheng Ying and Nengkun Yu.<\/p>\n Behavioural Preorders via Graded Monads –<\/strong> Chase Ford<\/a>,\u00a0Stefan Milius<\/a>\u00a0and\u00a0Lutz Schr\u00f6<\/span>der<\/a>.<\/p>\n Responsibility and verification: Importance value in temporal logics –<\/strong> Corto Mascle,\u00a0Christel Baier<\/a>,\u00a0Florian Funke<\/a>, Simon Jantsch and\u00a0Stefan Kiefer<\/a>.<\/p>\n Finite Model Theory of the Triguarded Fragment and Related Logics<\/strong> – Emanuel Kieronski<\/a>\u00a0and Sebastian Rudolph.<\/p>\n The Laplace Mechanism is optimal for differential privacy over continuous queries<\/strong> –<\/strong> Annabelle McIver, Natasha Fernandes and Carroll Morgan.<\/p>\n From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata –<\/strong> Elisabet Burjons, Fabian Frei and Martin Raszyk.\u00a0<\/p>\n Deciding Differential Privacy for Programs with Unbounded Inputs –<\/strong> Rohit Chadha,\u00a0A. Prasad Sistla<\/a>\u00a0and Mahesh Viswanathan.<\/p>\n Asynchronous extensions of HyperLTL –<\/strong> Laura Bozzelli, Adriano Peron and\u00a0Cesar Sanchez<\/a>.<\/p>\n Fast algorithms for the satisfiability of two-variable logic –<\/strong> Ting-Wei Lin, Chia-Hsuan Lu and Tony Tan.<\/p>\n Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom –<\/strong> Rob van Glabbeek<\/a>,\u00a0Peter H\u00f6fner<\/a>\u00a0and\u00a0Ross Horne<\/a>.<\/p>\n SD-Regular Transducer Expressions for Aperiodic Transformations –<\/strong> Luc Dartois<\/a>, Paul Gastin and Shankara Narayanan Krishna.<\/p>\n Types are Internal infinity-groupoids –<\/strong> Antoine Allioux,\u00a0Eric Finster<\/a>\u00a0and\u00a0Matthieu Sozeau<\/a>.<\/p>\n Global Optimisation with Constructive Reals –<\/strong> Dan Ghica<\/a>\u00a0and\u00a0Todd Waugh Ambridge<\/a>.<\/p>\n Categorical models of Linear Logic with fixed points of formulas –<\/strong> Thomas Ehrhard<\/a>\u00a0and Farzad Jafarrahmani.<\/p>\n Parameterized Complexity of Elimination Distance to First-Order Logic Properties –<\/strong> Fedor Fomin<\/a>, Petr Golovach and\u00a0Dimitrios Thilikos<\/a>.<\/p>\n Constraint Satisfaction Problems over Finite Structures –<\/strong> Libor Barto<\/a>, William DeMeo and\u00a0Antoine Mottet<\/a>.<\/p>\n A compositional cost model for the lambda-calculus –<\/strong> James Laird<\/a>.<\/p>\n Strong Call-by-Value is Reasonable, Implosively –<\/strong> Beniamino Accattoli<\/a>,\u00a0Andrea Condoluci<\/a>\u00a0and\u00a0Claudio Sacerdoti Coen<\/a>.<\/p>\n GC6del-McKinsey-Tarski and Blok-Esakia for Lewis-Brouwer Implication –<\/strong> Jim de Groot<\/a>,\u00a0Tadeusz Litak<\/a>\u00a0and\u00a0Dirk Pattinson<\/a>.<\/p>\n On Logics and Homomorphism Closure –<\/strong> Manuel Bodirsky, Thomas Feller, Simon Knaeuer and Sebastian Rudolph.<\/p>\n Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes –<\/strong> Jan Dreier<\/a>.<\/p>\n Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation –<\/strong> Yuichi Komorida<\/a>,\u00a0Shin-Ya Katsumata<\/a>,\u00a0Clemens Kupke<\/a>,\u00a0Jurriaan Rot<\/a>\u00a0and\u00a0Ichiro Hasuo<\/a>.<\/p>\n On sequentiality and well-bracketing in the O-calculus –<\/strong> Daniel Hirschkoff<\/a>, Enguerrand Prebet and\u00a0Davide Sangiorgi<\/a>.<\/p>\n On Generalized Metric Spaces for the Simply Typed Lambda-Calculus –<\/strong> Paolo Pistone.<\/p>\n Parametricity and Semi-Cubical Types –<\/strong> Hugo Moeneclaey.<\/p>\n A Logic for Locally Complete Abstract Interpretations –<\/strong> Roberto Bruni<\/a>,\u00a0Roberto Giacobazzi<\/a>, Roberta Gori and Francesco Ranzato.<\/p>\n Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods –<\/strong> Giorgio Bacci, Giovanni Bacci,\u00a0Kim Guldstrand Larsen<\/a>,\u00a0Mirco Tribastone<\/a>,\u00a0Max Tschaikowski<\/a>\u00a0and\u00a0Andrea Vandin<\/a>.<\/p>\n Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property –<\/strong> Manuel Bodirsky<\/a>\u00a0and\u00a0Bertalan Bodor<\/a>.<\/p>\n Intersection Type Distributors –<\/strong> Federico Olimpieri<\/a>.<\/p>\n Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata –\u00a0<\/strong>Miko\u0142aj Boja\u0144czyk<\/a>,\u00a0Bartek Klin<\/a>\u00a0and Joshua Moerman.<\/p>\n A Bunched Logic for Conditional Independence –\u00a0<\/strong>Jialu Bao, Simon Docherty, Justin Hsu and Alexandra Silva.<\/p>\n An Algebraic Characterisation of First-Order Logic with Neighbour –\u00a0<\/strong>Amaldev Manuel and Dhruv Nevatia.<\/p>\n Fixed-Points for Quantitative Equational Logics –\u00a0<\/strong>Radu Mardare<\/a>, Gordon Plotkin and\u00a0Prakash Panangaden<\/a>.<\/p>\n Perspective Multi-Player Games –\u00a0<\/strong>Orna Kupferman<\/a>\u00a0and Noam Shenwald.<\/p>\n On the Expressive Power of Homomorphism Counts –\u00a0<\/strong>Albert Atserias<\/a>,\u00a0Phokion Kolaitis<\/a>\u00a0and\u00a0Wei-Lin Wu<\/a>.<\/p>\n Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics –\u00a0<\/strong>R. Balasubramanian, Timo Lang and\u00a0Revantha Ramanayake<\/a>.<\/p>\n Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition –\u00a0<\/strong>Robin Hirsch<\/a>\u00a0and\u00a0Jas Semrl<\/a>.<\/p>\n On Monadic Rewriting Systems, Part I –\u00a0<\/strong>Francesco Gavazzo<\/a>\u00a0and\u00a0Claudia Faggian<\/a>.<\/p>\n The Space of Interaction –\u00a0<\/strong>Beniamino Accattoli<\/a>,\u00a0Ugo Dal Lago<\/a>\u00a0and\u00a0Gabriele Vanoni<\/a>.<\/p>\n Universal Skolem Sets –\u00a0<\/strong>Florian Luca,\u00a0Joel Ouaknine<\/a>\u00a0and\u00a0James Worrell<\/a>.<\/p>\n Supermartingales, Ranking Functions and Probabilistic Lambda Calculus –\u00a0<\/strong>Andrew Kenyon-Roberts and Luke Ong.<\/p>\n Compositional Semantics for Probabilistic Programs with Exact Conditioning –\u00a0<\/strong>Dario Stein and Sam Staton.<\/p>\n Verifying higher-order concurrency with data automata –\u00a0<\/strong>Alex Dixon,\u00a0Ranko Lazic<\/a>,\u00a0Andrzej Murawski<\/a>\u00a0and\u00a0Igor Walukiewicz<\/a>.<\/p>\n Quantitative and Approximate Monitoring –\u00a0<\/strong>Thomas A. Henzinger and N. Ege SaraC’.<\/p>\n Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus –\u00a0<\/strong>Tuomas Hakoniemi.<\/p>\n Axiomatizations and Computability of Weighted Monadic Second-Order Logic –\u00a0<\/strong>Antonis Achilleos<\/a>\u00a0and\u00a0Mathias Ruggaard Pedersen<\/a>.<\/p>\n On the logical structure of choice and bar induction principles –\u00a0<\/strong>Nuria Brede<\/a>\u00a0and\u00a0Hugo Herbelin<\/a>.<\/p>\n Initial limit Datalog: a new extensible class of decidable constrained Horn clauses –\u00a0<\/strong>Toby Cathcart Burn,\u00a0Luke Ong<\/a>, Steven Ramsay and Dominik Wagner.<\/p>\n Compositional relational reasoning via operational game semantics –\u00a0<\/strong>Guilhem Jaber<\/a>\u00a0and\u00a0Andrzej Murawski<\/a>.<\/p>\n Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP –\u00a0<\/strong>Libor Barto, Zarathustra Brady,\u00a0Andrei Bulatov<\/a>,\u00a0Marcin Kozik<\/a>\u00a0and Dmitriy Zhuk.<\/p>\n Alignment Completeness for Relational Hoare Logics –\u00a0<\/strong>Ramana Nagasamudram and\u00a0David Naumann<\/a>.<\/p>\n Session Logical Relations for Noninterference –\u00a0<\/strong>Farzaneh Derakhshan<\/a>,\u00a0Stephanie Balzer<\/a>\u00a0and\u00a0Limin Jia<\/a>.<\/p>\n Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics –\u00a0<\/strong>Maciej Gazda and\u00a0