Imagen de Portada

Probabilistic Strategies: Definability and the Tensor Completeness Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bowler, Nathan, Goncharov, Sergey, Levy, Paul Blain
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Bialgebraic Reasoning on Stateful Languages
por: Goncharov, Sergey, et al.
Publicado: (2025)

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

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

Higher-order bialgebraic semantics
por: Goncharov, Sergey, et al.
Publicado: (2024)

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

A Dual-Threshold Probabilistic Knowing Value Logic
por: Wang, Shanxia
Publicado: (2026)

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

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

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

Definability and Interpolation in Philosophy
por: van Benthem, Johan
Publicado: (2026)

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

Defining implication relation for classical logic
por: Fu, Li
Publicado: (2013)

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

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

The Discontinuity Problem
por: Brattka, Vasco
Publicado: (2020)

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

Making first order linear logic a generating grammar
por: Slavnov, Sergey
Publicado: (2022)

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

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

The Relational Quotient Completion
por: Dagnino, Francesco, et al.
Publicado: (2024)

Choiceless Computation and Symmetry: Limitations of Definability
por: Pago, Benedikt
Publicado: (2024)

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

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

Probabilistic consequence relations
por: Égré, Paul, et al.
Publicado: (2024)

The Tensor-Plus Calculus
por: Chardonnet, Kostia, et al.
Publicado: (2025)

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