English
Related papers

Related papers: Decomposition Theorems and Model-Checking for the …

200 papers

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

Logic in Computer Science · Computer Science 2021-05-19 Alexandru Baltag , Nick Bezhanishvili , David Fernández-Duque

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

Computational Complexity · Computer Science 2007-05-23 Joerg Flum , Martin Grohe

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

Logic in Computer Science · Computer Science 2022-01-03 Abhisekh Sankaran

We introduce a new notion of structural refinement, a sound abstraction of logical implication, for the modal nu-calculus. Using new translations between the modal nu-calculus and disjunctive modal transition systems, we show that these two…

Logic in Computer Science · Computer Science 2014-06-11 Uli Fahrenberg , Axel Legay , Louis-Marie Traonouez

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…

Logic in Computer Science · Computer Science 2012-02-17 Martin Lange , Etienne Lozes

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

Logic in Computer Science · Computer Science 2025-08-18 Louwe Kuijer , Tony Tan , Frank Wolter , Michael Zakharyaschev

A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…

Rings and Algebras · Mathematics 2007-05-23 Luigi Santocanale

In this short note, we will explain that the good moduli space morphisms behave as if they are proper when we consider sheaf operations, though they are not separated. For example, the decomposition theorem and the base change theorem hold…

Algebraic Geometry · Mathematics 2024-08-13 Tasuki Kinjo

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Logic · Mathematics 2012-11-28 Mohammad Assem

We show that the model-checking problem is decidable for a fragment of the epistemic \mu-calculus. The fragment allows free variables within the scope of epistemic modalities in a restricted form that avoids constructing formulas embodying…

Logic in Computer Science · Computer Science 2012-07-17 Rodica Bozianu , Cătălin Dima , Constantin Enea

Disjoint-paths logic, denoted $\mathsf{FO}$+$\mathsf{dp}$, extends first-order logic ($\mathsf{FO}$) with atomic predicates $\mathsf{dp}_r[(x_1,y_1),\ldots,(x_r,y_r)]$, expressing the existence of vertex-disjoint paths between $x_i$ and…

Logic in Computer Science · Computer Science 2026-02-17 Nicole Schirrmacher , Sebastian Siebertz , Giannos Stamoulis , Dimitrios M. Thilikos , Alexandre Vigny

The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…

Quantum Physics · Physics 2026-03-20 Javier Álvarez-Vizoso , David Barral

We relate analytically defined deformations of modular curves and modular forms from the literature to motivic periods via cohomological descriptions of deformation theory. Leveraging cohomological vanishing results, we prove the existence…

Number Theory · Mathematics 2024-04-05 Adam Keilthy , Martin Raum

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability…

Logic in Computer Science · Computer Science 2023-06-22 Bartek Klin , Mateusz Łełyk

We study Demazure modules which occur in a level $\ell$ irreducible integrable representation of an affine Lie algebra. We also assume that they are stable under the action of the standard maximal parabolic subalgebra of the affine Lie…

Representation Theory · Mathematics 2014-08-19 Vyjayanthi Chari , Peri Shereen , R. Venkatesh , Jeffrey Wand

We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…

Logic · Mathematics 2013-07-16 Ilijas Farah , Bradd Hart , David Sherman

We prove a gluing formula for the analytic torsion on non-compact (i.e. singular) riemannian manifolds. Let M= U\cup M_1, where M_1 is a compact manifold with boundary and U represents a model of the singularity. For general elliptic…

Spectral Theory · Mathematics 2013-06-04 Matthias Lesch

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty
‹ Prev 1 2 3 10 Next ›