IRS
发表于 2025-3-23 11:26:22
http://reply.papertrans.cn/59/5881/588050/588050_11.png
HOWL
发表于 2025-3-23 16:40:20
On the Expressive Power of IF-Logic with Classical Negation that, nevertheless, the expressive power of this logic does not go beyond .. As part of the proof, we give a prenex normal form result and introduce a non-trivial syntactic fragment of full second-order logic that we show to be contained in ..
结合
发表于 2025-3-23 21:32:53
http://reply.papertrans.cn/59/5881/588050/588050_13.png
费解
发表于 2025-3-23 23:41:27
0302-9743 philosophical logics, such as complexity theory, model theory, partial order, Hoare logics, hybrid logics, Turing machines, etc.978-3-642-20919-2978-3-642-20920-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
interpose
发表于 2025-3-24 06:02:04
Hybrid Logics and NP Graph PropertiesWe show that for each property of graphs . in NP there is a sequence .., .., ... of formulas of the full hybrid logic which are satisfied exactly by the frames in .. Moreover, the size of .. is bounded by a polynomial. We also show that the same holds for each graph property in the polynomial hierarchy.
cloture
发表于 2025-3-24 07:32:48
http://reply.papertrans.cn/59/5881/588050/588050_16.png
novelty
发表于 2025-3-24 10:59:12
http://reply.papertrans.cn/59/5881/588050/588050_17.png
Allege
发表于 2025-3-24 14:49:43
Relational Concepts and the Logic of Reciprocityakes such . to denote 〈1, 2 〉 generalized quantifiers over a given domain ., i.e. relations between subsets of E and binary relations over .. One of the reoccurring problems has been that reciprocal expressions seem to denote different quantifiers in different sentences.
Ergots
发表于 2025-3-24 20:00:56
http://reply.papertrans.cn/59/5881/588050/588050_19.png
施加
发表于 2025-3-24 23:35:08
Turing Machines on Cayley Graphsnd conclude that the proper degree of generality is Cayley graphs. Surprisingly, this generalization does not lead to yet another equivalent formulation of the notion of computable function. Rather, it gives an alternative definition of the recursively enumerable Turing degrees that does not rely on oracles.