Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Daniel Penazzi"'
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
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 formulas) with equality. Given a logic $\mathbf{\mathcal{L}}$, the $\mathbf{\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1af157329961ee56fcaedb2f7833d62
Autor:
Daniel Penazzi, Leandro Cagliero
Publikováno v:
Journal of Algebraic Combinatorics. 43:399-416
Given a partition $$\lambda $$? of n, the Schur functor$${\mathbb {S}}_\lambda $$S? associates to any complex vector space V, a subspace $${\mathbb {S}}_\lambda (V)$$S?(V) of $$V^{\otimes n}$$V?n. Hermite's reciprocity law, in terms of the Schur func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae957d8874390d50698137e3f11ddc16
https://doi.org/10.1007/s10801-015-0638-6
https://doi.org/10.1007/s10801-015-0638-6
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F. The set of all congruences of $\mathbf{F}$ is a lattice under the incl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85c686e71ab273b4843a1fd66c0ef904