scholarly journals Game-theoretic characterization of antidegradable channels

2014 ◽  
Vol 55 (9) ◽  
pp. 092202 ◽  
Author(s):  
Francesco Buscemi ◽  
Nilanjana Datta ◽  
Sergii Strelchuk
Keyword(s):  
Game Theoretic ◽  
Theoretic Characterization

scholarly journals On the theorems of Y. Mibu and G. Debs on separate continuity

1996 ◽  
Vol 19 (3) ◽  
pp. 495-500 ◽  
Author(s):  
Zbigniew Piotrowski
Keyword(s):  
Continuous Functions ◽  
Game Theoretic ◽  
Theoretic Characterization

Using a game-theoretic characterization of Baire spaces, conditions upon the domain and the range are given to ensure a “fat” setC(f)of points of continuity in the sets of typeX×{y},y∈Yfor certain almost separately continuous functionsf:X×Y→Z. These results (especially Theorem B) generalize Mibu's. First Theorem, previous theorems of the author, answers one of his problems as well as they are closely related to some other results of Debs [1] and Mibu [2].

scholarly journals A game-theoretic characterization of Boolean grammars

2011 ◽  
Vol 412 (12-14) ◽  
pp. 1169-1183 ◽  
Author(s):  
Vassilis Kountouriotis ◽  
Christos Nomikos ◽  
Panos Rondogiannis
Keyword(s):  
Game Theoretic ◽  
Theoretic Characterization ◽  
Boolean Grammars

Minimal models

1977 ◽  
Vol 42 (2) ◽  
pp. 254-260
Author(s):  
Rainer Deissler
Keyword(s):  
Upper Bound ◽  
Minimal Models ◽  
First Order ◽  
Elementary Submodel ◽  
Game Theoretic ◽  
Theoretic Characterization ◽  
Natural Way

A model is called minimal if it does not contain a proper elementary submodel. A class of models is called Σ11(Π11 resp. elementary) if it is axiomatized by a sentence with σ in and some string of predicate symbols. All languages considered are assumed to be countable. For each model we shall define in a natural way its rank, denoted by rk (), which is an ordinal or ∞. Intuitively speaking, rk () is the least upper bound for the number of steps needed to define the elements of by first order formulas; e.g. we shall have rk((ω, <)) = 1 (each element is f.o. definable), rk ((Z, <)) = 2 (no element is f.o. definable, each element is f.o. definable using any other element as a parameter), rk ((Q, <) ) = ∞ (no element is f.o. definable by any number of steps). This notion of rank leads to a useful game theoretic characterization of minimal models which we apply to show that the Π11 class of minimal models is not Σ11.

scholarly journals A lattice-theoretic characterization of pure subgroups of Abelian groups

2021 ◽  
Author(s):  
M. Ferrara ◽  
M. Trombetti
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Subgroup Lattice ◽  
General Definition ◽  
Short Paper ◽  
Theoretic Characterization ◽  
Definition Of

AbstractLet G be an abelian group. The aim of this short paper is to describe a way to identify pure subgroups H of G by looking only at how the subgroup lattice $$\mathcal {L}(H)$$ L ( H ) embeds in $$\mathcal {L}(G)$$ L ( G ) . It is worth noticing that all results are carried out in a local nilpotent context for a general definition of purity.

Information-theoretic characterization of eye-tracking signals with relation to cognitive tasks

2021 ◽  
Vol 31 (3) ◽  
pp. 033107
Author(s):  
F. R. Iaconis ◽  
A. A. Jiménez Gandica ◽  
J. A. Del Punta ◽  
C. A. Delrieux ◽  
G. Gasaneo
Keyword(s):  
Eye Tracking ◽  
Cognitive Tasks ◽  
Information Theoretic ◽  
Theoretic Characterization
Sign in / Sign up

Export Citation Format

Share Document