:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bowler, Nathan, Goncharov, Sergey, Levy, Paul Blain
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2504.09392
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
by: Goncharov, Sergey
Published: (2024)

A Unifying Categorical View of Nondeterministic Iteration and Tests
by: Goncharov, Sergey, et al.
Published: (2024)

Big Steps in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2025)

Relators and Notions of Simulation Revisited
by: Goncharov, Sergey, et al.
Published: (2025)

The Only Distributive Law Over the Powerset Monad Is the One You Know
by: Goncharov, Sergey, et al.
Published: (2026)

Abstract Operational Methods for Call-by-Push-Value
by: Goncharov, Sergey, et al.
Published: (2024)

Identity-Preserving Lax Extensions and Where to Find Them
by: Goncharov, Sergey, et al.
Published: (2024)

Sound and Complete Proof Rules for Probabilistic Termination
by: Majumdar, Rupak, et al.
Published: (2024)

Bialgebraic Reasoning on Higher-Order Program Equivalence
by: Goncharov, Sergey, et al.
Published: (2024)

Bialgebraic Reasoning on Stateful Languages
by: Goncharov, Sergey, et al.
Published: (2025)

Logical Predicates in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2024)

Towards a Higher-Order Bialgebraic Denotational Semantics
by: Goncharov, Sergey, et al.
Published: (2026)

Higher-order bialgebraic semantics
by: Goncharov, Sergey, et al.
Published: (2024)

Complete $ω$-Regular Supermartingale Certificates
by: Abate, Alessandro, et al.
Published: (2026)

COBALT-TLA: A Neuro-Symbolic Verification Loop for Cross-Chain Bridge Vulnerability Discovery
by: Blain, Dominik
Published: (2026)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)

Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets
by: Patil, Jaikrishna Manojkumar, et al.
Published: (2025)

Defining implication relation for classical logic
by: Fu, Li
Published: (2013)

A Dual-Threshold Probabilistic Knowing Value Logic
by: Wang, Shanxia
Published: (2026)

On the Relative Completeness of Satisfaction-based Probabilistic Hoare Logic With While Loop
by: Sun, Xin, et al.
Published: (2024)

Probabilistic Strategy Logic with Degrees of Observability
by: Mu, Chunyan, et al.
Published: (2024)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

Towards a Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2022)

Definability and Interpolation in Philosophy
by: van Benthem, Johan
Published: (2026)

Probabilistic consequence relations
by: Égré, Paul, et al.
Published: (2024)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Complete representation by partial functions for signatures containing antidomain restriction
by: McLean, Brett
Published: (2023)

The Relational Quotient Completion
by: Dagnino, Francesco, et al.
Published: (2024)

The Discontinuity Problem
by: Brattka, Vasco
Published: (2020)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Making first order linear logic a generating grammar
by: Slavnov, Sergey
Published: (2022)

Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)

Choiceless Computation and Symmetry: Limitations of Definability
by: Pago, Benedikt
Published: (2024)

Full Definability in a Profunctorial Model
by: Tsukada, Takeshi, et al.
Published: (2026)

Solving Decision Theory Problems with Probabilistic Answer Set Programming
by: Azzolini, Damiano, et al.
Published: (2024)