標(biāo)題: Titlebook: Logical Foundations of Computer Science; International Sympos Sergei Artemov,Anil Nerode Conference proceedings 2009 Springer-Verlag Berlin [打印本頁(yè)] 作者: ARRAY 時(shí)間: 2025-3-21 18:48
書目名稱Logical Foundations of Computer Science影響因子(影響力)
書目名稱Logical Foundations of Computer Science影響因子(影響力)學(xué)科排名
書目名稱Logical Foundations of Computer Science網(wǎng)絡(luò)公開度
書目名稱Logical Foundations of Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logical Foundations of Computer Science被引頻次
書目名稱Logical Foundations of Computer Science被引頻次學(xué)科排名
書目名稱Logical Foundations of Computer Science年度引用
書目名稱Logical Foundations of Computer Science年度引用學(xué)科排名
書目名稱Logical Foundations of Computer Science讀者反饋
書目名稱Logical Foundations of Computer Science讀者反饋學(xué)科排名
作者: HAIRY 時(shí)間: 2025-3-21 22:19
Stefano Aguzzoli,Simone Bova,Vincenzo Marraknowledgeproduction and distribution levels, be undertaken, without falling into an intellectual and discursive ghettoization in the global context? What then is the role of academics, policy makers and curricu978-94-6300-842-6作者: 名次后綴 時(shí)間: 2025-3-22 00:26
Arnon Avron,Anna Zamanskyrporate organizational practices, commodification and commercialization of knowledge, dictated by market ethics, dominate university practices in Africa with negative impact on professional values, norms and be978-94-6300-845-7作者: 易于出錯(cuò) 時(shí)間: 2025-3-22 05:58 作者: 賄賂 時(shí)間: 2025-3-22 09:14 作者: Resistance 時(shí)間: 2025-3-22 16:23
Amélie Gheerbrant,Balder ten Caterporate organizational practices, commodification and commercialization of knowledge, dictated by market ethics, dominate university practices in Africa with negative impact on professional values, norms and be978-94-6300-845-7作者: 圓桶 時(shí)間: 2025-3-22 18:58
A Clausal Approach to Proof Analysis in Second-Order Logic,, we discuss the problems that have to be solved to extend CERES. to the complete class of second-order proofs. Finally, the method is applied to a simple mathematical proof that involves induction and comprehension and the resulting proof is analyzed.作者: Perennial長(zhǎng)期的 時(shí)間: 2025-3-23 00:51 作者: Afflict 時(shí)間: 2025-3-23 05:24
0302-9743 igent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.978-3-540-92686-3978-3-540-92687-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: hemophilia 時(shí)間: 2025-3-23 09:32 作者: CHYME 時(shí)間: 2025-3-23 09:53
Pedro Baltazar,Paulo Mateusn of knowledge, making it increasingly unresponsive to local social and cultural needs. Corporate organizational practices, commodification and commercialization of knowledge, dictated by market ethics, dominate university practices in Africa with negative impact on professional values, norms and be作者: 盲信者 時(shí)間: 2025-3-23 17:19 作者: 允許 時(shí)間: 2025-3-23 18:42 作者: fastness 時(shí)間: 2025-3-23 22:43 作者: legitimate 時(shí)間: 2025-3-24 06:18 作者: 羅盤 時(shí)間: 2025-3-24 10:15
Renata de Freitas,Sheila R. M. Veloso,Paulo A. S. Veloso,Petrucio Vianan of knowledge, making it increasingly unresponsive to local social and cultural needs. Corporate organizational practices, commodification and commercialization of knowledge, dictated by market ethics, dominate university practices in Africa with negative impact on professional values, norms and be作者: 傾聽 時(shí)間: 2025-3-24 13:52 作者: 猛然一拉 時(shí)間: 2025-3-24 17:28 作者: 獨(dú)裁政府 時(shí)間: 2025-3-24 22:43
Stefan Hetzl,Alexander Leitsch,Daniel Weller,Bruno Woltzenlogel Paleoakes scholars through a critical review of the issues facing researchers and educators in the last years of the first decade of the twenty-first century. Refusing to assume the reader’s familiarity with such issues but concurrently rebuffing the tendency to dumb down such complex issues, the book se作者: 褪色 時(shí)間: 2025-3-24 23:17
Rosalie Iemhoff,George Metcalfeed in some manner. This excludes a huge number of assorted phenomena from our efforts to produce knowledge—dimensions of the physical, social, cultural, political, psychological, philosophical, and educational cosmos that are often the most important dynamics shaping the nature of human existence..T作者: Directed 時(shí)間: 2025-3-25 03:23 作者: Neonatal 時(shí)間: 2025-3-25 07:31
Uwe Keller,Stijn Heymans the frequent closed itemsets, while the associated supports could be smaller than the exact ones because some globally frequent closed itemsets might be not locally frequent in some partitions. To avoid an expensive post-processing phase, needed to compute exact global results, we use a method to a作者: 逃避責(zé)任 時(shí)間: 2025-3-25 14:48 作者: 吵鬧 時(shí)間: 2025-3-25 16:49
Completeness Results for Memory Logics,ify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided.作者: FIG 時(shí)間: 2025-3-25 22:18 作者: Temporal-Lobe 時(shí)間: 2025-3-26 01:34
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings,s series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled .-free finite and .-posets and on languages of labelled countable and scattered linear orderings.作者: agenda 時(shí)間: 2025-3-26 06:25
Positive Fork Graph Calculus,urrences of complementation. We show that this graph calculus is sound, complete and decidable. Moreover, the playful nature of this calculus renders it much more intuitive than its equational counterpart.作者: 無(wú)所不知 時(shí)間: 2025-3-26 10:13 作者: 大方一點(diǎn) 時(shí)間: 2025-3-26 14:46
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System,y two different approaches, to estimate the asymptotic fraction of intuitionistic tautologies among classical tautologies, obtaining the same results for both. Our results justify informal statements such as “about 5/8 of classical tautologies are intuitionistic”.作者: 腐爛 時(shí)間: 2025-3-26 17:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588147.jpg作者: dissent 時(shí)間: 2025-3-27 00:54
https://doi.org/10.1007/978-3-540-92687-0Automat; automated deduction; complexity; game theory; interactive theorem proving; logic; theorem proving作者: Prosaic 時(shí)間: 2025-3-27 04:03 作者: Carbon-Monoxide 時(shí)間: 2025-3-27 05:36
Logical Foundations of Computer Science978-3-540-92687-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: forbid 時(shí)間: 2025-3-27 10:18
, with Strategy Contexts and Bounded Memory,milar formalisms (., .*, Game Logic, Strategy Logic,?...). We?then address the problem of model-checking for our logics, especially we provide a . algorithm for the sublogics involving only memoryless strategies and an . algorithm for the bounded-memory case.作者: 天然熱噴泉 時(shí)間: 2025-3-27 14:31 作者: 展覽 時(shí)間: 2025-3-27 19:09 作者: neolith 時(shí)間: 2025-3-28 00:34 作者: 松果 時(shí)間: 2025-3-28 03:28
The Logic of Proofs as a Foundation for Certifying Mobile Computation,nstructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . ensures correct . out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.作者: 戰(zhàn)勝 時(shí)間: 2025-3-28 10:10
Games on Strings with a Limited Order Relation,r relation and the usual (linear) order relation, and a finite number of unary predicates. On the basis of such conditions, we outline a polynomial (in the size of the input strings) algorithm to compute the “remoteness” of a game and to determine the optimal strategies/moves for both players.作者: 發(fā)誓放棄 時(shí)間: 2025-3-28 14:17
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics, objects of the systems are sequent rules. Here, the framework is extended to cover derivability of the admissible rules of intermediate logics and a wider class of modal logics, in this case, by taking hypersequent rules as the basic objects.作者: 知識(shí) 時(shí)間: 2025-3-28 17:44
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination,erizing strong and standard cut-elimination a stronger criterion of density is required. Modular semantics based on non-deterministic matrices are provided for every coherent canonical signed calculus.作者: Estrogen 時(shí)間: 2025-3-28 18:49
The NP-Completeness of Reflected Fragments of Justification Logics,ange of justification logics, pure and hybrid alike. This paper shows that, under reasonable additional restrictions, these reflected fragments are NP-complete, thereby proving a matching lower bound.作者: Feature 時(shí)間: 2025-3-29 02:07
Taming Modal Impredicativity: Superlazy Reduction,This makes the overall cost of reducing a proof net finite and predictable. Specifically, superlazy reduction applied to any pure proof nets takes primitive recursive time. Moreover, any primitive recursive function can be computed by a pure proof net via superlazy reduction.作者: 彎曲的人 時(shí)間: 2025-3-29 05:44 作者: overshadow 時(shí)間: 2025-3-29 08:13
A Relational Model of a Parallel and Non-deterministic ,-Calculus, semantics (based on the . and . intuitions underlying our two additional operations). We describe the interpretation of this calculus in our model and show that this interpretation is sensible with respect to our operational semantics: a term converges if, and only if, it has a non-empty interpretation.作者: Incorporate 時(shí)間: 2025-3-29 13:03 作者: 項(xiàng)目 時(shí)間: 2025-3-29 18:00
0302-9743 Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical 作者: 展覽 時(shí)間: 2025-3-29 21:21
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras,lgebras. We give an explicit combinatorial description of the category that is dual to finite BL-algebras. Building on this, we obtain detailed structural information on the locally finite subvarieties of BL-algebras that are analogous to Grigolia’s subvarieties of finite-valued MV-algebras. As an i作者: Insatiable 時(shí)間: 2025-3-30 02:26
Completeness Results for Memory Logics,ify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided.作者: 講個(gè)故事逗他 時(shí)間: 2025-3-30 06:37
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination,gical rules where exactly one occurrence of a connective is introduced and no other connective is mentioned. Cut-elimination in such systems is fully characterized by a syntactic constructive criterion of coherence. In this paper we extend the theory of canonical systems to the considerably more gen作者: 說(shuō)笑 時(shí)間: 2025-3-30 10:35 作者: Foment 時(shí)間: 2025-3-30 12:31 作者: Harass 時(shí)間: 2025-3-30 19:36
The Logic of Proofs as a Foundation for Certifying Mobile Computation,ate component. Dubbed the ., our language caters for both code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . ensu作者: debunk 時(shí)間: 2025-3-30 21:15 作者: 暴發(fā)戶 時(shí)間: 2025-3-31 03:25
A Relational Model of a Parallel and Non-deterministic ,-Calculus,resent paper, we study the non-deterministic features of this model. Unlike most traditional approaches, our way of interpreting non-determinism does not require any additional powerdomain construction. We show that our model provides a straightforward semantics of . (. convergence) by means of . of作者: 繁殖 時(shí)間: 2025-3-31 08:46 作者: monochromatic 時(shí)間: 2025-3-31 09:35
Taming Modal Impredicativity: Superlazy Reduction,redicativity causing cut-elimination to be problematic from a complexity point of view. Modal impredicativity occurs when, during reduction, the conclusion of a residual of a box . interacts with a node that belongs to the proof net . another residual of .. Technically speaking, . is a new notion of作者: HARP 時(shí)間: 2025-3-31 13:25 作者: somnambulism 時(shí)間: 2025-3-31 17:31
Games on Strings with a Limited Order Relation,sufficient conditions for Spoiler/Duplicator to win games played on finite structures with a limited order relation, that lies in between the successor relation and the usual (linear) order relation, and a finite number of unary predicates. On the basis of such conditions, we outline a polynomial (i作者: Chauvinistic 時(shí)間: 2025-3-31 22:59
Complete Axiomatizations of ,, ,,, and ,,, on Finite Trees,node-labeled sibling-ordered trees. We show by a uniform argument, that our axiomatizations are complete, i.e., in each of our logics, every formula which is valid on the class of finite trees is provable using our axioms. We are interested in this class of structures because it allows to represent 作者: 并置 時(shí)間: 2025-4-1 03:22 作者: cognizant 時(shí)間: 2025-4-1 07:00
