Image de couverture de livre

Non-strongly Stable Orders Also Define Interesting Simulation Relations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fábregas, Ignacio, de Frutos-Escrig, David, Palomino, Miguel
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Logics for Contravariant Simulations
par: Fábregas, Ignacio, et autres
Publié: (2024)

Reflection and Preservation of Properties in Coalgebraic (bi)Simulations
par: Fábregas, Ignacio, et autres
Publié: (2024)

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
par: de Frutos-Escrig, David, et autres
Publié: (2024)

On the specification of modal systems: A comparison of three frameworks
par: Aceto, Luca, et autres
Publié: (2024)

When Are Prime Formulae Characteristic?
par: Aceto, Luca, et autres
Publié: (2024)

A unified rule format for bounded nondeterminism in SOS with terms as labels
par: Aceto, Luca, et autres
Publié: (2024)

Logical characterisations, rule formats and compositionality for input-output conformance simulation
par: Aceto, Luca, et autres
Publié: (2024)

Rule Formats for Nominal Process Calculi
par: Aceto, Luca, et autres
Publié: (2024)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
par: Artale, Alessandro, et autres
Publié: (2025)

Learning Aggregate Queries Defined by First-Order Logic with Counting
par: van Bergerem, Steffen, et autres
Publié: (2024)

Shininess, strong politeness, and unicorns
par: Przybocki, Benjamin, et autres
Publié: (2025)

Relators and Notions of Simulation Revisited
par: Goncharov, Sergey, et autres
Publié: (2025)

Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
par: Heuer, Jan, et autres
Publié: (2024)

Definability and Interpolation in Philosophy
par: van Benthem, Johan
Publié: (2026)

Relational semantics for flat Heyting-Lewis Logic
par: de Groot, Jim, et autres
Publié: (2026)

Defining implication relation for classical logic
par: Fu, Li
Publié: (2013)

Unravelling Cyclic First-Order Arithmetic
par: Leigh, Graham E., et autres
Publié: (2025)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
par: Hansen, Helle Hvid, et autres
Publié: (2025)

Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
par: Vehlken, Fabian, et autres
Publié: (2026)

Choiceless Computation and Symmetry: Limitations of Definability
par: Pago, Benedikt
Publié: (2024)

Full Definability in a Profunctorial Model
par: Tsukada, Takeshi, et autres
Publié: (2026)

Learning Concepts Definable in First-Order Logic with Counting
par: van Bergerem, Steffen
Publié: (2019)

On the ABK Conjecture, alpha-well Quasi Orders and Dress-Schiffels product
par: Abraham, Uri, et autres
Publié: (2023)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
par: Bacci, Giorgio, et autres
Publié: (2025)

Probabilistic Strategies: Definability and the Tensor Completeness Problem
par: Bowler, Nathan, et autres
Publié: (2025)

Monadic Second-Order Logic of Permutations
par: Jelínek, Vít, et autres
Publié: (2025)

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
par: Pratt-Hartmann, Ian
Publié: (2017)

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
par: Jung, Jean Christoph, et autres
Publié: (2025)

The Pebble-Relation Comonad in Finite Model Theory
par: Montacute, Yoàv, et autres
Publié: (2021)

Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity
par: Nakamura, Yoshiki
Publié: (2023)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
par: Lyon, Tim S., et autres
Publié: (2024)

A General (Uniform) Relational Semantics for Sentential Logics
par: Hartonas, Chrysafis
Publié: (2025)

Duality for Normal Lattice Expansions and Sorted, Residuated Frames with Relations
par: Hartonas, Chrysafis
Publié: (2021)

Learning First-Order Rules with Relational Path Contrast for Inductive Relation Reasoning
par: Pan, Yudai, et autres
Publié: (2021)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
par: Iosif, Radu, et autres
Publié: (2023)

Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
par: Lyon, Tim S., et autres
Publié: (2024)

Non-Derivability Results in Polymorphic Dependent Type Theory
par: Geuvers, Herman
Publié: (2026)

Comodule Representations of Second-Order Functionals
par: Ahman, Danel, et autres
Publié: (2024)

Approximate Relational Reasoning for Higher-Order Probabilistic Programs
par: Haselwarter, Philipp G., et autres
Publié: (2024)

Unifying Semantic Path Order and Weighted Path Order
par: Saito, Teppei, et autres
Publié: (2026)