Cover Image

When Are Prime Formulae Characteristic?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aceto, Luca, Della Monica, Dario, Fábregas, Ignacio, Ingólfsdóttir, Anna
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
by: Aceto, Luca, et al.
Published: (2025)

A unified rule format for bounded nondeterminism in SOS with terms as labels
by: Aceto, Luca, et al.
Published: (2024)

Logical characterisations, rule formats and compositionality for input-output conformance simulation
by: Aceto, Luca, et al.
Published: (2024)

On the specification of modal systems: A comparison of three frameworks
by: Aceto, Luca, et al.
Published: (2024)

Rule Formats for Nominal Process Calculi
by: Aceto, Luca, et al.
Published: (2024)

The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
by: Aceto, Luca, et al.
Published: (2024)

Deciding characteristic formulae: A journey in the branching-time spectrum
by: Aceto, Luca, et al.
Published: (2025)

Complexity results for modal logic with recursion via translations and tableaux
by: Aceto, Luca, et al.
Published: (2023)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

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

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
by: de Frutos-Escrig, David, et al.
Published: (2024)

Reflection and Preservation of Properties in Coalgebraic (bi)Simulations
by: Fábregas, Ignacio, et al.
Published: (2024)

Logics for Contravariant Simulations
by: Fábregas, Ignacio, et al.
Published: (2024)

Prime Factorization in Models of PV$_1$
by: Ježil, Ondřej
Published: (2025)

Centralized vs Decentralized Monitors for Hyperproperties
by: Aceto, Luca, et al.
Published: (2024)

Characterizing LTL Formulas by Examples
by: Cate, Balder ten, et al.
Published: (2026)

Characterising Modal Formulas with Examples
by: Cate, Balder ten, et al.
Published: (2023)

Symmetries of Dependency Quantified Boolean Formulas
by: Hofstadler, Clemens, et al.
Published: (2024)

Efficient Volume Computation for SMT Formulas
by: Shaw, Arijit, et al.
Published: (2025)

An Effective Orchestral Approach to Satisfiability Modulo Prime Fields
by: Isabel, Miguel, et al.
Published: (2026)

A Sequent Calculus For Trace Formula Implication
by: Heidler, Niklas, et al.
Published: (2025)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Progress, Justness and Fairness in Modal $μ$-Calculus Formulae
by: Spronck, Myrthe, et al.
Published: (2024)

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

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2025)

Hard Clique Formulas for Resolution
by: Atserias, Albert
Published: (2026)

Efficient Implementation of an Abstract Domain of Quantified First-Order Formulas
by: Frenkel, Eden, et al.
Published: (2024)

Formula size game and model checking for modal substitution calculus
by: Ahvonen, Veeti, et al.
Published: (2025)

Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
by: Vehlken, Fabian, et al.
Published: (2026)

Principal Typing for Intersection Types, Forty-Five Years Later
by: Pautasso, Daniele, et al.
Published: (2026)

A Game for Counting Logic Formula Size and an Application to Linear Orders
by: Fournier, Gregoire, et al.
Published: (2025)

Existential and positive games: a comonadic and axiomatic view
by: Abramsky, Samson, et al.
Published: (2025)

Model Counting for Dependency Quantified Boolean Formulas
by: Fung, Long-Hin, et al.
Published: (2025)

When Darwin met Ianus: dichotomies of expressivity
by: Brunar, Johanna, et al.
Published: (2025)

Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics
by: Diéguez, Martín, et al.
Published: (2026)

Strong normalization through idempotent intersection types: a new syntactical approach
by: Barenbaum, Pablo, et al.
Published: (2025)

On the Axioms of Arboreal Categories
by: Jakl, Tomáš, et al.
Published: (2026)

Arboreal Categories: An Axiomatic Theory of Resources
by: Abramsky, Samson, et al.
Published: (2021)

Modal Separability of Fixpoint Formulae
by: Jung, Jean Christoph, et al.
Published: (2024)