飞镖
发表于 2025-3-28 17:24:13
A Parameterized View on the Complexity of Dependence Logic,mantics. We start with a list of nine immediate parameterizations for this problem, namely: the number of disjunctions (i.e., splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team, and the arity of depe
豪华
发表于 2025-3-28 22:37:12
http://reply.papertrans.cn/59/5882/588146/588146_42.png
不愿
发表于 2025-3-28 23:04:46
http://reply.papertrans.cn/59/5882/588146/588146_43.png
saturated-fat
发表于 2025-3-29 05:14:28
http://reply.papertrans.cn/59/5882/588146/588146_44.png
我不死扛
发表于 2025-3-29 09:46:07
http://reply.papertrans.cn/59/5882/588146/588146_45.png
sacrum
发表于 2025-3-29 12:29:31
,Betwixt Turing and Kleene,ach and provide a framework for .. Various research programs have been proposed in which higher-order objects, like functions on the real numbers, are . as real numbers, so as to make them amenable to the Turing framework. It is then a natural question whether there is any significant difference bet
deadlock
发表于 2025-3-29 16:57:09
Computability Models over Categories and Presheaves,], we define canonical computability models over certain categories and appropriate presheaves on them. We study the canonical total computability model over a category . and a covariant presheaf on ., and the canonical partial computability model over a category . with pullbacks and a pullback pres
VOC
发表于 2025-3-29 22:09:31
,Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability,le residuated semigroup is representable over a finite base. This result gives a positive solution to Problem 19.17 from the monograph by Hirsch and Hodkinson [.]..We also show that the class of representable join semilattice-ordered semigroups is pseudo-universal and it has a recursively enumerable
GOAT
发表于 2025-3-30 01:39:52
http://reply.papertrans.cn/59/5882/588146/588146_49.png
nocturnal
发表于 2025-3-30 06:06:01
Propositional Dynamic Logic with Quantification over Regular Computation Sequences,er computation sequences represented by a given regular expression and states accessible via these computation sequences. This extended language is able to express that there is a computation sequence represented by a given regular expression that leads only to states where a given formula is satisf