標題: Titlebook: Computer Science Logic; 23rd International W Erich Gr?del,Reinhard Kahle Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 [打印本頁] 作者: DEIGN 時間: 2025-3-21 19:59
書目名稱Computer Science Logic影響因子(影響力)
書目名稱Computer Science Logic影響因子(影響力)學科排名
書目名稱Computer Science Logic網絡公開度
書目名稱Computer Science Logic網絡公開度學科排名
書目名稱Computer Science Logic被引頻次
書目名稱Computer Science Logic被引頻次學科排名
書目名稱Computer Science Logic年度引用
書目名稱Computer Science Logic年度引用學科排名
書目名稱Computer Science Logic讀者反饋
書目名稱Computer Science Logic讀者反饋學科排名
作者: cardiac-arrest 時間: 2025-3-21 21:11 作者: 葡萄糖 時間: 2025-3-22 04:13 作者: Credence 時間: 2025-3-22 07:46 作者: 躲債 時間: 2025-3-22 09:46 作者: 憂傷 時間: 2025-3-22 14:47 作者: 憂傷 時間: 2025-3-22 19:17
Algebra for Tree Languagesest algebra. (Other frameworks in the literature include pre-clones of ésik and Weil or tree algebra of Wilke. Another approach is to forget about algebra and study the structure of a tree automaton.)作者: insomnia 時間: 2025-3-22 23:27
Algorithmic Analysis of Array-Accessing Programsity problem, while undecidable in general, is (1) .-complete for programs in which the array-accessing .-loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words.作者: Cocker 時間: 2025-3-23 03:51 作者: Generalize 時間: 2025-3-23 08:32
Conference proceedings 2009The conference series started as a programme of International Workshops on Computer Science Logic, and then at its sixth meeting became the Annual C- ference of the EACSL. This conference was the 23rd meeting and 18th EACSL conference; it was organized at the Department of Mathematics, Faculty of S-作者: anticipate 時間: 2025-3-23 10:54
https://doi.org/10.1007/978-3-031-46065-4and we characterize our nets by a variant of Lamarche’s correctness criterion for essential nets. The correspondence between explicit substitutions and jumps simplifies the already known correspondence between explicit substitutions and proof net exponential cuts.作者: AFFIX 時間: 2025-3-23 16:44
https://doi.org/10.1007/978-3-658-08080-8ich could not be dealt with in the previous approach. Our method also works as a heuristic principle for finding appropriate rules for axioms located at levels higher than .. The case study of Abelian and ?ukasiewicz logic is outlined.作者: Mercurial 時間: 2025-3-23 19:54 作者: 的闡明 時間: 2025-3-24 01:58
https://doi.org/10.1007/978-3-642-11524-0tion is limited to intersections not containing reference types, and the reference type constructor can only be applied to closed types. The type assignment is shown to be safe, and when restricted to pure .-calculus, as expressive as the full standard type assignment system with intersection and universally quantified types.作者: Rebate 時間: 2025-3-24 03:41 作者: 偏離 時間: 2025-3-24 06:57 作者: 鬧劇 時間: 2025-3-24 13:27 作者: enlist 時間: 2025-3-24 17:24 作者: cardiovascular 時間: 2025-3-24 22:37 作者: Hemodialysis 時間: 2025-3-25 01:37
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automatalinear tree automata with alternation restricted to the choice of path in the input tree. Despite their simplicity, LGA recognize sets of arbitrary high Borel rank. The actual richness of LGA is revealed by the height of their Wadge hierarchy: (..)..作者: Bureaucracy 時間: 2025-3-25 06:17
0302-9743 11, 2009. The conference series started as a programme of International Workshops on Computer Science Logic, and then at its sixth meeting became the Annual C- ference of the EACSL. This conference was the 23rd meeting and 18th EACSL conference; it was organized at the Department of Mathematics, Fac作者: 憤憤不平 時間: 2025-3-25 08:55 作者: 合唱隊 時間: 2025-3-25 12:47
https://doi.org/10.1007/978-1-349-17385-3the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. This is a pilot study in using proof-theoretic methods for certified algorithms in exact real arithmetic.作者: Working-Memory 時間: 2025-3-25 19:45
Typed Applicative Structures and Normalization by Evaluation for System?F,algorithm is verified through a general model construction using typed applicative structures, called type and object structures. Both soundness and completeness of NbE are conceived as an instance of a single fundamental theorem.作者: stroke 時間: 2025-3-25 23:43 作者: eustachian-tube 時間: 2025-3-26 03:33 作者: 竊喜 時間: 2025-3-26 04:48
Peter Pan and Literature for the Child,-order logic and tree automata, our findings translate to analogous results on the extension of first-order logic by cardinality quantifiers over injectively presentable Rabin-automatic structures, generalizing the work of Kuske and Lohrey.作者: 小隔間 時間: 2025-3-26 10:40
Natural Chemistry of Caspian Sea Waters,ect calculus fully embeds in a model of the enriched calculus. The latter means that our enriched effect calculus is applicable to arbitrary computational effects, answering in the positive a question of Benton and Wadler (LICS 1996).作者: 過份 時間: 2025-3-26 14:30 作者: 致敬 時間: 2025-3-26 20:32
Cardinality Quantifiers in MLO over Trees-order logic and tree automata, our findings translate to analogous results on the extension of first-order logic by cardinality quantifiers over injectively presentable Rabin-automatic structures, generalizing the work of Kuske and Lohrey.作者: antecedence 時間: 2025-3-27 00:10 作者: 無表情 時間: 2025-3-27 04:25
Conference proceedings 2009n Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The awardrecipient for 2009 was Jakob Nordstr¨ om. Citation of the award, abstract of the thesis, and a biographical sketch of the recipient may be found at the end of the proceedings. The award was sponsored for the years 2007–2009 by Logitech S.A.作者: Obstreperous 時間: 2025-3-27 06:33 作者: Muffle 時間: 2025-3-27 13:16
Forcing and Type Theorying given that Cohen’s original discovery of forcing was “motivated by an attempt to prove analysis consistent” and the idea that statements which seemed to involve infinities “could be reduced to pieces of finite informations” [9]. The interest of combining forcing and realizability was pointed out作者: tinnitus 時間: 2025-3-27 15:41
Functional Interpretations of Intuitionistic Linear Logicntuitionistic logic via embeddings of .. into ... The main difference from previous work of the second author is that in intuitionistic linear logic the interpretations of !. are simpler (at the cost of an asymmetric interpretation of pure ..) and simultaneous quantifiers are no longer needed for th作者: 宣稱 時間: 2025-3-27 20:34 作者: 碎片 時間: 2025-3-28 01:26 作者: expire 時間: 2025-3-28 04:37
Tree-Width for First Order Formulaee show that on classes of formulae of bounded fotw, model checking is fixed parameter tractable, with parameter the length of the formula. This is done by translating a formula . with fotw(.)?
作者: Cerumen 時間: 2025-3-28 08:42
Algorithmic Analysis of Array-Accessing Programsr software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachabil作者: 出生 時間: 2025-3-28 11:24
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problemslems including arc-consistency, (.,.)-consistency, .-consistency, .-minimality, and refinements of arc-consistency such as peek arc-consistency and singleton arc-consistency. Our main result is that for any two instances of the abstract pebble game where the first satisfies the additional condition 作者: breadth 時間: 2025-3-28 17:49
Cardinality Quantifiers in MLO over Treeser the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order..Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over finitely branching trees, which is notable for not al作者: Foregery 時間: 2025-3-28 20:58
From Coinductive Proofs to Exact Real Arithmetictruct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads作者: 凹槽 時間: 2025-3-29 02:11
On the Relation between Sized-Types Based Termination and Semantic Labellingtypes annotated with size expressions and Girard’s reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the semantics of its arguments, and applies to any rewrite sys作者: FLAX 時間: 2025-3-29 05:26
Expanding the Realm of Systematic Proof Theoryon intuitionistic-substructural axioms and single-conclusion (hyper)sequent calculi, we define a hierarchy on Hilbert axioms in the language of classical linear logic without exponentials. We then give a systematic procedure to transform axioms up to the level . of the hierarchy into inference rules作者: cruise 時間: 2025-3-29 07:25 作者: 安撫 時間: 2025-3-29 12:05 作者: 慟哭 時間: 2025-3-29 15:34 作者: Conjuction 時間: 2025-3-29 22:58 作者: SIT 時間: 2025-3-30 01:23
Enriching an Effect Calculus with Linear Typesssing linear aspects of computational effects; for example, the linear usage of imperative features such as state and/or continuations..Our main syntactic result is the conservativity of the enriched effect calculus over a basic . without linear primitives (closely related to Moggi’s ., Filinski’s .作者: facetious 時間: 2025-3-30 05:39 作者: 小步舞 時間: 2025-3-30 08:37
Functional Interpretations of Intuitionistic Linear Logicntuitionistic logic via embeddings of .. into ... The main difference from previous work of the second author is that in intuitionistic linear logic the interpretations of !. are simpler (at the cost of an asymmetric interpretation of pure ..) and simultaneous quantifiers are no longer needed for the characterisation of the interpretations.作者: 易于 時間: 2025-3-30 14:23
On the Word Problem for ,-Categories, and the Properties of Two-Way Communication algorithm, in particular, handles the “additive units” and demonstrates that the complications introduced by the presence of these units can be managed in an efficient manner..This problem is directly related to the problem of determining the equivalence between (finite) processes communicating on a two-way channel.作者: Lipoma 時間: 2025-3-30 19:04
https://doi.org/10.1007/978-3-642-04027-6algorithmic analysis; computer; computer science; decidability; forcing; formal languages; intuitionistic 作者: Cupidity 時間: 2025-3-30 21:06 作者: milligram 時間: 2025-3-31 04:20 作者: 注射器 時間: 2025-3-31 08:35 作者: acquisition 時間: 2025-3-31 11:22 作者: Pruritus 時間: 2025-3-31 14:34
Fixed-Point Definability and Polynomial TimeMy talk will be a survey of recent results about the quest for a logic capturing polynomial time.作者: CURB 時間: 2025-3-31 17:45
Kleene’s Amazing Second Recursion TheoremThis little gem is stated unbilled and proved (completely) in the last two lines of .2 of the short note Kleene (1938).作者: 巨頭 時間: 2025-3-31 23:15
Computer Science Logic978-3-642-04027-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 極深 時間: 2025-4-1 04:13
https://doi.org/10.1007/978-3-319-40997-9ing given that Cohen’s original discovery of forcing was “motivated by an attempt to prove analysis consistent” and the idea that statements which seemed to involve infinities “could be reduced to pieces of finite informations” [9]. The interest of combining forcing and realizability was pointed out in the proof of Goodman’s Theorem [5].作者: 補助 時間: 2025-4-1 06:13
,: Hiding Mortality in Plain Sight,ntuitionistic logic via embeddings of .. into ... The main difference from previous work of the second author is that in intuitionistic linear logic the interpretations of !. are simpler (at the cost of an asymmetric interpretation of pure ..) and simultaneous quantifiers are no longer needed for the characterisation of the interpretations.作者: 埋葬 時間: 2025-4-1 13:14
Joanne O’Mara,Linda Laidlaw,Jill Blackmore algorithm, in particular, handles the “additive units” and demonstrates that the complications introduced by the presence of these units can be managed in an efficient manner..This problem is directly related to the problem of determining the equivalence between (finite) processes communicating on a two-way channel.作者: 極為憤怒 時間: 2025-4-1 16:26
Law and Ethics Protecting Cultural Objects, former ones. In particular, very few effective characterizations of tree language classes are known. Since for words most known characterizations are obtained using algebra, it seems to be a good idea to look for an algebra for tree languages. I will talk about one such attempt, which is called for作者: 預知 時間: 2025-4-1 19:04
https://doi.org/10.1007/978-3-319-40997-9ing given that Cohen’s original discovery of forcing was “motivated by an attempt to prove analysis consistent” and the idea that statements which seemed to involve infinities “could be reduced to pieces of finite informations” [9]. The interest of combining forcing and realizability was pointed out作者: 代替 時間: 2025-4-1 23:50
,: Hiding Mortality in Plain Sight,ntuitionistic logic via embeddings of .. into ... The main difference from previous work of the second author is that in intuitionistic linear logic the interpretations of !. are simpler (at the cost of an asymmetric interpretation of pure ..) and simultaneous quantifiers are no longer needed for th作者: overrule 時間: 2025-4-2 06:15
Monetary Regulation: Regrets and Hopes, type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, called type and object structures. Both soundness and c
