作者: ASSAY 時間: 2025-3-21 22:49 作者: lambaste 時間: 2025-3-22 01:54 作者: 燒烤 時間: 2025-3-22 05:27 作者: exquisite 時間: 2025-3-22 10:15 作者: Admire 時間: 2025-3-22 14:48
Endocannabinoids and Their Synthetic Analogsed to a model . of second order dependent type theory in a . way, i.e. for all formulas ., . is true in . if and only if . is inhabited in .. Here we prove this equivalence for models . that are full models of classical second order predicate logic. The extension of . to . is constructed by adding t作者: Admire 時間: 2025-3-22 19:51 作者: 噱頭 時間: 2025-3-23 00:21
Presheaf models for concurrency,s calculi. Traditional models like synchronisation trees and event structures have been shown to embed fully and faithfully in particular presheaf models in such a way that bisimulation, expressed through the presence of a span of open maps, is conserved. As is shown in the work of Joyal and Moerdij作者: 寵愛 時間: 2025-3-23 03:58
Directed virtual reductions,tion obtained from the “geometry of interaction” interpretation of λ-calculus [5]..The calculus is obtained by synchronizing another graphical local calculus presented in “l(fā)ocal and asynchronous beta-reduction”: . [4]. This synchronization makes it easier to mechanize than general virtual reductions作者: 預(yù)示 時間: 2025-3-23 06:36
Bounded-variable fixpoint queries are PSPACE-complete,blem of deciding whether a closed fixpoint formula using only 2 individual variables is satisfied in this database is PSPACE-complete. This clarifies the issues raised by Vardi in [Var95]. We study also the complexity of query evaluation for a number of restrictions of fixpoint logic. In particular 作者: 伸展 時間: 2025-3-23 10:14 作者: 樹膠 時間: 2025-3-23 16:47 作者: 藕床生厭倦 時間: 2025-3-23 18:59
Extending models of second order predicate logic to models of second order dependent type theory,om the construction being of interest by itself, this also suggests a way of proving the . from second order predicate logic to second order dependent type theory. Under this embedding, formulas are interpreted as types, and derivability (of a formaula) in the logic should correspond to . (i.e. the 作者: 依法逮捕 時間: 2025-3-24 01:59 作者: TIGER 時間: 2025-3-24 06:00
Computational aspects of arity hierarchies,. respectively. We investigate hierarchies within these logics which emerge from imposing boundaries on the arities of second order variables. The computational relevance of this genuinely logical concept is under study. As for ., arity levels can be closely related to degree levels of .. In the cas作者: RAG 時間: 2025-3-24 07:19
Weak semantics based on lighted button pressing experiments,H86] by means of black-box testing experiments, or more precisely by lighted button testing experiments [BM92]. As divergence is considered we give the semantics as a preorder, the readiness preorder, which kernel coincides with the readiness equivalence of [OH86]. This leads to a bisimulation like 作者: 針葉樹 時間: 2025-3-24 12:21
Kleene algebra with tests: Completeness and decidability,y analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen‘s reduction of Kleene作者: Pericarditis 時間: 2025-3-24 16:53 作者: 終端 時間: 2025-3-24 22:08
Coercive subtyping in type theory,[Luo94]. In this approach, subtyping with specified implicit coercions is treated as a feature at the level of the logical framework; in particular, subsumption and coercion are combined in such a way that the meaning of an object being in a supertype is given by . for the definitional equality. It 作者: Minikin 時間: 2025-3-25 02:33
Proofs in system ,, can be done in system ,,,uctors is associated to each term of the system whose unification gives the possible typings. We define a syntactic restriction on constructors which is enough to capture all the typability problems: the elementary calculus. We use these principal typed terms to prove that the higher order typings h作者: LANCE 時間: 2025-3-25 06:11 作者: 死貓他燒焦 時間: 2025-3-25 10:48
Peter A. Reese,William A. Priceem in the development of a general theory for algebraic type systems is to prove that typing is preserved under reduction (Subject Reduction lemma). In this paper, we propose a general technique to prove Subject Reduction for a large class of algebraic type systems. The idea is to consider for every作者: 侵略 時間: 2025-3-25 12:29 作者: 小歌劇 時間: 2025-3-25 17:23
Sachin Patel,Cecilia J. Hillardtion obtained from the “geometry of interaction” interpretation of λ-calculus [5]..The calculus is obtained by synchronizing another graphical local calculus presented in “l(fā)ocal and asynchronous beta-reduction”: . [4]. This synchronization makes it easier to mechanize than general virtual reductions作者: Increment 時間: 2025-3-25 20:11 作者: Chameleon 時間: 2025-3-26 03:13 作者: neutrophils 時間: 2025-3-26 04:52 作者: 凈禮 時間: 2025-3-26 12:26 作者: Pantry 時間: 2025-3-26 14:04
Endocannabinoids and Their Synthetic Analogste rules have become more apparent. Not only does one obtain simultaneously the decidability of .-equality and a natural construction of the long .-normal forms, but rewrite relations using expansions retain key properties when combined with first order rewrite systems, generalise more easily to oth作者: 多產(chǎn)子 時間: 2025-3-26 19:45 作者: cleaver 時間: 2025-3-27 00:48 作者: 觀點(diǎn) 時間: 2025-3-27 02:42
A. S. Lewis,R. Heroux,F. Nolte,P. Robinsony analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen‘s reduction of Kleene作者: forestry 時間: 2025-3-27 07:43
A. S. Lewis,R. Heroux,F. Nolte,P. Robinson We obtain our result by giving a winning strategy for the duplicator in the Ajtai-Fagin Ehrenfeucht-Fra?ssé Game. The result can be strengthened to obtain nondefinability for a larger class of graphs.作者: cardiac-arrest 時間: 2025-3-27 10:24 作者: 全能 時間: 2025-3-27 14:49
https://doi.org/10.1007/978-1-4615-2802-9uctors is associated to each term of the system whose unification gives the possible typings. We define a syntactic restriction on constructors which is enough to capture all the typability problems: the elementary calculus. We use these principal typed terms to prove that the higher order typings h作者: 包庇 時間: 2025-3-27 21:50 作者: Cursory 時間: 2025-3-27 22:49 作者: 牽連 時間: 2025-3-28 06:01
978-3-540-63172-9Springer-Verlag Berlin Heidelberg 1997作者: Genetics 時間: 2025-3-28 08:10
An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory,odels of SDT and show that the domains in them yield models of ADT. On the other hand, for each model of ADT in a wide class we construct a model of SDT such that the domains in it provide a model of ADT which conservatively extends the original model.作者: 推測 時間: 2025-3-28 11:47
Monadic NP and built-in trees, We obtain our result by giving a winning strategy for the duplicator in the Ajtai-Fagin Ehrenfeucht-Fra?ssé Game. The result can be strengthened to obtain nondefinability for a larger class of graphs.作者: infinite 時間: 2025-3-28 16:36
Proofs in system ,, can be done in system ,,,uctors is associated to each term of the system whose unification gives the possible typings. We define a syntactic restriction on constructors which is enough to capture all the typability problems: the elementary calculus. We use these principal typed terms to prove that the higher order typings hierarchy collapse at the second level.作者: indigenous 時間: 2025-3-28 21:18 作者: FISC 時間: 2025-3-29 01:14 作者: ICLE 時間: 2025-3-29 03:40
Robert H. Spitzer,Elizabeth A. KochThe methods of this paper can be applied as well to intuitionistic proof systems like Natural Deduction. It is obvious that the application of extended reductions similar to projections will result in a loss of confluence; on the other hand, confluence is of doubtful value if the . of cut-elimination is the main concern.作者: 使人煩燥 時間: 2025-3-29 08:12 作者: 動物 時間: 2025-3-29 14:44
A. S. Lewis,R. Heroux,F. Nolte,P. RobinsonWe extend Belnap‘s Display Logic to give a cut-free Gentzen-style calculus for relation algebras. The calculus gives many axiomatic extensions of relation algebras by the addition of further structural rules. It also appears to be the first purely prepositional Gentzen-style calculus for relation algebras.作者: 財政 時間: 2025-3-29 19:17
Four-valued diagnoses for stratified knowledge-bases,We present a four-valued approach for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing so automaticly. This method is particularly useful for making model-based diagnoses.作者: Infantry 時間: 2025-3-29 22:34 作者: 蘑菇 時間: 2025-3-30 03:04
Relative undecidability in term rewriting,For two hierarchies of properties of term rewriting systems related to confluence and termination, respectively, we prove .: for implications . in the hierarchies the property . is undecidable for term rewriting systems satisfying ..作者: 迷住 時間: 2025-3-30 04:50 作者: crockery 時間: 2025-3-30 12:14 作者: 弄皺 時間: 2025-3-30 14:37
Dow P. Hurst,Patricia H. Reggioodels of SDT and show that the domains in them yield models of ADT. On the other hand, for each model of ADT in a wide class we construct a model of SDT such that the domains in it provide a model of ADT which conservatively extends the original model.作者: 聯(lián)邦 時間: 2025-3-30 16:39
A. S. Lewis,R. Heroux,F. Nolte,P. Robinson We obtain our result by giving a winning strategy for the duplicator in the Ajtai-Fagin Ehrenfeucht-Fra?ssé Game. The result can be strengthened to obtain nondefinability for a larger class of graphs.作者: Esophagus 時間: 2025-3-31 00:04
https://doi.org/10.1007/978-1-4615-2802-9uctors is associated to each term of the system whose unification gives the possible typings. We define a syntactic restriction on constructors which is enough to capture all the typability problems: the elementary calculus. We use these principal typed terms to prove that the higher order typings hierarchy collapse at the second level.作者: insular 時間: 2025-3-31 03:51 作者: 他姓手中拿著 時間: 2025-3-31 07:31 作者: Little 時間: 2025-3-31 09:10 作者: Innocence 時間: 2025-3-31 16:09 作者: 碎石 時間: 2025-3-31 18:39 作者: 骯臟 時間: 2025-3-31 23:13
https://doi.org/10.1007/978-1-4615-2802-9 more general definability theory of optimization problems. We define a class . φ and show that every problem in this class has a . (FPTAS), i.e., can be approximated to every desired accuracy . in time polynomial in the size of the input and 1/.. An example for a problem in . φ is ..作者: Hallmark 時間: 2025-4-1 02:41 作者: MULTI 時間: 2025-4-1 06:32
Kleene algebra with tests: Completeness and decidability,h tests and-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen‘s reduction of Kleene algebra with hypotheses of the form .=0 to Kleene algebra without hypotheses is simplified and extended to handle Kleene algebras with tests.作者: 不感興趣 時間: 2025-4-1 12:39
Optimization problems with approximation schemes, more general definability theory of optimization problems. We define a class . φ and show that every problem in this class has a . (FPTAS), i.e., can be approximated to every desired accuracy . in time polynomial in the size of the input and 1/.. An example for a problem in . φ is ..
