標(biāo)題: Titlebook: Logical Foundations of Computer Science; International Sympos Sergei Artemov,Anil Nerode Conference proceedings 2022 Springer Nature Switze [打印本頁(yè)] 作者: eternal 時(shí)間: 2025-3-21 18:14
書(shū)目名稱Logical Foundations of Computer Science影響因子(影響力)
書(shū)目名稱Logical Foundations of Computer Science影響因子(影響力)學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Logical Foundations of Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science被引頻次
書(shū)目名稱Logical Foundations of Computer Science被引頻次學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science年度引用
書(shū)目名稱Logical Foundations of Computer Science年度引用學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science讀者反饋
書(shū)目名稱Logical Foundations of Computer Science讀者反饋學(xué)科排名
作者: Armada 時(shí)間: 2025-3-21 20:44
,Reducts of?Relation Algebras: The Aspects of Axiomatisability and Finite Representability,odkinson [.]..We also show that the class of representable join semilattice-ordered semigroups is pseudo-universal and it has a recursively enumerable axiomatisation. For this purpose, we introduce representability games for join semilattice-ordered semigroups.作者: 發(fā)酵 時(shí)間: 2025-3-22 03:43
Conference proceedings 2022 Beach, FL, USA, in January 2022.. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and random作者: 破裂 時(shí)間: 2025-3-22 08:31
Computational Properties of Partial Non-deterministic Matrices and Their Logics,idability is lost. Namely, we show that checking if the logics defined by two finite PNmatrices have the same theorems is undecidable. This latter result is obtained by reduction from the undecidable problem of checking universality of term-DAG-automata.作者: 清澈 時(shí)間: 2025-3-22 11:05
,Betwixt Turing and?Kleene, that for this theorem and related results, the difference between the Kleene approach and the Turing-approach-via-codes is ., in that full second-order arithmetic readily comes to the fore in Kleene’s approach, in the guise of Kleene’s quantifier ..作者: Ankylo- 時(shí)間: 2025-3-22 14:53 作者: gastritis 時(shí)間: 2025-3-22 19:30
A Parameterized View on the Complexity of Dependence Logic, and various intractable degrees. Furthermore, we also consider the complexity of the most important variants (data and expression complexity) of the model checking problem by fixing parts of the input.作者: intimate 時(shí)間: 2025-3-22 21:18 作者: 和平主義 時(shí)間: 2025-3-23 05:11 作者: CRATE 時(shí)間: 2025-3-23 08:00 作者: 上坡 時(shí)間: 2025-3-23 11:31
Soundness and Completeness Results for LEA and Probability Semantics, a class of basic models called deductive basic models. We show . is sound and complete with respect to the class of deductive basic models. We also define an axiomatic system . extending . and show it is sound and complete with respect to probability semantics.作者: 雄辯 時(shí)間: 2025-3-23 15:38
On Inverse Operators in Dynamic Epistemic Logic,, we give several soundness/completeness correspondences, which lead to modular proofs of completeness of public announcement logic and epistemic action logic of Baltag-Moss-Solecki extended with inverse operators with respect to suitable classes of MTSs.作者: 幼稚 時(shí)間: 2025-3-23 20:03
,Between Turing and?Kleene, Choice involving . choice functions, going back to Kreisel-Troelstra and intuitionistic analysis. Put another way, we formulate a relation ‘is computationally stronger than’ involving . objects that overcomes (many of) the pitfalls of the Turing and Kleene frameworks.作者: Misgiving 時(shí)間: 2025-3-24 01:35
https://doi.org/10.1007/978-3-030-93100-1artificial intelligence; automata theory; boolean functions; computability and decidability; computer ha作者: IOTA 時(shí)間: 2025-3-24 04:53
978-3-030-93099-8Springer Nature Switzerland AG 2022作者: conifer 時(shí)間: 2025-3-24 07:00 作者: 漫不經(jīng)心 時(shí)間: 2025-3-24 11:07
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588146.jpg作者: 實(shí)施生效 時(shí)間: 2025-3-24 17:21 作者: 杠桿 時(shí)間: 2025-3-24 20:49
,A Logic of?Interactive Proofs,We introduce the probabilistic two-agent justification logic ., a logic in which we can reason about agents that perform interactive proofs. In order to study the growth rate of the probabilities in ., we present a new method of parametrizing . over certain negligible functions. Further, our approach leads to a new notion of zero-knowledge proofs.作者: 一起 時(shí)間: 2025-3-25 02:06 作者: 粗魯?shù)娜?nbsp; 時(shí)間: 2025-3-25 04:17
,A Parametrized Family of?Tversky Metrics Connecting the?Jaccard Distance to?an?Analogue of?the?Norma given finite set..We show that . is a metric if and only if . and .. This result is formally verified in the Lean proof assistant..The extreme points of this parametrized space of metrics are ., the Jaccard distance, and ., an analogue of the normalized information distance of M.?Li, Chen, X.?Li, Ma, and Vitányi (2004).作者: Reclaim 時(shí)間: 2025-3-25 09:32 作者: FIG 時(shí)間: 2025-3-25 14:46
Juan Pablo Aguilera,Jan Bydzovsky,David Fernández-Duquees on long-term stability and change in major aspects of out-of-home mobility. It explores the subjective meaning of mobility over time, perceived changes in mobility and perceived reasons for change, the course of satisfaction in various mobility domains and with life in general, and interindividua作者: acrobat 時(shí)間: 2025-3-25 16:25
David Lehnherr,Zoran Ognjanovi?,Thomas Studermpetitive knowledge processes on a global scale without losiBesides the ongoing concern with the epistemological and theoretical hegemony of the West in African academic practice, the book aims at understanding how knowledge is produced and controlled through the interplay of the politics of knowled作者: 服從 時(shí)間: 2025-3-25 22:46
Yanhong A. Liu,Scott D. Stollermpetitive knowledge processes on a global scale without losiBesides the ongoing concern with the epistemological and theoretical hegemony of the West in African academic practice, the book aims at understanding how knowledge is produced and controlled through the interplay of the politics of knowled作者: 豎琴 時(shí)間: 2025-3-26 01:03
Sérgio Marcelino,Carlos Caleiro,Pedro Filipempetitive knowledge processes on a global scale without losiBesides the ongoing concern with the epistemological and theoretical hegemony of the West in African academic practice, the book aims at understanding how knowledge is produced and controlled through the interplay of the politics of knowled作者: detach 時(shí)間: 2025-3-26 06:16
Eoin Moorempetitive knowledge processes on a global scale without losiBesides the ongoing concern with the epistemological and theoretical hegemony of the West in African academic practice, the book aims at understanding how knowledge is produced and controlled through the interplay of the politics of knowled作者: Formidable 時(shí)間: 2025-3-26 08:53
Shota Motoura,Shin-ya Katsumatampetitive knowledge processes on a global scale without losiBesides the ongoing concern with the epistemological and theoretical hegemony of the West in African academic practice, the book aims at understanding how knowledge is produced and controlled through the interplay of the politics of knowled作者: jovial 時(shí)間: 2025-3-26 14:26 作者: TERRA 時(shí)間: 2025-3-26 17:34
Iosif Petrakis how knowledge is produced and controlled through the interplay of the politics of knowledge and current intellectual discourses in universities in Africa. In this regard, the book calls for African universities to relocate from the position of object to subject in order to gain a form of liberated 作者: DALLY 時(shí)間: 2025-3-26 22:39
Daniel Rogozinmpetitive knowledge processes on a global scale without losiBesides the ongoing concern with the epistemological and theoretical hegemony of the West in African academic practice, the book aims at understanding how knowledge is produced and controlled through the interplay of the politics of knowled作者: licence 時(shí)間: 2025-3-27 04:26 作者: 火花 時(shí)間: 2025-3-27 05:44 作者: exostosis 時(shí)間: 2025-3-27 12:50
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily,entary bound in the complexity of . of resolution proofs . after structural Skolemization. The proofs are based on the elementary relation of resolution derivations with Andrews Skolemization to cut-free .-derivations and of resolution derivations with structural Skolemization to cut-free .-derivati作者: BUDGE 時(shí)間: 2025-3-27 17:08 作者: 狗舍 時(shí)間: 2025-3-27 21:40
,Justification Logic and?Type Theory as?Formalizations of?Intuitionistic Propositional Logic,logic with simply typed . calculus, by introducing a map from justification terms into . terms, which can be viewed as a method of extracting the computational content of the justification terms. Then we examine the interpretation of Kreisel’s addendum in justification logic along with the image of 作者: CHOIR 時(shí)間: 2025-3-28 01:34 作者: cluster 時(shí)間: 2025-3-28 03:27 作者: saphenous-vein 時(shí)間: 2025-3-28 08:04
,Constructive and?Mechanised Meta-Theory of?Intuitionistic Epistemic Logic,ess, they provided the base for a meta-theoretic investigation of IEL, which was continued by Krupski with a proof of cut-elimination, and Su and Sano establishing semantic cut-elimination and the finite model property. However, to the best of our knowledge, no analysis of these results in a constru作者: Frenetic 時(shí)間: 2025-3-28 13:02
,A Parametrized Family of?Tversky Metrics Connecting the?Jaccard Distance to?an?Analogue of?the?Norma given finite set..We show that . is a metric if and only if . and .. This result is formally verified in the Lean proof assistant..The extreme points of this parametrized space of metrics are ., the Jaccard distance, and ., an analogue of the normalized information distance of M.?Li, Chen, X.?Li, 作者: 飛鏢 時(shí)間: 2025-3-28 17:24
A Parameterized View on the Complexity of Dependence Logic,mantics. We start with a list of nine immediate parameterizations for this problem, namely: the number of disjunctions (i.e., splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team, and the arity of depe作者: 豪華 時(shí)間: 2025-3-28 22:37 作者: 不愿 時(shí)間: 2025-3-28 23:04 作者: saturated-fat 時(shí)間: 2025-3-29 05:14 作者: 我不死扛 時(shí)間: 2025-3-29 09:46 作者: sacrum 時(shí)間: 2025-3-29 12:29
,Betwixt Turing and?Kleene,ach and provide a framework for .. Various research programs have been proposed in which higher-order objects, like functions on the real numbers, are . as real numbers, so as to make them amenable to the Turing framework. It is then a natural question whether there is any significant difference bet作者: deadlock 時(shí)間: 2025-3-29 16:57
Computability Models over Categories and Presheaves,], we define canonical computability models over certain categories and appropriate presheaves on them. We study the canonical total computability model over a category . and a covariant presheaf on ., and the canonical partial computability model over a category . with pullbacks and a pullback pres作者: VOC 時(shí)間: 2025-3-29 22:09
,Reducts of?Relation Algebras: The Aspects of Axiomatisability and Finite Representability,le residuated semigroup is representable over a finite base. This result gives a positive solution to Problem 19.17 from the monograph by Hirsch and Hodkinson [.]..We also show that the class of representable join semilattice-ordered semigroups is pseudo-universal and it has a recursively enumerable作者: GOAT 時(shí)間: 2025-3-30 01:39 作者: nocturnal 時(shí)間: 2025-3-30 06:06
Propositional Dynamic Logic with Quantification over Regular Computation Sequences,er computation sequences represented by a given regular expression and states accessible via these computation sequences. This extended language is able to express that there is a computation sequence represented by a given regular expression that leads only to states where a given formula is satisf作者: Ornithologist 時(shí)間: 2025-3-30 09:37
and rational spatial decisions and actions as a focus of research in human geography. Rationality could be reconstituted as a culturally contingent phenomenon, and critical geographical analysis could again contribute to concrete problem-solving, though in a culturally much more informed and embedde作者: violate 時(shí)間: 2025-3-30 15:21 作者: phlegm 時(shí)間: 2025-3-30 17:31
Dag Normann,Sam Sanderseir relevance to the contexts in which they operate? How can such change, particularly at knowledgeproduction 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 curricu作者: colostrum 時(shí)間: 2025-3-30 22:45 作者: gustation 時(shí)間: 2025-3-31 04:46 作者: jungle 時(shí)間: 2025-3-31 05:42 作者: 擔(dān)憂 時(shí)間: 2025-3-31 10:49
,Constructive and?Mechanised Meta-Theory of?Intuitionistic Epistemic Logic,property. Given our constructive and mechanised setting, all these results now bear executable algorithms. We expect that our methods used for mechanising cut-elimination and decidability also extend to other modal logics (and have verified this observation for the classical modal logic K).作者: Deadpan 時(shí)間: 2025-3-31 14:50 作者: 休息 時(shí)間: 2025-3-31 19:06
Propositional Dynamic Logic with Quantification over Regular Computation Sequences,t is guaranteed to accomplish a certain goal. The existential-universal quantifier combination is modelled by neighborhood functions. We prove that a rich fragment of our logic is decidable and .-complete by embedding the fragment into deterministic propositional dynamic logic.作者: 仲裁者 時(shí)間: 2025-4-1 00:33 作者: entreat 時(shí)間: 2025-4-1 03:22
0302-9743 roof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzz978-3-030-93099-8978-3-030-93100-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Negligible 時(shí)間: 2025-4-1 08:33
