excursion
发表于 2025-3-25 05:21:55
http://reply.papertrans.cn/24/2338/233770/233770_21.png
违抗
发表于 2025-3-25 09:42:13
Logics for context-free languages,th the class of those sets of strings which can be defined by sentences of the form ∃ ., where . is first order, . is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
长处
发表于 2025-3-25 13:13:42
Is first order contained in an initial segment of PTIME?,ls of this signature are all in an initial segment of P is shown to be related to other intriguing open problems in complexity theory and logic, like P=P...The second part of the paper strengthens the result of Ph. Kolaitis of logical definability of unambiguous computations.
蕨类
发表于 2025-3-25 17:28:46
Computer Science Logic978-3-540-49404-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
Bumptious
发表于 2025-3-25 22:08:19
http://reply.papertrans.cn/24/2338/233770/233770_25.png
Accolade
发表于 2025-3-26 03:35:26
The Carolingian Debate over Sacred Spaceth the class of those sets of strings which can be defined by sentences of the form ∃ ., where . is first order, . is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
舔食
发表于 2025-3-26 06:03:57
http://reply.papertrans.cn/24/2338/233770/233770_27.png
裂缝
发表于 2025-3-26 12:23:18
http://reply.papertrans.cn/24/2338/233770/233770_28.png
colostrum
发表于 2025-3-26 14:47:49
Monadic second-order logic and linear orderings of finite structures,We consider graphs in which it is possible to specify linear orderings of the sets of vertices, in uniform ways, by MS (i.e., Monadic Second-order) formulas. We also consider classes of graphs ℂ such that for every L.ℂ, L is recognizable iff it is MS-definable. Our results concern in particular dependency graphs of partially commutative words.
Simulate
发表于 2025-3-26 20:31:13
http://reply.papertrans.cn/24/2338/233770/233770_30.png