標(biāo)題: Titlebook: Computational Logic and Proof Theory; 5th Kurt G?del Collo Georg Gottlob,Alexander Leitsch,Daniele Mundici Conference proceedings 19971st e [打印本頁] 作者: FERN 時間: 2025-3-21 16:24
書目名稱Computational Logic and Proof Theory影響因子(影響力)
書目名稱Computational Logic and Proof Theory影響因子(影響力)學(xué)科排名
書目名稱Computational Logic and Proof Theory網(wǎng)絡(luò)公開度
書目名稱Computational Logic and Proof Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Logic and Proof Theory被引頻次
書目名稱Computational Logic and Proof Theory被引頻次學(xué)科排名
書目名稱Computational Logic and Proof Theory年度引用
書目名稱Computational Logic and Proof Theory年度引用學(xué)科排名
書目名稱Computational Logic and Proof Theory讀者反饋
書目名稱Computational Logic and Proof Theory讀者反饋學(xué)科排名
作者: ADORN 時間: 2025-3-21 23:33 作者: 吃掉 時間: 2025-3-22 01:07 作者: browbeat 時間: 2025-3-22 07:16 作者: OGLE 時間: 2025-3-22 09:06
Subtyping over a lattice (abstract), talk we will propose a new system of notations for types, which we call ., and show that for a system of sybtype inequalities over a lattice, if it has a solution then there is a solution whose alternating dag is of polynomial size in the size of the original system. There are examples showing that作者: 結(jié)束 時間: 2025-3-22 13:49
A new method for bounding the complexity of modal logics,uniform way as sequent systems and then restrict the structural rules for particular systems. This, combined with an analysis of the accessibility relation of the corresponding Kripke structures, yields decision procedures with bounded space requirements. As examples we give .(. log .) space procedu作者: 結(jié)束 時間: 2025-3-22 18:23
Parameter free induction and reflection,w that .. is conservative over .. w.r.t. boolean combinations of .. sentences, for . ≥ 1. In particular, we give a positive answer to a question by R. Kaye, whether the provably recursive functions of .. are exactly the primitive recursive ones.作者: ungainly 時間: 2025-3-23 00:03 作者: angina-pectoris 時間: 2025-3-23 03:43 作者: rheumatism 時間: 2025-3-23 06:48
NaDSyL and some applications,els of the lambda calculus and is motivated by the belief that a confusion of use and mention is the source of the paradoxes. Proofs of the soundness, completeness and the eliminability of cut are sketched along with three applications: The foundations for recursive definitions of well-founded and n作者: 砍伐 時間: 2025-3-23 11:42
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 作者: LAIR 時間: 2025-3-23 21:05
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
,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 作者: 微不足道 時間: 2025-3-24 08:07
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 作者: Barter 時間: 2025-3-24 16:07
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
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 作者: florid 時間: 2025-3-25 03:55
Alogtime algorithms for tree isomorphism, comparison, and canonization, 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.作者: Opponent 時間: 2025-3-25 07:37
Subtyping over a lattice (abstract),as a solution then there is a solution whose alternating dag is of polynomial size in the size of the original system. There are examples showing that the well known dag representation of types is not good enough for this purpose, already for the two-element lattice.作者: Vital-Signs 時間: 2025-3-25 15:08
NaDSyL and some applications, 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.作者: vocation 時間: 2025-3-25 17:32 作者: 寬度 時間: 2025-3-25 22:58
Restart tableaux with selection function,ableau calculi which generalize these on the ground level. This makes differences and similarities between the calculi clearer and, in addition, gives insight into how properties of the calculi can be transferred among them. In particular, a precise borderline separating proof confluent from non-proof confluent variants is exhibited.作者: 滲透 時間: 2025-3-26 04:02 作者: 慟哭 時間: 2025-3-26 07:32 作者: aviator 時間: 2025-3-26 09:48 作者: heterogeneous 時間: 2025-3-26 12:54 作者: ENDOW 時間: 2025-3-26 18:28 作者: EXPEL 時間: 2025-3-26 23:53 作者: N防腐劑 時間: 2025-3-27 02:02
https://doi.org/10.1007/978-3-663-15806-6lation techniques in Automated Deduction, such as antiprenexing and some forms of normal form translations, can be described as cuts and are indeed part of the deductive solution of a problem. Furthermore, we demonstrate the connection between symmetric simplification, quantorial extension principles and the application of the cut-rule.作者: 采納 時間: 2025-3-27 06:29
Structuring of computer-generated proofs by cut introduction,lation techniques in Automated Deduction, such as antiprenexing and some forms of normal form translations, can be described as cuts and are indeed part of the deductive solution of a problem. Furthermore, we demonstrate the connection between symmetric simplification, quantorial extension principles and the application of the cut-rule.作者: 圖表證明 時間: 2025-3-27 12:25 作者: Hyperalgesia 時間: 2025-3-27 14:41
Comparing computational representations of Herbrand models,resenting essentially infinite models (i.e. models of not finitely controllable formulas), thus motivating our interest in relating model properties with syntactical properties of corresponding Herbrand models and in investigating connections between formal language theory, term schematizations and automated model building.作者: GONG 時間: 2025-3-27 17:49
Conference proceedings 19971st editionria, in August 1997..The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining researc作者: 整潔漂亮 時間: 2025-3-28 01:38
Paramodulation, superposition, and simplification, of the approach have led to the formulation of a refutationally complete method called .; the main contributions can be found in [12, 10, 8, 3, 1, 2]..The deductive inference rule used in completion procedures is ., which consists of first unifying one side of one equation with a subterm of another作者: Musculoskeletal 時間: 2025-3-28 03:50
Ultrafilter logic and generic reasoning,the presentation. We also comment on some perspectives for further work: interesting connections with fuzzy logic, inductive reasoning and empirical reasoning suggest the possibility of other applications for our logic.作者: Armory 時間: 2025-3-28 07:36 作者: Ballad 時間: 2025-3-28 14:23 作者: 胖人手藝好 時間: 2025-3-28 16:39 作者: 夾死提手勢 時間: 2025-3-28 21:33 作者: d-limonene 時間: 2025-3-29 02:27 作者: Gene408 時間: 2025-3-29 05:19
https://doi.org/10.1007/3-540-63385-5Complexity Theory; Computational Logic; Nonclassical Logics; Proof Analysis; complexity; logic; mathematic作者: obnoxious 時間: 2025-3-29 07:46
978-3-540-63385-3Springer-Verlag Berlin Heidelberg 1997作者: 迅速成長 時間: 2025-3-29 13:47
Amanda oder die Puppe als Geliebte,cent success in equational theorem proving has been the solution of an open problem (the “Robbins conjecture”) by William McCune with his prover . [13].. is one of many equational theorem provers that use . as the main deductive mechanism. Completion derives from the work of Knuth and Bendix [11] an作者: Nostalgia 時間: 2025-3-29 17:42 作者: epicondylitis 時間: 2025-3-29 23:17
Legistische Richtlinien in ?sterreichbasis for generic reasoning. This monotonic ultrafilter logic is a conservative extension of classical first-order logic, with which it shares several properties, including a simple sound and complete deductive system. For reasoning about generic objects, we introduce ‘generic’ individuals as those 作者: negligence 時間: 2025-3-30 01:52 作者: lesion 時間: 2025-3-30 04:13 作者: 壓艙物 時間: 2025-3-30 08:40
https://doi.org/10.1007/978-3-642-95417-7uniform way as sequent systems and then restrict the structural rules for particular systems. This, combined with an analysis of the accessibility relation of the corresponding Kripke structures, yields decision procedures with bounded space requirements. As examples we give .(. log .) space procedu作者: In-Situ 時間: 2025-3-30 14:03 作者: plasma-cells 時間: 2025-3-30 17:24 作者: 溫和女人 時間: 2025-3-30 20:50 作者: CHURL 時間: 2025-3-31 02:28 作者: 撫慰 時間: 2025-3-31 06:41 作者: nullify 時間: 2025-3-31 10:19
https://doi.org/10.1007/978-3-662-29724-7, e.g. for automated model building or semantic resolution. In this article we treat the problem of representing single models independently of building them and discuss the power of different mechanisms for this purpose. We start with investigating context-free languages for representing single Her作者: Arboreal 時間: 2025-3-31 16:18
Klassizistische Antikisierende Dramen, 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作者: CODA 時間: 2025-3-31 21:21 作者: Mobile 時間: 2025-3-31 21:43
Computational Logic and Proof Theory978-3-540-69806-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 銼屑 時間: 2025-4-1 05:07 作者: 輕打 時間: 2025-4-1 06:06
Reine Rechtslehre und Gesetzgebungstechnikw that .. is conservative over .. w.r.t. boolean combinations of .. sentences, for . ≥ 1. In particular, we give a positive answer to a question by R. Kaye, whether the provably recursive functions of .. are exactly the primitive recursive ones.作者: CLAIM 時間: 2025-4-1 13:45 作者: 華而不實(shí) 時間: 2025-4-1 17:36
Zur Manich?ischen UrmenschlehreRice‘s Theorem says that every nontrivial semantic property of programs is undecidable. It this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions.作者: NUDGE 時間: 2025-4-1 19:07
https://doi.org/10.1007/978-3-663-05108-4We prove that the strong Markov‘s rule with only set parameters is admissible in the full set theory with intuitionistic logic mis|The work was supported by Reseach Scientific Foundation of Russian Ministry of Transport作者: CHECK 時間: 2025-4-2 00:06
Resolution, inverse method and the sequent calculus,We discuss the general scheme of building resolution calculi (also called the inverse method) originating from S. Maslov and G. Mints. A survey of resolution calculi for various nonclassical logic is presented, along with several common properties these calculi possess.
