砍伐 发表于 2025-3-23 11:42:51

Invariant definability,efinability and definability with built-in relations) and establish connections between them. In descriptive complexity theory, invariant definability is mostly used with a linear order (or a successor relation) as the auxiliary relation. We formulate a conjecture which spells out the special role l

全部逛商店 发表于 2025-3-23 15:59:46

http://reply.papertrans.cn/24/2327/232619/232619_12.png

LAIR 发表于 2025-3-23 21:05:55

Restart tableaux with selection function, clauses: .-ordered tableaux, tableaux with selection function, and strict restart model elimination. We present two new sound and complete abstract tableau calculi which generalize these on the ground level. This makes differences and similarities between the calculi clearer and, in addition, gives

agonist 发表于 2025-3-23 22:58:11

,Two semantics and logics based on the Gödel interpretation, its Dialectica interpretation in the language of arithmetic in all finite types. The translation (..)° of .. back into the language of first-order arithmetic using the system . of hereditary recursive operations is considered. The theories T. and T. consist of arithmetic sentences . such that (..)°

Abutment 发表于 2025-3-24 06:21:28

http://reply.papertrans.cn/24/2327/232619/232619_15.png

微不足道 发表于 2025-3-24 08:07:15

https://doi.org/10.1007/978-3-642-52190-4 a natural ordering on trees. We present alternating logarithmic time algorithms for the tree isomorphism problem, the tree canonization problem and the tree comparison problem. As a consequence, there is a recursive enumeration of the alternating log time tree problems.

consent 发表于 2025-3-24 11:25:56

http://reply.papertrans.cn/24/2327/232619/232619_17.png

Barter 发表于 2025-3-24 16:07:35

Der „Mensch“ im Prolog des IV. Evangeliums completeness and the eliminability of cut are sketched along with three applications: The foundations for recursive definitions of well-founded and non-well founded predicates, classical and intuitionistic second order arithmetic, and a study of Cantor‘s diagonal argument and paradox.

偶像 发表于 2025-3-24 19:03:52

Studien zum Problem der Identität is mostly used with a linear order (or a successor relation) as the auxiliary relation. We formulate a conjecture which spells out the special role linear order plays in capturing complexity classes with logies and prove two special cases.

Malaise 发表于 2025-3-25 02:22:00

http://reply.papertrans.cn/24/2327/232619/232619_20.png
页: 1 [2] 3 4 5 6 7
查看完整版本: Titlebook: Computational Logic and Proof Theory; 5th Kurt Gödel Collo Georg Gottlob,Alexander Leitsch,Daniele Mundici Conference proceedings 19971st e