1 citations · 1 across the 6 of their papers we have counts for
9 papers
Global representations of algebras with a near-unanimity term
Miguel Campercholi
Global representations are subdirect representations satisfying a sheaf-like local-to-global patching principle. We develop a unified and simplified theory of such representations.…
The complexity of the Chinese Remainder Theorem
Miguel Campercholi, Diego Castaño, Gonzalo Zigarán
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This state…
Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures
Miguel Campercholi, Mauricio Tellechea, Pablo Ventura
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two dec…
Algebraic expansions of logics and algebras and a case study of Abelian l-groups and perfect MV-algebras
Miguel Campercholi, Diego Castaño, José Patricio Díaz Varela +1
An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form . For a logic algebraized by a qu…
The Complexity of Definability by Open First-Order Formulas
Carlos Areces, Miguel Campercholi, Daniel Penazzi +1
In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formula…
Epic substructures and primitive positive functions
Miguel Campercholi
For first order structures in a class , say that is an epic substructure of in if for every $\mathbf…