作者: LAVA 時(shí)間: 2025-3-21 21:18
μ-Calculus via Games (Extended Abstract) on labeled graphs. A fundamental connection was established by Emerson and Jutla [.] and subsequently developed by several authors [., ., ., .]. Essentially, the result is that any formula of the μ-calculus expresses the existence of a strategy in a certain game. The idea of such a correspondence c作者: COWER 時(shí)間: 2025-3-22 04:26 作者: Jacket 時(shí)間: 2025-3-22 08:29
On Continuous Normalizationckert, Buchholz and Schwichtenberg. In an extension of the untyped coinductive λ-calculus by void construcors (so-called repetition rules), a primitive recursive normalization function is defined. Compared with other formulations of continuous normalization, this definition is much simpler and there作者: Obstruction 時(shí)間: 2025-3-22 11:42
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middls paper another approach to realizability of propositional formulas is studied. This approach is based on the following informal idea: a formula is realizable if it has a “simple” realization for each substitution. More precisely, logical connectives are interpreted as operations on sets of natural 作者: 儲(chǔ)備 時(shí)間: 2025-3-22 14:19 作者: 儲(chǔ)備 時(shí)間: 2025-3-22 18:00 作者: 個(gè)阿姨勾引你 時(shí)間: 2025-3-23 01:18 作者: ACTIN 時(shí)間: 2025-3-23 02:33
Greibach Normal Form in Algebraically Complete Semiringsguages. In particular, we show that Greibach’s normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chain- and deletion rules depend on their inequational properties (and the idempotency of addition). It follows that these normal 作者: oracle 時(shí)間: 2025-3-23 09:12
Proofnets and Context Semantics for the Additivesed with cut-elimination on MALL sequents. The results extend the program of Gonthier, Abadi, and Lévy, who provided a “geometry of optimal λ-reduction” (context semantics) for λ-calculus and Multiplicative-Exponential Linear Logic (MELL). We integrate three features: a semantics that uses . to imple作者: Nonconformist 時(shí)間: 2025-3-23 12:38 作者: Pamphlet 時(shí)間: 2025-3-23 16:04
Resource Tableaux programs which manipulate mutable data structures. We develop a theory of semantic tableaux for ., so providing an elegant basis for efficient theorem proving tools for .. It is based on the use of an algebra of labels for .’s tableaux to solve the resource-distribution problem, the labels being th作者: nonchalance 時(shí)間: 2025-3-23 18:13
Configuration TheoriesΓ ?. Δ, where Γ and Δ are sequences of partially ordered sets (of events) and ρ is a matrix of monotone maps from the components of Γ to the components of Δ. Such a sequent expresses that whenever a configuration has certain specified subposets of events (Γ), then it extends to a configuration conta作者: 去才蔑視 時(shí)間: 2025-3-23 23:42 作者: 鍍金 時(shí)間: 2025-3-24 04:24
Possible World Semantics for General Storage in Call-By-Value of values of any type, and the generation of new storage cells. We first present a criticism of traditional Strachey semantics for such a language: that it requires us to specify what happens when we read non-existent cells. We then obtain our model by modifying the Strachey semantics to avoid this作者: Pseudoephedrine 時(shí)間: 2025-3-24 07:27 作者: 緩和 時(shí)間: 2025-3-24 12:25 作者: Indent 時(shí)間: 2025-3-24 18:10
The Stuttering Principle Revisited: On the Expressiveness of Nested , and ? Operators in the Logic Lral LTL formulae with given nesting depths of the ‘next’ and ‘until’ operators. This allows us to prove the semantical strictness of three natural hierarchies of LTL formulae, which are parametrized either by the nesting depth of just one of the two operators, or by both of them. As another interest作者: 案發(fā)地點(diǎn) 時(shí)間: 2025-3-24 20:19
Hamburg Studies on Maritime Affairsty as modulus of continuity. The number of repetition rules is locally related to the number of β-reductions necessary to reach the normal form (as represented by the B?hm tree) and the number of applications appearing in this normal form.作者: 偏見 時(shí)間: 2025-3-25 02:21
Hottentots and Harridans: The , Women,re . corresponds to product. The calculus thus obtained is shown to be sound with respect to interpretation in . [.]. Completeness is proven for a restriction of the calculus to finite sequents. As a case study we axiomatise the . memory model, and formally derive a non-trivial property of thread-memory interaction.作者: 出沒 時(shí)間: 2025-3-25 04:17
,United States-Vietnam Relations 1975–7,nally we allow storage of functions. We discuss similarities and differences between our model and Moggi’s model of ground store. A significant difference is that our model does not use monadic decomposition of the function type.作者: Decrepit 時(shí)間: 2025-3-25 07:57
On Continuous Normalizationty as modulus of continuity. The number of repetition rules is locally related to the number of β-reductions necessary to reach the normal form (as represented by the B?hm tree) and the number of applications appearing in this normal form.作者: 平 時(shí)間: 2025-3-25 14:29
Configuration Theoriesre . corresponds to product. The calculus thus obtained is shown to be sound with respect to interpretation in . [.]. Completeness is proven for a restriction of the calculus to finite sequents. As a case study we axiomatise the . memory model, and formally derive a non-trivial property of thread-memory interaction.作者: PHON 時(shí)間: 2025-3-25 17:56 作者: osculate 時(shí)間: 2025-3-25 22:27 作者: HAIRY 時(shí)間: 2025-3-26 00:44 作者: 小故事 時(shí)間: 2025-3-26 04:21 作者: 禁止 時(shí)間: 2025-3-26 10:47
Limitation of liability and insurance,ntially, the result is that any formula of the μ-calculus expresses the existence of a strategy in a certain game. The idea of such a correspondence can be traced back to Büchi and McNaughton who observed a similar property of monadic second order arithmetic (see [.]).作者: Commonplace 時(shí)間: 2025-3-26 13:30 作者: Mundane 時(shí)間: 2025-3-26 19:00
Limitation of liability and insurance, and elimination of chain- and deletion rules depend on their inequational properties (and the idempotency of addition). It follows that these normal form theorems also hold in non-continuous semirings having enough fixed-points.作者: Meager 時(shí)間: 2025-3-26 21:53 作者: 細(xì)查 時(shí)間: 2025-3-27 03:39
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism nondeterminism only in conjunction with loops rather than procedures. We consider both single procedures and systems of mutually recursive procedures. All proofs have been checked with the theorem prover Isabelle/HOL.作者: 運(yùn)動(dòng)吧 時(shí)間: 2025-3-27 08:09 作者: 搜集 時(shí)間: 2025-3-27 13:10 作者: voluble 時(shí)間: 2025-3-27 14:24
Rights and liabilities of the parties,ple realization whatever sets are substituted. Similar definitions may be formulated in arithmetical terms. A few “realizabilities” of this kind are considered and it is proved that all of them give the same finitely axiomatizable logic, namely, the logic of the weak law of excluded middle.作者: Customary 時(shí)間: 2025-3-27 18:58
Heroes, Rogues and Fools: The , Men,es of processes under study. The work reported here begins to bridge the gap between the domain theoretic and verification (model checking) perspectives on probabilistic computation by exhibiting sound and complete logics for probabilistic powerdomains that arise directly from given logics for the underlying domains.作者: obtuse 時(shí)間: 2025-3-27 23:51
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middlple realization whatever sets are substituted. Similar definitions may be formulated in arithmetical terms. A few “realizabilities” of this kind are considered and it is proved that all of them give the same finitely axiomatizable logic, namely, the logic of the weak law of excluded middle.作者: Culpable 時(shí)間: 2025-3-28 02:05
A Logic for Probabilities in Semanticses of processes under study. The work reported here begins to bridge the gap between the domain theoretic and verification (model checking) perspectives on probabilistic computation by exhibiting sound and complete logics for probabilistic powerdomains that arise directly from given logics for the underlying domains.作者: Narcissist 時(shí)間: 2025-3-28 07:18 作者: Dna262 時(shí)間: 2025-3-28 13:46
https://doi.org/10.1057/9781137598738ing corollary we obtain an alternative characterization of LTL languages, which are exactly the regular languages closed under the generalized form of stutter equivalence. We also indicate how to tackle the state-space explosion problem with the help of presented results作者: Bereavement 時(shí)間: 2025-3-28 17:58 作者: 惰性氣體 時(shí)間: 2025-3-28 20:38 作者: PURG 時(shí)間: 2025-3-28 23:41
https://doi.org/10.1007/3-540-45793-3AI Logic; Computer Science Logic; Formal Methods; Higher-Order Logic; Logical Calculi; Logical Foundation作者: dandruff 時(shí)間: 2025-3-29 04:09
978-3-540-44240-0Springer-Verlag Berlin Heidelberg 2002作者: GEN 時(shí)間: 2025-3-29 07:54 作者: 試驗(yàn) 時(shí)間: 2025-3-29 13:52
Limitation of liability and insurance, on labeled graphs. A fundamental connection was established by Emerson and Jutla [.] and subsequently developed by several authors [., ., ., .]. Essentially, the result is that any formula of the μ-calculus expresses the existence of a strategy in a certain game. The idea of such a correspondence c作者: 做作 時(shí)間: 2025-3-29 19:22 作者: 金桌活畫面 時(shí)間: 2025-3-29 21:20 作者: 增減字母法 時(shí)間: 2025-3-30 01:41
Rights and liabilities of the parties,s paper another approach to realizability of propositional formulas is studied. This approach is based on the following informal idea: a formula is realizable if it has a “simple” realization for each substitution. More precisely, logical connectives are interpreted as operations on sets of natural 作者: 不適當(dāng) 時(shí)間: 2025-3-30 05:00
Limitation of liability and insurance,d completeness, are examined using intuitionistic logic. For instance, although every metric space clearly is totally bounded whenever it possesses the Heine-Borel property that every open cover admits of a finite subcover, we show that one cannot expect a constructive proof that any such space is a作者: ferment 時(shí)間: 2025-3-30 09:23
Hamburg Studies on Maritime Affairsd nondeterminism. For total correctness, the literature so far has either restricted recursive procedures to be deterministic or has studied unbounded nondeterminism only in conjunction with loops rather than procedures. We consider both single procedures and systems of mutually recursive procedures作者: Prosaic 時(shí)間: 2025-3-30 14:08 作者: 長(zhǎng)處 時(shí)間: 2025-3-30 20:01 作者: labile 時(shí)間: 2025-3-30 22:31 作者: JIBE 時(shí)間: 2025-3-31 04:35
Hamburg Studies on Maritime Affairsntroduction of the I/O model of proof search [., .], a number of refinements have been proposed with the intention of reducing its degree of non-determinism [., ., ., ., .]. Unfortunately each of these systems has had some limitations. In particular, while the . systems of Cervesato et al. [., .] an作者: Aviary 時(shí)間: 2025-3-31 06:46 作者: 浸軟 時(shí)間: 2025-3-31 12:58 作者: 禍害隱伏 時(shí)間: 2025-3-31 15:46
Heroes, Rogues and Fools: The , Men,tics and the practical perspective of reasoning about probabilistic algorithms. On the theoretical side, the probabilistic powerdomain of Jones and Plotkin represents a significant advance. Further work, especially by Alvarez-Manilla, has greatly improved our understanding of the probabilistic power
