A schematic axiom for open congruence

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Congruence Axiom and Path Independence

This paper examines the connection between path independence and transitive rationalization of a choice function in a general domain where a choice function may not include all possible non-empty subsets of the universal set. Describing a sequential choice procedure, this paper shows that the requirement of path independence of a choice function is equivalent to Richter's Congruence Axiom and t...

متن کامل

AffyPipe: an open-source pipeline for Affymetrix Axiom genotyping workflow

UNLABELLED The Affymetrix Axiom genotyping standard and 'best practice' workflow for Linux and Mac users consists of three stand-alone executable programs (Affymetrix Power Tools) and an R package (SNPolisher). Currently, SNP analysis has to be performed in a step-by-step procedure. Manual intervention and/or programming skills by the user is required at each intermediate point, as Affymetrix P...

متن کامل

Large Deviation for Return times in Open Sets for Axiom a Diffeomorphisms

For axiom A diffeomorphisms and equilibrium state, we prove a Large deviation result for the sequence of successive return times into a fixed open set, under some assumption on the boundary. Our result relies on and extends the work by Chazottes and Leplaideur who where considering cylinder sets of a Markov partition.

متن کامل

The Bounded Axiom A Forcing Axiom

We introduce the Bounded Axiom A Forcing Axiom(BAAFA). It turns out that it is equiconsistent with the existence of a regular Σ2-correct cardinal and hence also equiconsistent with BPFA. Furthermore we show that, if consistent, it does not imply the Bounded Proper Forcing Axiom(BPFA).

متن کامل

A Framework for Program DevelopmentBased on Schematic

Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. The diier-ence involves often only a slight shift of perspective: admitting metavari-ables into proofs. We propose that such calculi should be implemented in logical frameworks that support this kind of proof construction and that such an implementation can unify program veriication ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science in China Series F

سال: 2005

ISSN: 1009-2757

DOI: 10.1360/01yf0466