3 papers
cs.CC2019
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…
math.CO2015
A new generalization of Hermite's reciprocity law
Leandro Cagliero, Daniel Penazzi
Given a partition of , the {\it Schur functor} associates to any complex vector space , a subspace of . Hermite's reciproc…
math.LO2015
The Lattice of Congruences of a Finite Line Frame
Carlos Areces, Miguel Campercholi, Daniel Penazzi +1
Let be a finite Kripke frame. A congruence of is a bisimulation of that is also an equivalence relation on F.…