universal-algebraic methods

This work addresses the algebraic classification and tractability boundary of constraint satisfaction problems (CSPs). Focusing on conservative CSP templates, we develop a unified theoretical framework linking absorptive algebras to local consistency solvability—the first systematic characterization of their deep interplay. Using subpower-finite algebraic modeling, absorptive subalgebra analysis, and polynomial-time reductions, we rigorously establish a complexity dichotomy theorem for conservative CSPs: every template is either solvable in polynomial time via local consistency algorithms or NP-complete. Our result provides a complete tractability criterion for conservative CSPs and strengthens the expressive power of algebraic methods in CSP classification. Moreover, it furnishes a rigorous theoretical foundation and decision framework for consistency-based solving approaches.

This work addresses the computational complexity of Constraint Satisfaction Problems (CSPs) and Promise CSPs (PCSPs). We introduce the first purely categorical algebraic framework for their complexity analysis. Our method models CSPs/PCSPs as objects in a functor category, characterizes polynomial-time operations via right Kan extensions, encodes homomorphism relations using adjoint functors, and integrates ideas from algebraic topology to achieve a purely categorical characterization dependent solely on polynomial-time structure. Crucially, this framework dispenses with reliance on concrete algebraic structures—such as clones or polymorphisms—that underpin traditional approaches. The resulting paradigm is more concise, broadly applicable, and topologically compatible. It significantly simplifies derivations of classical results—including the Bulatov–Zhuk dichotomy theorem—and opens new interdisciplinary avenues for analyzing PCSPs, a long-standing open problem in theoretical computer science.

This paper addresses the structured lifting problem by proposing the first systematic abstract framework that uniformly characterizes its mathematical structure and computational semantics. Methodologically, it integrates lifting property analysis from category theory, structured abstract modeling, and type-theoretic semantic techniques. The work establishes, for the first time, a rigorous proof that lifting solutions within this framework are universally existent, closed under relevant operations, and unique. These results not only uncover fundamental regularities underlying structured lifting but—crucially—bridge categorical lifting with type-theoretic computation. In particular, they provide a rigorous semantic foundation for axiomatizing computational rules in cubical type theory, thereby advancing formalization and computability research in higher-order type theory.

Traditional categorical semantics interprets disjunction in parallel and algebraic lambda calculi as coproducts—a paradigm insufficient for capturing the interplay between parallelism and algebraic structure. Method: We propose a novel non-coproduct interpretation of disjunction, constructed jointly from disjoint union and Cartesian product. Within two non-standard set-theoretic categories—MagSet and AMagSet—we develop a denotational semantics for a dual lambda calculus supporting both parallel composition and scalar summation operators. Contribution/Results: This yields the first unified semantic account of disjunction under parallel and algebraic constraints. The model is rigorously sound and adequate, preserving key proof-theoretic properties including βη-equivalence and normalization. By reconciling parallel computation, linear resource logic, and algebraic effects within a single semantic framework, our work establishes a novel foundational basis for their integrated study.

This paper establishes an algebraic semantics foundation for programming languages with computational effects (e.g., state, I/O, exceptions). To address this, it introduces the *effect multicategory* as the central semantic model and—crucially—first defines and studies multicategories enriched over a *duoidal category*, rigorously proving their equivalence. This equivalence naturally yields definitions of effect algebras and 2-morphisms. Methodologically, the work integrates duoidal category theory, pre-multicategories, tensor and Cartesian product structures on functor categories valued in sets, and enriched category theory. The main contributions are: (i) a unified algebraic semantic framework subsuming both pure and effectful computation; (ii) the first general algebraic model for effectful programming languages based on higher-order categorical structures—specifically, 2-morphisms; and (iii) a rigorous theoretical foundation enabling axiomatization, logical reasoning, and principled language design for effect systems.

This paper studies the Reconfiguration Constraint Satisfaction Problem (RCSP): given a CSP instance and two solutions, determine whether they can be connected via a sequence of intermediate solutions, each differing from its predecessor in at most one variable assignment. Addressing the limitation of existing algebraic approaches—which require total operations and restrict to Boolean domains—we introduce a novel framework based on **partial algebraic operations**, modeling equality constraints as partial-operation identities and thereby relaxing the classical totality assumption. This framework yields the first universal algebraic characterization of RCSP, unifying solvability criteria across diverse settings. It substantially extends known tractable classes—including graph homomorphism reconfiguration—and provides new decidability criteria and complexity-theoretic analysis for reconstruction problems involving equality constraints.

This study addresses the formal representation and preservation of logical relationships among nested conditions in graph transformation rules. To overcome the limitations of existing approaches, which lack precise characterization of structural dependencies between nested conditions, the work introduces condition operators that emulate logical connectives and, for the first time, defines structural morphisms between nested conditions. Within a categorical framework, it establishes criteria under which these morphisms align with logical implication and proves that they preserve implication under a specific semantic interpretation. Furthermore, the paper uncovers the functorial nature and universal properties of the proposed constructions, thereby providing novel formal tools to strengthen the logical foundations of graph transformation systems.

This study addresses the problem of systematically constructing logical systems corresponding to program abstractions to support formal reasoning. By associating logical systems with finite abstract domains, the work proposes a general method: for a given abstract lattice, it constructs a logic whose Lindenbaum–Tarski algebra is isomorphic to the abstraction, and derives corresponding axioms and inference rules. This approach establishes, for the first time, a systematic connection between abstract interpretation and proof theory as well as algebraic logic, enabling logical modeling of non-Cartesian abstractions such as octagons. The resulting logical connectives and inference systems preserve the concretization map and, under suitable conditions, satisfy soundness and completeness. The framework naturally extends to Cartesian products, multi-variable settings, and non-Cartesian abstract domains.

This work addresses the semantics of fork and wait operations in dynamic threading by integrating parameterized algebraic theories with algebraic effects for the first time. It constructs an algebraic theory incorporating atomic actions and establishes a complete equational axiomatization within the model of labeled partial orders (pomsets). Leveraging strong monads and presheaf semantics over functor categories, the study achieves both syntactic and semantic completeness, yielding a denotational semantics that is sound, adequate, and first-order fully abstract. This provides a rigorous theoretical foundation for the formal verification of concurrent programs.

This study investigates the decision problem of whether a given logical property can be satisfied by a relational structure—such as an undirected or directed graph—after at most k modifications to its relations. Employing tools from descriptive complexity theory and parameterized complexity analysis, the work systematically characterizes the relationship between the logical expressiveness of the target property—particularly its quantifier structure—and the computational difficulty of the associated modification problem. The main contribution lies in establishing a complete complexity classification for this problem across various structural settings, revealing a striking dichotomy: every instance is either of very low complexity (belonging to para-AC⁰↑ or TC⁰) or is W[2]-hard or NP-hard. This result delineates a unified boundary of computational hardness grounded in logical definability.