نتایج جستجو برای: admissible wavelet

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

Journal: :Proceedings of the American Mathematical Society 2005

Journal: :Journal of Algebra 2002

Journal: :The Annals of Mathematical Statistics 1947

Journal: :J. Comb. Theory, Ser. A 2011
Benjamin A. Burton

The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but non-linear and non-convex constraint. The main results of this paper are significant improvements upon the best known asymptotic bounds on the number of admissi...

Journal: :Bulletin of Symbolic Logic 2004
H. Jerome Keisler Julia F. Knight

0. Introduction 1 1. Background on infinitary logic 2 1.1. Expressive power of Lω1ω 2 1.2. The back-and-forth construction 3 1.3. The Scott isomorphism theorem 4 1.4. ω-logic 7 1.5. Familiar theorems 8 1.6. Failure of compactness 9 2. Background on admissible sets 10 2.1. ∆0 formulas and Σ-formulas in set theory 10 2.2. Axioms of KP 11 2.3. Examples of admissible sets 12 2.4. The admissible set...

2013
Rosalie Iemhoff

Most theorems have more than one proof and most theories have more than one axiomatization. Certain proofs or axiomatizations are preferable to others because they are shorter or more transparent or for some other reason. Our aim is to describe or study the possible proofs of a theorem or the possible axiomatizations of a theory. As the former is a special instance of the latter, by considering...

Journal: :Notre Dame Journal of Formal Logic 2005
Rosalie Iemhoff

Visser’s rules form a basis for the admissible rules of IPC. Here we show that this result can be generalized to arbitrary intermediate logics: Visser’s rules form a basis for the admissible rules of any intermediate logic L for which they are admissible. This implies that if Visser’s rules are derivable for L then L has no non-derivable admissible rules. We also provide a necessary and suffici...

Journal: :J. Economic Theory 2010
Adam Brandenburger Amanda Friedenberg

Best-response sets (Pearce [29, 1984]) characterize the epistemic condition of “rationality and common belief of rationality.” When rationality incorporates a weak-dominance (admissibility) requirement, the self-admissible set (SAS) concept (Brandenburger-Friedenberg-Keisler [18, 2008]) characterizes “rationality and common assumption of rationality.” We analyze the behavior of SAS’s in some ga...

Journal: :J. UCS 2000
John Mullins

In this article we address the issue of con dentiality of information in the context of downgrading systems i.e. systems admitting information ow between secrecy levels only through a downgrader. Inspired by the intuition underlying the usual de nition of admissible information ow, we propose an analogue based on trace equivalence as developed in the context of concurrency theory and on a modi ...

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

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