作者: Forehead-Lift 時(shí)間: 2025-3-21 21:01 作者: 希望 時(shí)間: 2025-3-22 01:35 作者: Flirtatious 時(shí)間: 2025-3-22 05:13 作者: Dendritic-Cells 時(shí)間: 2025-3-22 10:06
https://doi.org/10.1057/978-1-137-53294-7ications are based on an interpretation of the lambda calculus in a category-theoretic model in which all functions are polynomial time computable by construction. The details of this interpretation are not the main subject of this paper and will appear elsewhere.作者: 單片眼鏡 時(shí)間: 2025-3-22 16:19 作者: 單片眼鏡 時(shí)間: 2025-3-22 19:53 作者: 陶醉 時(shí)間: 2025-3-23 00:23 作者: 突襲 時(shí)間: 2025-3-23 04:27 作者: 等待 時(shí)間: 2025-3-23 07:30 作者: 清洗 時(shí)間: 2025-3-23 10:46
From action calculi to linear logic,li using the propositions-as-types paradigm; the type theory has a sound and complete interpretation in Power‘s categorical models. We go on to give a sound translation of our type theory in the (type theory of) intuitionistic linear logic, corresponding to the relation between Benton‘s models of li作者: essential-fats 時(shí)間: 2025-3-23 15:57 作者: muster 時(shí)間: 2025-3-23 19:12
Linear lower bounds and simulations in frege systems with substitutions,nd using Kolmogorov Complexity we give a more general framework to obtain superlogarithmic lower bounds for the number of lines in both tree-like and dag-like .. We show the previous known lower bound, extend it to the tree-like case and, for another class of tautologies, we give new lower bounds th作者: 罵人有污點(diǎn) 時(shí)間: 2025-3-23 23:03 作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-24 03:41
,A proof-theoretical investigation of Zantema’s problem, of the string-rewriting system 1100 → 000111. This rewriting system is self-embedding, so the standard termination techniques which rely on Kruskal‘s Tree Theorem cannot be applied directly. Dershowitz and Hoot [3] have given a classical termination proof using a minimal bad sequence argument. We a作者: Ankylo- 時(shí)間: 2025-3-24 08:46
Spectra with only unary function symbols,ges that contain only unary function symbols. In particular, it is shown that a set . of natural numbers is the spectrum of a sentence over the language of one unary function symbol precisely if . is an eventually periodic set.作者: 包庇 時(shí)間: 2025-3-24 12:50
Classical proofs via basic logic,ch has been extended to classical logic (cf. Girard 1991, Parigot 1991, and recently Danos Joinet Schellinx 1997). This paper introduces a new sequent calculus for (propositional) classical logic, indicated by .C. Both, the calculus and the cut-elimination procedure for .C extend those for . (Sambin作者: Respond 時(shí)間: 2025-3-24 15:32
Full abstractness for a functional/concurrent language with higher-order value-passing, for processes; the constructors for terms of this type are similar to those found in standard process calculi such as CCS. We first give an operational semantics for this language in terms of a labelled transition system which is then used to give a behavioural preorderbased on contexts; the expres作者: 暫時(shí)休息 時(shí)間: 2025-3-24 19:45 作者: sterilization 時(shí)間: 2025-3-25 02:28
A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion,ated with modality and linearity are avoided. We study the basic metatheory of this system including existence and inference of principal types..The system serves as a platform for certain higher-order generalisations of Bellantoni-Cook‘s function algebra capturing polynomial time using a separation作者: effrontery 時(shí)間: 2025-3-25 06:34
Equational axioms of test algebra,t the Kleene algebra component cannot be replaced by a finite set of test algebra equations..There is thus a tradeoff: on the one hand we have a sound and complete axiomatization using an infinite number of equations (this paper), on the other we have a finite axiomatization that uses a ..-axiom ([1作者: HACK 時(shí)間: 2025-3-25 09:50
Mona & Fido: The logic-automaton connection in practice,essing regular sets, we have developed tools that allow efficient symbolic reasoning not attainable by theorem proving or symbolic model checking..We explain how the logic-automaton connection is already exploited in a limited way for the case of Quantified Boolean Logic, where Binary Decision Diagr作者: sundowning 時(shí)間: 2025-3-25 14:27 作者: Overstate 時(shí)間: 2025-3-25 18:43 作者: 流動(dòng)性 時(shí)間: 2025-3-25 21:05 作者: 模范 時(shí)間: 2025-3-26 02:37
The Political Economy of the Manila Trade, a variant of the plain relational model which is constructed in two steps: first the model of pointed relations, then the additional polarization structure which yields a proper duality. Then the natural time-forgetting map is shown to generate a lax functor from the source to the target. Finally a作者: 高度表 時(shí)間: 2025-3-26 04:18
The Political Economy of the Manila Trade,li using the propositions-as-types paradigm; the type theory has a sound and complete interpretation in Power‘s categorical models. We go on to give a sound translation of our type theory in the (type theory of) intuitionistic linear logic, corresponding to the relation between Benton‘s models of li作者: 壟斷 時(shí)間: 2025-3-26 10:56 作者: Initial 時(shí)間: 2025-3-26 16:10
https://doi.org/10.1007/978-1-349-15755-6nd using Kolmogorov Complexity we give a more general framework to obtain superlogarithmic lower bounds for the number of lines in both tree-like and dag-like .. We show the previous known lower bound, extend it to the tree-like case and, for another class of tautologies, we give new lower bounds th作者: 爭(zhēng)議的蘋(píng)果 時(shí)間: 2025-3-26 16:57
Capital Structure and Earnings Per Share, originally introduced by Hyland and de Paiva. In the work of Hyland and de Paiva, a term assignment system is used to describe the intuitionistic character of FILL and a proof of cut-elimination is barely sketched. In the present paper, as well as correcting a small mistake in their work and extend作者: Brain-Imaging 時(shí)間: 2025-3-27 00:29
Capitalist States and Civil Societies, of the string-rewriting system 1100 → 000111. This rewriting system is self-embedding, so the standard termination techniques which rely on Kruskal‘s Tree Theorem cannot be applied directly. Dershowitz and Hoot [3] have given a classical termination proof using a minimal bad sequence argument. We a作者: 溫順 時(shí)間: 2025-3-27 03:52 作者: 上釉彩 時(shí)間: 2025-3-27 06:05
The Concept of Interest-Bearing Moneych has been extended to classical logic (cf. Girard 1991, Parigot 1991, and recently Danos Joinet Schellinx 1997). This paper introduces a new sequent calculus for (propositional) classical logic, indicated by .C. Both, the calculus and the cut-elimination procedure for .C extend those for . (Sambin作者: ESPY 時(shí)間: 2025-3-27 12:52 作者: antidote 時(shí)間: 2025-3-27 17:31
Vincent C. Prantil,Timothy Decker the set of all predicates consistent with it. Generalizing this scenario to quantitative predicates, we obtain under certain well-understood hypotheses an isomorphism between continuous functions on points and supremum preserving functions on open sets, both with values in a fixed lattice. The func作者: Cpap155 時(shí)間: 2025-3-27 20:11 作者: Overthrow 時(shí)間: 2025-3-28 00:14
https://doi.org/10.1057/978-1-137-53294-7t the Kleene algebra component cannot be replaced by a finite set of test algebra equations..There is thus a tradeoff: on the one hand we have a sound and complete axiomatization using an infinite number of equations (this paper), on the other we have a finite axiomatization that uses a ..-axiom ([1作者: constellation 時(shí)間: 2025-3-28 05:59 作者: 手工藝品 時(shí)間: 2025-3-28 07:07 作者: adjacent 時(shí)間: 2025-3-28 12:40 作者: 好忠告人 時(shí)間: 2025-3-28 17:45
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233765.jpg作者: 不公開(kāi) 時(shí)間: 2025-3-28 20:28
Call-by-value games,operties of sum types in common denotational models of call-by-name. When applied to categories of games, it yields fully abstract models of the call-by-value functional language PCF., which can be extended to incorporate recursive types, and of a language with local references as in Standard ML.作者: 即席演說(shuō) 時(shí)間: 2025-3-29 01:41
A sequent calculus for circumscription,f-theoretic reconstruction of the major families of non-monotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic and comprises an axiomatic rejection method, which allows for a fully detailed formalization of the nonmonotonic aspects of inference.作者: Mercantile 時(shí)間: 2025-3-29 07:00
Spectra with only unary function symbols,ges that contain only unary function symbols. In particular, it is shown that a set . of natural numbers is the spectrum of a sentence over the language of one unary function symbol precisely if . is an eventually periodic set.作者: 苦笑 時(shí)間: 2025-3-29 09:56 作者: Bucket 時(shí)間: 2025-3-29 12:50
Introduction: Cuba’s Capacity to Shareoperties of sum types in common denotational models of call-by-name. When applied to categories of games, it yields fully abstract models of the call-by-value functional language PCF., which can be extended to incorporate recursive types, and of a language with local references as in Standard ML.作者: 不幸的人 時(shí)間: 2025-3-29 16:19
The Markets: Procedures and Control,f-theoretic reconstruction of the major families of non-monotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic and comprises an axiomatic rejection method, which allows for a fully detailed formalization of the nonmonotonic aspects of inference.作者: Vasodilation 時(shí)間: 2025-3-29 21:58
https://doi.org/10.1007/978-3-642-74758-8ges that contain only unary function symbols. In particular, it is shown that a set . of natural numbers is the spectrum of a sentence over the language of one unary function symbol precisely if . is an eventually periodic set.作者: organic-matrix 時(shí)間: 2025-3-30 01:11 作者: fluffy 時(shí)間: 2025-3-30 04:33 作者: 噱頭 時(shí)間: 2025-3-30 08:57 作者: Chipmunk 時(shí)間: 2025-3-30 13:33 作者: 偏狂癥 時(shí)間: 2025-3-30 19:08 作者: Canyon 時(shí)間: 2025-3-30 21:40
Evolution as a computational engine,f lethal genes, which can guide the computation, so that all intermediate genomes are prefixes of (encodings of) configurations in the computation of .. Since reversible Turing machines retain the history of their entire computation, and axe essentially encoded by evolutionary systems, this suggests a encoding mechanism by which ..作者: BILL 時(shí)間: 2025-3-31 04:21
,A proof-theoretical investigation of Zantema’s problem,ive definitions. By simplifying this constructive proof we obtain a second proof in a theory conservative over primitive recursive arithmetic. This proof is generalised to a theorem about string rewriting systems.作者: 不舒服 時(shí)間: 2025-3-31 06:13 作者: endure 時(shí)間: 2025-3-31 12:54
0302-9743 held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997..The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addr
