:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Tsukada, Takeshi, Asada, Kazuyuki, Hirata, Kengo
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2604.26829
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Profunctorial Semantics for Quantum Supermaps
by: Hefford, James, et al.
Published: (2024)

On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)

Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
by: Kura, Satoshi, et al.
Published: (2025)

Profunctorial algebras
by: Aristote, Quentin, et al.
Published: (2026)

A Primal-Dual Perspective on Program Verification Algorithms (Extended Version)
by: Tsukada, Takeshi, et al.
Published: (2025)

RapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing
by: Matsushita, Yusuke, et al.
Published: (2025)

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

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

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
by: Wang, Shanxia
Published: (2026)

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

Probabilistic Strategies: Definability and the Tensor Completeness Problem
by: Bowler, Nathan, et al.
Published: (2025)

Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
by: Lyon, Tim S., et al.
Published: (2024)

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
by: Jung, Jean Christoph, et al.
Published: (2025)

Synthesising Full-Information Protocols
by: Berwanger, Dietmar, et al.
Published: (2023)

Non-strongly Stable Orders Also Define Interesting Simulation Relations
by: Fábregas, Ignacio, et al.
Published: (2024)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

Construction Defining Functionality:A Constructive Perspective on Functions through Their Generated Structures
by: Nishiyama, Yumiko
Published: (2025)

Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Unification of Deterministic Higher-Order Patterns (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2026)

Learning Aggregate Queries Defined by First-Order Logic with Counting
by: van Bergerem, Steffen, et al.
Published: (2024)

A Hoare Logic for Domain Specification (Full Version)
by: Kamburjan, Eduard, et al.
Published: (2024)

Modular Attractor Acceleration in Infinite-State Games (Full Version)
by: Heim, Philippe, et al.
Published: (2026)

Localized Attractor Computations for Infinite-State Games (Full Version)
by: Schmuck, Anne-Kathrin, et al.
Published: (2024)

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
by: Bogaerts, Bart, et al.
Published: (2022)

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
by: Schöpf, Jonas, et al.
Published: (2023)

Applications of Interval-based Temporal Separation: the Reactivity Normal Form, Inverse $Π$, Craig Interpolation and Beth Definability
by: Guelev, Dimitar P.
Published: (2025)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
by: Aoto, Takahito, et al.
Published: (2026)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
by: Aoto, Takahito, et al.
Published: (2024)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version)
by: König, Barbara, et al.
Published: (2025)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)
by: Heim, Philippe, et al.
Published: (2024)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
by: Nishida, Naoki, et al.
Published: (2025)

Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
by: Heuer, Jan, et al.
Published: (2024)

Functions Definable by Numerical Set-Expressions
by: Pratt-Hartmann, Ian, et al.
Published: (2009)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2025)

Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)

A Logic of Secrecy on Simplicial Models
by: Wang, Shanxia
Published: (2026)