標(biāo)題: Titlebook: Hajnal Andréka and István Németi on Unity of Science; From Computing to Re Judit Madarász,Gergely Székely Book 2021 Springer Nature Switzer [打印本頁] 作者: 小缺點 時間: 2025-3-21 18:04
書目名稱Hajnal Andréka and István Németi on Unity of Science影響因子(影響力)
書目名稱Hajnal Andréka and István Németi on Unity of Science影響因子(影響力)學(xué)科排名
書目名稱Hajnal Andréka and István Németi on Unity of Science網(wǎng)絡(luò)公開度
書目名稱Hajnal Andréka and István Németi on Unity of Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Hajnal Andréka and István Németi on Unity of Science被引頻次
書目名稱Hajnal Andréka and István Németi on Unity of Science被引頻次學(xué)科排名
書目名稱Hajnal Andréka and István Németi on Unity of Science年度引用
書目名稱Hajnal Andréka and István Németi on Unity of Science年度引用學(xué)科排名
書目名稱Hajnal Andréka and István Németi on Unity of Science讀者反饋
書目名稱Hajnal Andréka and István Németi on Unity of Science讀者反饋學(xué)科排名
作者: 災(zāi)禍 時間: 2025-3-21 20:42 作者: Emasculate 時間: 2025-3-22 00:29
https://doi.org/10.1007/978-3-031-57077-3e definability of this class of spaces under the interpretation of . as the derived set (of limit points) operation. ???The variety of modal algebras validating the .-th logic is shown to be generated by the powerset algebras of the finite frames with cycle length bounded by .. Moreover each algebra作者: 提名的名單 時間: 2025-3-22 06:41
Guarded Ontology-Mediated Querieslem for the guarded fragment of first-order logic can be applied. For query containment, we discuss how tree automata techniques can be used. Finally, for first-order rewritability, we explain how techniques based on a more sophisticated automata model, known as cost automata, can be exploited.作者: prolate 時間: 2025-3-22 11:57
Semiring Provenance for Guarded Logicsfirst-order logic, dealing with negation by transformation into negation normal form and by semirings of polynomials with a duality on the indeterminates. Here we develop this approach further for the guarded fragment (GF), introduced by Andréka, van Benthem and Németi, based on an analysis of the a作者: 懶惰人民 時間: 2025-3-22 14:44 作者: 極少 時間: 2025-3-22 19:12 作者: 狂怒 時間: 2025-3-23 00:35 作者: 倫理學(xué) 時間: 2025-3-23 04:25 作者: 輕浮思想 時間: 2025-3-23 07:36 作者: 攀登 時間: 2025-3-23 10:44 作者: 狂熱語言 時間: 2025-3-23 17:28
The Meaning of Aristotle’s ‘Ontology’ various parts of this input. Here we investigate this for the model checking problem of guarded logics on finite relational structures. Semiring provenance was originally developed for positive database query languages, to understand which combinations of the atomic facts in a database can be used 作者: Outspoken 時間: 2025-3-23 19:15
https://doi.org/10.1057/9781137274946fects. This is driven primarily by applications to conceptual blending, but other application domains are possible (such as software evolution). The particularity of this extension is a reliance on ordered-enriched categorical structures. This work is dedicated to Hajnal Andréka and István Németi wh作者: aquatic 時間: 2025-3-23 22:25 作者: 情愛 時間: 2025-3-24 04:37 作者: 造反,叛亂 時間: 2025-3-24 07:52
https://doi.org/10.1057/9780230377929matical knowledge. I also discuss the problem of the explanatory role of mathematics in physics and argue that relativistic computation fits very well into the so-called programming account. Relativistic computation reveals an interesting interplay between the empirical realm and the realm of very a作者: engender 時間: 2025-3-24 13:49
https://doi.org/10.1057/978-1-137-56822-9. We explore this analogy further, connecting generalized quantifier theory and modal neighborhood logic. In particular, we find interesting analogies between conservativity for linguistic quantifiers and the locality of modal logic, and between the role of invariances in both fields. Moreover, we p作者: 遭遇 時間: 2025-3-24 17:23 作者: RENAL 時間: 2025-3-24 19:23
https://doi.org/10.1007/978-94-011-2630-4(.) be the class of all .-structures isomorphic to concrete algebras of binary relations with concrete interpretations for symbols in ., and let .(.) be the class of .-structures isomorphic to concrete algebras of binary relations over a finite base. To prove that membership of .(.) or .(.) for fini作者: overrule 時間: 2025-3-25 00:52 作者: AMOR 時間: 2025-3-25 06:30
https://doi.org/10.1007/978-94-011-2751-6ery complete atomic weakly associative relation algebra is isomorphic with the relativization of a set relation algebra to a symmetric and reflexive binary relation, by insuring that the atoms of the set relation algebra and its relativization are orbits of single sequences under a group of permutat作者: oracle 時間: 2025-3-25 07:52 作者: 信徒 時間: 2025-3-25 15:38
https://doi.org/10.1007/978-94-017-6580-0ry used to analyse the structure of logical theories can make it difficult to see how such an idea could be coherent or workable: for in that theory, properties and relations are constructed as sets of (tuples of) individuals. In this paper, I look at three ways in which structuralists might hope fo作者: 木訥 時間: 2025-3-25 19:27 作者: Capitulate 時間: 2025-3-25 20:05
Algebraic Logic and Knowledge Basesheir interaction with practical problems arising in computer science might be very productive. In this paper we study the equivalence problem for knowledge bases. Our interest is to find out how the informational equivalence is related to the logical description of knowledge. The main objectives of 作者: 配偶 時間: 2025-3-26 03:22
Guarded Ontology-Mediated Queriese representation formalism inspired by the guarded fragment of first-order logic, while conjunctive queries represent a prominent database query language that lies at the core of relational calculus (i.e., first-order queries). For such guarded OMQs we discuss three main algorithmic tasks: query eva作者: jovial 時間: 2025-3-26 08:03
Semiring Provenance for Guarded Logics various parts of this input. Here we investigate this for the model checking problem of guarded logics on finite relational structures. Semiring provenance was originally developed for positive database query languages, to understand which combinations of the atomic facts in a database can be used 作者: 要求比…更好 時間: 2025-3-26 10:01
Implicit Partiality of Signature Morphisms in Institution Theoryfects. This is driven primarily by applications to conceptual blending, but other application domains are possible (such as software evolution). The particularity of this extension is a reliance on ordered-enriched categorical structures. This work is dedicated to Hajnal Andréka and István Németi wh作者: 緯度 時間: 2025-3-26 15:30
The Four Essential Aristotelian Syllogisms, via Substitution and Symmetryinity of syllogisms could be obtained as substitution instances of finitely many syllogistic forms, further reduced by exploiting symmetry, in particular the premises’ independence of their order. A consensus subsequently emerged that there were 24 valid assertoric syllogistic forms. A more modern c作者: Synthesize 時間: 2025-3-26 19:32
Adding Guarded Constructions to the Syllogistic(count) noun and . a transitive verb. It is known that both the classical and relational syllogistic admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete (the latter only when . is allowed). In this article, we extend the classical and relational syll作者: 吞沒 時間: 2025-3-26 23:11 作者: 考得 時間: 2025-3-27 04:08 作者: Gossamer 時間: 2025-3-27 09:20
Modal Logics that Bound the Circumference of Transitive Framesthan . and no strictly ascending chains. The case . is the G?del-L?b provability logic. Each logic is axiomatised by adding a single axiom to K4, and is shown to have the finite model property and be decidable. ???We then consider a number of extensions of these logics, including restricting to refl作者: Inveterate 時間: 2025-3-27 09:32
Undecidability of Algebras of Binary Relations(.) be the class of all .-structures isomorphic to concrete algebras of binary relations with concrete interpretations for symbols in ., and let .(.) be the class of .-structures isomorphic to concrete algebras of binary relations over a finite base. To prove that membership of .(.) or .(.) for fini作者: 揉雜 時間: 2025-3-27 17:22 作者: TRUST 時間: 2025-3-27 19:45 作者: 緊張過度 時間: 2025-3-28 00:58 作者: 清晰 時間: 2025-3-28 04:51
Freeing Structural Realism from Model Theoryry used to analyse the structure of logical theories can make it difficult to see how such an idea could be coherent or workable: for in that theory, properties and relations are constructed as sets of (tuples of) individuals. In this paper, I look at three ways in which structuralists might hope fo作者: 銼屑 時間: 2025-3-28 07:17
In the Footsteps of Hilbert: The Andréka-Németi Group’s Logical Foundations of Theories in Physics. In particular, it is an analytic art for choosing axioms but, at the same time, it has to include dynamically synthetic procedures and meta-theoretical reflections. Axioms have to be useful, or capture something, or help as part of explanations. The Andréka-Németi group use several formal axiomati作者: MIRE 時間: 2025-3-28 13:04
https://doi.org/10.1057/9780230377929bstract mathematical principles that even exceed standard mathematics and suggests, that such principles might play an explanatory role. I also argue that relativistic computation does not have some of the weaknesses of other hypercomputational models, thus it is particularly attractive for the philosophy of mathematics.作者: 沙文主義 時間: 2025-3-28 17:34 作者: nerve-sparing 時間: 2025-3-28 22:10
The Significance of Relativistic Computation for the Philosophy of Mathematicsbstract mathematical principles that even exceed standard mathematics and suggests, that such principles might play an explanatory role. I also argue that relativistic computation does not have some of the weaknesses of other hypercomputational models, thus it is particularly attractive for the philosophy of mathematics.作者: absorbed 時間: 2025-3-29 01:11 作者: Bouquet 時間: 2025-3-29 04:17 作者: Obstacle 時間: 2025-3-29 10:06
https://doi.org/10.1007/978-94-011-2630-4ational theory of .(.) is undecidable whenever . includes the boolean operators and composition. We give an exposition of the reduction from the tiling problem and the reduction from the group embedding problem, and summarize what we know about the undecidability of finite membership of .(.) and of .(.) for different signatures ..作者: 潛移默化 時間: 2025-3-29 12:55 作者: 陳舊 時間: 2025-3-29 19:11 作者: Flat-Feet 時間: 2025-3-29 22:53 作者: 迷住 時間: 2025-3-30 00:49 作者: Infantry 時間: 2025-3-30 05:14 作者: insightful 時間: 2025-3-30 10:41 作者: Vulvodynia 時間: 2025-3-30 14:56
https://doi.org/10.1007/978-1-137-36559-0 scientific methodology is close to Hilbert’s conceptions of how science should be done ideally. In this paper, we compare Formica’s reading of Hilbert’s axiomatic method to the method used by the Andréka-Németi group.作者: 嘮叨 時間: 2025-3-30 20:33
Adding Guarded Constructions to the Syllogisticlete. It follows, on the assumption that ., that neither extension admits a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when . is allowed. We also show that further extending these systems with noun-complementation in sentence-subjects results in logics which are .-complete.作者: DOSE 時間: 2025-3-31 00:04
Blow Up and Blur Constructions in Algebraic Logicrred to as its minimal completion, is also in .. From our hitherto obtained algebraic results, we show, employing the powerful machinery of algebraic logic, that the celebrated Henkin–Orey omitting types theorem fails dramatically for . even if we allow certain generalized models that are only locally classical.作者: intention 時間: 2025-3-31 03:55
In the Footsteps of Hilbert: The Andréka-Németi Group’s Logical Foundations of Theories in Physics scientific methodology is close to Hilbert’s conceptions of how science should be done ideally. In this paper, we compare Formica’s reading of Hilbert’s axiomatic method to the method used by the Andréka-Németi group.作者: 龍蝦 時間: 2025-3-31 08:05
2211-2758 ny applications of Tarskian algebraic logic.This book features more than 20 papers that celebrate the work of Hajnal Andréka and István Németi. It illustrates an interaction between developing and applying mathematical logic. The papers offer new results as well as surveys in areas influenced by the作者: 磨坊 時間: 2025-3-31 11:15
https://doi.org/10.1007/978-1-4613-8618-6ledge bases. Our interest is to find out how the informational equivalence is related to the logical description of knowledge. The main objectives of this paper are logically-geometrically equivalent and .-isotypic knowledge bases. We will see that these notions give us a good characterization of knowledge bases.作者: Nomadic 時間: 2025-3-31 16:05 作者: CT-angiography 時間: 2025-3-31 19:08
https://doi.org/10.1007/978-94-011-2751-6inary relation, by insuring that the atoms of the set relation algebra and its relativization are orbits of single sequences under a group of permutations of the underlying set. This sharpening of the relative representation theorem was first proved for the Resek-Thompson Theorem in 1989.作者: Disk199 時間: 2025-4-1 00:47
https://doi.org/10.1007/978-94-017-6580-0properties and relations are constructed as sets of (tuples of) individuals. In this paper, I look at three ways in which structuralists might hope for an alternative: by appealing to predicate-functor logic, Tractarian geometry, or cylindric algebras. I argue that the first two are problematic, but that the third is promising.作者: Interstellar 時間: 2025-4-1 04:04
Book 2021and applying mathematical logic. The papers offer new results as well as surveys in areas influenced by these two outstanding researchers. They also provide details on the after-life of some of their initiatives..Computer science connects the papers in the first part of the book. The second part con
