نتایج جستجو برای: strong alpha cut

تعداد نتایج: 636696  

Journal: :The Chinese journal of physiology 2014
Chyi-Huey Bai Ming-Shun Wu Eddy Owaga Shu-Yu Cheng Wen-Harn Pan Jung-Su Chang

Body iron levels have recently been shown to be a strong predictor for non-alcoholic fatty liver disease (NAFLD). The aims of this study were to investigate the prevalence of NAFLD in a general adult population, and to investigate the relationship between body iron levels, NAFLD and the metabolic syndrome (MetS). 2186 adults participated in the third National Nutrition and Health Survey in Taiw...

Journal: :J. Log. Comput. 2013
Ori Lahav Arnon Avron

We provide a constructive direct semantic proof of the completeness of the cut-free part of the hypersequent calculus HIF for the standard first-order Gödel logic (thereby proving both completeness of the calculus for its standard semantics, and the admissibility of the cut rule in the full calculus). The results also apply to derivations from assumptions (or “non-logical axioms”), showing in p...

Journal: :Annals OR 2012
Haroldo G. Santos Eduardo Uchoa Luiz Satoru Ochi Nelson Maculan

This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher preferences and also the proper distribution of lessons throughout the week. The formulation contains a very large number of variables and is enhanced by cuts. Therefore, a cut and column generation algorithm to solve its linear relaxation is ...

Journal: :Gut 1994
H Dobson M Pignatelli D Hopwood C D'Arrigo

The distribution of a range of integrins, E-cadherin, and carcino-embryonic antigen (CEA) like molecules in normal human oesophageal epithelium was investigated immunohistochemically on frozen sections of endoscopic biopsy specimens. The integrin subunits alpha 2, alpha 3, alpha 6, alpha v, beta 1, and beta 5 were expressed throughout the epithelium. There was strong expression of alpha 2, alph...

Journal: :Ann. Pure Appl. Logic 2010
Nikolaos Galatos Hiroakira Ono

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on (associative) substructural logics over the full Lambek Calculus FL (see e.g. [36, 19, 18]). We present a Gentzen-style sequent system GL that lacks the structural rules of contraction, weakening, exchange and associa...

2006
Roy Dyckhoff Delia Kesner Stéphane Lengrand

Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicational case, thus strengthening existing approaches to Cut-admissibility. We decorate proofs with proofterms and introduce various term-reduction systems representing proof transformations. In contrast to previous papers which ga...

1997
Roberto Di Cosmo Delia Kesner

In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic, via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [30, 29] is strongly normalizing, as well as of all the calculi isomorphic to it such as λυ [24], λs [19], λd [21], and λf [11]. In o...

Production planning in mineral exploitation should be undertaken to maximize exploited ore at a minimum unplanned dilution. Unplanned dilution reduction is among the ways to enhance the quality of products, and hence, reduce the associated costs, resulting in a higher profit. In this way, firstly, all the parameters contributing to unplanned dilution in underground stopes and specifically the c...

Journal: :J. Log. Comput. 2002
Norihiro Kamide

We introduce intuitionistic and classical substructural logics with structural rules mingle and connective strong negation, and investigate the cut-elimination property and the relevance principle for these logics. The relevance principle does not hold for substructural logics with mingle and usual negation, but holds for those with mingle and strong negation.

1997
Michel X. Goemans

We discuss the use of semideenite programming for combinato-rial optimization problems. The main topics covered include (i) the Lovv asz theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of nite metric spaces and its relation...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید