Image de couverture de livre

Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ham, Lucy, Jackson, Marcel
Format:	Preprint
Publié:	2022
Sujets:	Logic Computational Complexity Logic in Computer Science 03C13, 08B05, 08B26, 68Q15, 68Q19, 08A30, 20M07
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Flexible constraint satisfiability and a problem in semigroup theory
par: Jackson, Marcel
Publié: (2015)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
par: Marković, Petar, et autres
Publié: (2026)

The equational theory of the Weihrauch lattice with multiplication
par: Neumann, Eike, et autres
Publié: (2024)

The colored edge theory of A. Bulatov and binary absorption in minimal Taylor algebras
par: Brady, Zarathustra, et autres
Publié: (2026)

Algebra of Self-Replication
par: Moss, Lawrence S.
Publié: (2023)

Probabilistic equational spectrum, primality and approximation in finite algebras
par: Cardó, Carles
Publié: (2026)

Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)

The Complexity of Resilience for Digraph Queries
par: Bodirsky, Manuel, et autres
Publié: (2026)

Polynomial definability in constraint languages with few subpowers
par: Bulín, Jakub, et autres
Publié: (2023)

Ivo G. Rosenberg's Work on Maximal Clones and Minimal Clones
par: Szendrei, Agnes
Publié: (2024)

Preservation theorems on sparse classes revisited
par: Dawar, Anuj, et autres
Publié: (2024)

Computational Complexity of Model-Checking Quantum Pushdown Systems
par: Lin, Deren, et autres
Publié: (2025)

The Solver's Paradox in Formal Problem Spaces
par: Rosko, Milan
Publié: (2025)

Graded Monads in the Semantics of Nominal Automata
par: Schulze, Hannes, et autres
Publié: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2024)

Polymorphism-homogeneity and universal algebraic geometry
par: Tóth, Endre, et autres
Publié: (2020)

Exploring P versus NP
par: Tang, Jian-Gang
Publié: (2022)

From Gödel incompleteness to the consistency of circuit lower bounds
par: Atserias, Albert, et autres
Publié: (2026)

Undefinability of Approximation of 2-to-2 Games
par: Dawar, Anuj, et autres
Publié: (2025)

There is a deep 1-generic set
par: Li, Ang
Publié: (2024)

The complexity of being monitorable
par: Camerlo, Riccardo, et autres
Publié: (2026)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
par: Schaefer, Marcus, et autres
Publié: (2025)

Complexity Classification Transfer for CSPs via Algebraic Products
par: Bodirsky, Manuel, et autres
Publié: (2022)

On some algebraic properties of Plonka sums and regularized varieties
par: Bonzio, S., et autres
Publié: (2026)

Finitely (In)tractable Promise Constraint Satisfaction Problems
par: Asimi, Kristina, et autres
Publié: (2020)

Unifying lower bounds for algebraic machines, semantically
par: Seiller, Thomas, et autres
Publié: (2018)

Complexity of chess domination problems
par: Langlois-Rémillard, Alexis, et autres
Publié: (2022)

On the complexity of solving equations over the symmetric group $S_4$
par: Aichinger, Erhard, et autres
Publié: (2025)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
par: Kátay, Tamás, et autres
Publié: (2023)

Some derivations among Logarithmic Space Bounded Counting Classes
par: Janaki, V., et autres
Publié: (2023)

Computational Complexity of Finding Subgroups of a Given Order
par: Lakshmanan, K.
Publié: (2025)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
par: Grochow, Joshua A., et autres
Publié: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
par: Collins, Nathaniel A., et autres
Publié: (2022)

A Minimal Substitution Basis for the Kalmár Elementary Functions
par: Prunescu, Mihai, et autres
Publié: (2025)

Refutability as Recursive as Provability
par: Cattabriga, Paola
Publié: (2024)

On Halting vs Converging in Recurrent Graph Neural Networks
par: Bollen, Jeroen, et autres
Publié: (2026)

Finite models for positive combinatorial and exponential algebra
par: Alsulami, Tumadhir, et autres
Publié: (2024)

Varieties defined by linear equations have the amalgamation property
par: Lipparini, Paolo
Publié: (2021)

Amalgamation Property in the subvarieties of Gautama and Almost Gautama algebras
par: Cornejo, Juan M., et autres
Publié: (2024)

Logical reduction of relations: from relational databases to Peirce's reduction thesis
par: Koshkin, Sergiy
Publié: (2024)