Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Comer, Jesse"'
Autor:
Comer, Jesse
A famous result due to Lov\'{a}sz states that two finite relational structures $M$ and $N$ are isomorphic if, and only if, for all finite relational structures $T$, the number of homomorphisms from $T$ to $M$ is equal to the number of homomorphisms f
Externí odkaz:
http://arxiv.org/abs/2404.15421
Most research on formal system design has focused on optimizing various measures of efficiency. However, insufficient attention has been given to the design of systems optimizing resilience, the ability of systems to adapt to unexpected changes or ad
Externí odkaz:
http://arxiv.org/abs/2401.05585
Autor:
Cate, Balder ten, Comer, Jesse
We show that the guarded-negation fragment is, in a precise sense, the smallest extension of the guarded fragment with Craig interpolation. In contrast, we show that full first-order logic is the smallest extension of both the two-variable fragment a
Externí odkaz:
http://arxiv.org/abs/2310.08689
Autor:
Cate, Balder ten, Comer, Jesse
We show that the guarded-negation fragment (GNFO) is, in a precise sense, the smallest extension of the guarded fragment (GFO) with Craig interpolation. In contrast, %we show that the smallest extension of the two-variable fragment (FO2) with Craig i
Externí odkaz:
http://arxiv.org/abs/2304.08086