The non-deterministic catch and throw mechanism and its subject reduction property

Author(s):  
Hiroshi Nakano
Keyword(s):  
1993 ◽  
Vol 58 (1) ◽  
pp. 81-98
Author(s):  
Shaughan Lavine

AbstractLet be an admissible set. A sentence of the form is a sentence if φ ∈ (φ is ∨ Φ where Φ is an -r.e. set of sentences from ). A sentence of the form is an , sentence if φ is a sentence. A class of structures is, for example, a ∀1 class if it is the class of models of a ∀1() sentence. Thus ∀1() is a class of classes of structures, and so forth.Let i, be the structure 〈i, <〉, for i > 0. Let Γ be a class of classes of structures. We say that a sequence J1, …, Ji,…, i < ω, of classes of structures is a Γ sequence if Ji ∈ Γ, i < ω, and there is I ∈ Γ such that ∈ Ji, if and only if [],i, where [,] is the disjoint sum. A class Γ of classes of structures has the easy uniformization property if for every Γ sequence J1,…, Ji,…, i < ω, there is a Γ sequence J′t, …, J′i, …, i < ω, such that J′i ⊆ Ji, i < ω, ⋃J′i = ⋃Ji, and the J′i are pairwise disjoint. The easy uniformization property is an effective version of Kuratowski's generalized reduction property that is closely related to Moschovakis's (topological) easy uniformization property.We show over countable structures that ∀1() and ∃2() have the easy uniformization property if is a countable admissible set with an infinite member, that and have the easy uniformization property if α is countable, admissible, and not weakly stable, and that and have the easy uniformization properly. The results proved are more general. The result for answers a question of Vaught(1980).


2016 ◽  
Vol 45 (8) ◽  
pp. 901-903
Author(s):  
Zhaoguo Zhang ◽  
Zhengfeng Huang ◽  
Xudong Cheng ◽  
Qingli Wang ◽  
Peimei Dong ◽  
...  

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 845 ◽  
Author(s):  
Christian Chapman ◽  
Matthew Kinsinger ◽  
Ameya Agaskar ◽  
Daniel W. Bliss

A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an “iterative power reduction” property. An upper bound for the scheme’s achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.


Author(s):  
Akio Kawauchi

AbstractIn this paper, we construct from any given good (3,1)-dimensional manifold pair finitely many almost identical imitations of it whose exteriors are mutative hyperbolic 3-manifolds. The equivariant versions with the mutative reduction property on the isometry group are also established. As a corollary, we have finitely many hyperbolic 3-manifolds with the same volume and the same isometry group.


2019 ◽  
Vol 25 (19) ◽  
pp. 4920-4926 ◽  
Author(s):  
Chuang Fan ◽  
Zihan Huang ◽  
Chao Wang ◽  
Xianyu Hu ◽  
Xiaoyu Qiu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document