Готові списки джерел за темами / Countable set

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Countable set"

Автор: Grafiati

Опубліковано: 28 травня 2022

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Countable set".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Countable set"

Millar, Terry. "Bad models in nice neighborhoods." Journal of Symbolic Logic 51, no. 4 (1986): 1043–55. http://dx.doi.org/10.2307/2273916.

Повний текст джерела

Анотація:

This paper contains an example of a decidable theory which has1) only a countable number of countable models (up to isomorphism);2) a decidable saturated model; and3) a countable homogeneous model that is not decidable.By the results in [1] and [2], this can happen if and only if the set of types realized by the homogeneous model (the type spectrum of the model) is not .If Γ and Σ are types of a theory T, define Γ ◁ Σ to mean that any model of T realizing Γ must realize Σ. In [3] a decidable theory is constructed that has only countably many countable models, only recursive types, but whose co

Стилі APA, Harvard, Vancouver, ISO та ін.

Živaljević, Boško. "U-meager sets when the cofinality and the coinitiality of U are uncountable." Journal of Symbolic Logic 56, no. 3 (1991): 906–14. http://dx.doi.org/10.2307/2275060.

Повний текст джерела

Анотація:

AbtractWe prove that every countably determined set C is U-meager if and only if every internal subset A of C is U-meager, provided that the cofinality and coinitiality of the cut U are both uncountable. As a consequence we prove that for such cuts a countably determined set C which intersects every U-monad in at most countably many points is U-meager. That complements a similar result in [KL]. We also give some partial solutions to some open problems from [KL]. We prove that the set , where H is an infinite integer, cannot be expressed as a countable union of countably determined sets each of

Стилі APA, Harvard, Vancouver, ISO та ін.

Baboolal, D., J. Backhouse, and R. G. Ori. "On weaker forms of compactness Lindelöfness and countable compactness." International Journal of Mathematics and Mathematical Sciences 13, no. 1 (1990): 55–59. http://dx.doi.org/10.1155/s0161171290000084.

Повний текст джерела

Анотація:

A theory of e-countable compactness and e-Lindelöfness which are weaker than the concepts of countable compactness and Lindelöfness respectively is developed. Amongst other results we show that an e-countably compact space is pseudocompact, and an example of a space which is pseudocompact but not e-countably compact with respect to any dense set is presented. We also show that every e-Lindelöf metric space is separable.

Стилі APA, Harvard, Vancouver, ISO та ін.

Valentini, Silvio. "Every countably presented formal topology is spatial, classically." Journal of Symbolic Logic 71, no. 2 (2006): 491–500. http://dx.doi.org/10.2178/jsl/1146620155.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aharoni, Ron, and Reinhard Diestel. "Menger's Theorem for a Countable Source Set." Combinatorics, Probability and Computing 3, no. 2 (1994): 145–56. http://dx.doi.org/10.1017/s0963548300001073.

Повний текст джерела

Анотація:

Paul Erdős has conjectured that Menger's theorem extends to infinite graphs in the following way: whenever A, B are two sets of vertices in an infinite graph, there exist a set of disjoint A−B paths and an A−B separator in this graph such that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths to B from all but countably many vertices of A. In particular, the conjecture is true when A is countable.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mendoza Iturralde, Pablo, and Vladimir V. Tkachuk. "Cofinitely and co-countably projective spaces." Applied General Topology 3, no. 2 (2002): 185. http://dx.doi.org/10.4995/agt.2002.2062.

Повний текст джерела

Анотація:

<p>We show that X is cofinitely projective if and only if it is a finite union of Alexandroff compactatifications of discrete spaces. We also prove that X is co-countably projective if and only if X admits no disjoint infinite family of uncountable cozero sets. It is shown that a paracompact space X is co-countably projective if and only if there exists a finite set B C X such that B C U ϵ τ (X) implies │X\U│ ≤ ω. In case of existence of such a B we will say that X is concentrated around B. We prove that there exists a space Y which is co-countably projective while there is no finite set

Стилі APA, Harvard, Vancouver, ISO та ін.

Aye, Aye Moe. "A Study of Countable, Uncountable, Bounded and Compact Sets on The Metric Spaces." Dagon University Research journal Vol.8, no. 2018 (2019): Pg. 343–351. https://doi.org/10.5281/zenodo.3559342.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

ANDREWS, URI, and H. JEROME KEISLER. "SEPARABLE MODELS OF RANDOMIZATIONS." Journal of Symbolic Logic 80, no. 4 (2015): 1149–81. http://dx.doi.org/10.1017/jsl.2015.33.

Повний текст джерела

Анотація:

AbstractEvery complete first order theory has a corresponding complete theory in continuous logic, called the randomization theory. It has two sorts, a sort for random elements of models of the first order theory, and a sort for events. In this paper we establish connections between properties of countable models of a first order theory and corresponding properties of separable models of the randomization theory. We show that the randomization theory has a prime model if and only if the first order theory has a prime model. And the randomization theory has the same number of separable homogene

Стилі APA, Harvard, Vancouver, ISO та ін.

Sonia, Sharma. "Power Set of Natural Numbers is Countable." International Journal of Innovative Science and Research Technology 7, no. 3 (2022): 1191–92. https://doi.org/10.5281/zenodo.6463282.

Повний текст джерела

Анотація:

This paper explains the Cardinality of the Power Set of Natural numbers. Set of Natural numbers is countable, in the same way the power set of Natural numbers is also countable as every subset of the Power set of Natural numbers is Countable. Prime numbers and Well ordering Principle play a very important role in proving this result. Since every Subset of Natural numbers is Countable, there exists a bijection between the Power Set of Natural numbers and a proper subset of Natural numbers.

Стилі APA, Harvard, Vancouver, ISO та ін.

MUMMERT, CARL. "REVERSE MATHEMATICS OF MF SPACES." Journal of Mathematical Logic 06, no. 02 (2006): 203–32. http://dx.doi.org/10.1142/s0219061306000578.

Повний текст джерела

Анотація:

This paper gives a formalization of general topology in second-order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF (P) denote the set of maximal filters on P endowed with the topology generated by {Np | p ∈ P}, where Np = {F ∈ MF (P) | p ∈ F}. We define a countably based MF space to be a space of the form MF (P) for some countable poset P. The class of countably based MF spaces includes all complete separable metric spaces as well as many nonmetrizable spaces. The following reverse mathema

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Countable set"

Горелов, А. В., И. В. Редько та П. А. Яганов. "Метод получения базиса для счетных множеств". Thesis, Сумский государственный университет, 2014. http://essuir.sumdu.edu.ua/handle/123456789/39148.

Повний текст джерела

Анотація:

Частично рекурсивные (ЧР) функции и предикаты примечательны тем, что согласно тезису Черча, ЧР-функции (ЧР-предикаты) являются вычислимыми функциями (предикатами), а значит, могут быть алгоритмизированными.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tucker-Drob, Robin Daniel. "Descriptive Set Theory and the Ergodic Theory of Countable Groups." Thesis, 2013. https://thesis.library.caltech.edu/7716/1/Robin%20Tucker-Drob%2C%20Edited%20Thesis.pdf.

Повний текст джерела

Анотація:

The primary focus of this thesis is on the interplay of descriptive set theory and the ergodic theory of group actions. This incorporates the study of turbulence and Borel reducibility on the one hand, and the theory of orbit equivalence and weak equivalence on the other. Chapter 2 is joint work with Clinton Conley and Alexander Kechris; we study measurable graph combinatorial invariants of group actions and employ the ultraproduct construction as a way of constructing various measure preserving actions with desirable properties. Chapter 3 is joint work with Lewis Bowen; we study the property

Стилі APA, Harvard, Vancouver, ISO та ін.

Hill, Jacob. "The set of all countable ordinals : an inquiry into its construction, properties, and a proof concerning hereditary subcompactness /." 2009. http://hdl.handle.net/10288/1174.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Glivická, Jana. "Logické základy forcingu." Master's thesis, 2013. http://www.nusl.cz/ntk/nusl-324411.

Повний текст джерела

Анотація:

This thesis examines the method of forcing in set theory and focuses on aspects that are set aside in the usual presentations or applications of forcing. It is shown that forcing can be formalized in Peano arithmetic (PA) and that consis- tency results obtained by forcing are provable in PA. Two ways are presented of overcoming the assumption of the existence of a countable transitive model. The thesis also studies forcing as a method giving rise to interpretations between theories. A notion of bi-interpretability is defined and a method of forcing over a non-standard model of ZFC is developed

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Countable set"

Hjorth, Greg. Rigidity theorems for actions of product groups and countable Borel equivalence relations. American Mathematical Society, 2005.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Preston, Christopher J. Gibbs States on Countable Sets. Cambridge University Press, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Preston, Christopher J. Gibbs States on Countable Sets. University of Cambridge ESOL Examinations, 2011.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Schumer, Peter D. Fractions. Oxford University PressOxford, 2024. http://dx.doi.org/10.1093/9780198916567.001.0001.

Повний текст джерела

Анотація:

Abstract This work details a great deal of the history and manifest forms of fractions within mathematics. Rational numbers are fractions having either a terminating or repeating decimal expansion. Determining their decimal expansions, as well as the period length of repeating decimals, is completely worked out. Modern base 10 decimal expansions are compared with ancient Babylonian base 60 sexagesimal expansions. This leads to the study of infinite sums, especially to geometric series and the notions of convergence and divergence. The Fibonacci numbers are studied along with the series for 1/8

Стилі APA, Harvard, Vancouver, ISO та ін.

Lyon, Aidan. Kolmogorov’s Axiomatization and Its Discontents. Edited by Alan Hájek and Christopher Hitchcock. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199607617.013.9.

Повний текст джерела

Анотація:

Kolmogorov's axiomatization of probability is the standard probability axiom system that most people learn in high school or university. And it is widely considered to be undeniably true—in much the same way that arithmetic seems to be undeniably true. However, over the years, various philosophers, mathematicians, statisticians, and scientists have found potential faults with Kolmogorov's axiom system. In this chapter these potential faults are reviewed and discussed. Among them are the problematic countable additivity, as well as finite additivity. The chapter also includes critical examinati

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Countable set"

García, José Luis. "Countable Universes." In Intuitive Axiomatic Set Theory. Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003449911-11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Darby, Carl, and Richard Laver. "Countable Length Ramsey Games." In Set Theory. Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-015-8988-8_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

André, Robert. "Countable and uncountable sets." In Set Theory. Chapman and Hall/CRC, 2025. https://doi.org/10.1201/9781003586395-25.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dasgupta, Abhijit. "Cardinals: Finite, Countable, and Uncountable." In Set Theory. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8854-5_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Miller, Arnold W. "Hereditarily countable sets." In Descriptive Set Theory and Forcing. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-21773-3_19.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ershov, Yuri L., and Sergei S. Goncharov. "Theories with a Countable Set of Countable Models." In Constructive Models. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4305-3_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dasgupta, Abhijit. "Cantor–Bendixson Analysis of Countable Closed Sets." In Set Theory. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8854-5_16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Darby, Carl, and Jean Larson. "Multicolored graphs on countable ordinals of finite exponent." In Set Theory. American Mathematical Society, 2002. http://dx.doi.org/10.1090/dimacs/058/03.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Colcombet, Thomas, and A. V. Sreejith. "Limited Set quantifiers over Countable Linear Orderings." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47666-6_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dow, Alan. "Compact spaces of countable tightness in the Cohen model." In Set Theory and its Applications. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0097331.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Countable set"

Ganikhodjaev, Nasir, and Nur Zatul Akmar Hamzah. "Geometric quadratic stochastic operator on countable infinite set." In THE 2ND ISM INTERNATIONAL STATISTICAL CONFERENCE 2014 (ISM-II): Empowering the Applications of Statistical and Mathematical Sciences. AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4907516.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alekseeva, E. S., and A. E. Rassadin. "ADDITIONAL NOTES ON THE DYNAMICS OF THE OSCILLATORY CIRCUIT UNDER THE INFLUENCE OF A BLOCKING GENERATOR." In Actual problems of physical and functional electronics. Ulyanovsk State Technical University, 2023. http://dx.doi.org/10.61527/appfe-2023.119-121.

Повний текст джерела

Анотація:

A statistical description of the behavior of an ensemble of oscillatory circuits under the unfluence of blocking generators is given for the case when the pulse repetition period from the blocking generator is much longer than the period of charge oscillation in the circuit. The basis of this description is the exact solution of the Cauchy problem for the shortened Liouville equation, which is written out by the Hamilton function of the mechanical analogue of the system under consideration. An example of a countable set of explicit exact solutions of this equation is also presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

Storti, Duane W., Per G. Reinhall, and David M. Sliger. "Van der Pol Mode Stability via Hill’s Equation." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/vib-4020.

Повний текст джерела

Анотація:

Abstract The critical variational equation governing the stability of symmetric phase-locked modes for a pair of identical van der Pol oscillators with linear coupling is presented and shown to be equivalent to a Hill’s equation whose periodic coefficient involves the van der Pol limit cycle. We identify the countable set of resonances corresponding to the instability of the in-phase mode and present power series expansions for the Hill determinants which bound these resonances. An additional stability surface is associated with the transformation to Hill’s standard form and corresponds to the

Стилі APA, Harvard, Vancouver, ISO та ін.

Guofang Zhang. "From relative views see countable compactness and compactness." In 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC). IEEE, 2011. http://dx.doi.org/10.1109/aimsec.2011.6010210.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Stephens, Christopher, Dagmara Wrzecionkowska, Estefanía Espitia-Bautista, Roland Díaz-Loving, and Gabriela Contreras. "The Conductome – A New Paradigm for Understanding Human Behaviour." In International Association of Cross Cultural Psychology Congress. International Association for Cross-Cultural Psychology, 2024. http://dx.doi.org/10.4087/lgnw9526.

Повний текст джерела

Анотація:

As almost every major problem that humankind faces is a consequence of human behaviour, predicting behaviour and behaviour change is fundamental. Given the multitude of factors that affect our decision making, a transdisciplinary understanding of behaviour is impossible without the integration of data that crosses disciplinary boundaries. The concept of Conduct-“ome” is an analog of those holistic –“omic”-approaches found in the biological sciences which take a “totality of factors” approach, and provides a framework for studying human behaviour in a multifactorial, multidisciplinary context,

Стилі APA, Harvard, Vancouver, ISO та ін.

De Cristofaro, Sarah, Luca Rizzi, Dario Cardone, Lisa Berti, and Ubaldo Spina. "Smart Relax Armchair - a solution for active and safe ageing at home." In 15th International Conference on Applied Human Factors and Ergonomics (AHFE 2024). AHFE International, 2024. http://dx.doi.org/10.54941/ahfe1004896.

Повний текст джерела

Анотація:

The fact that people are living longer is a social and economic challenge for developed countries in the 21st century. An ageing society leads to an increase in the number of people living with multiple chronic conditions, facing the loss of independence and autonomy in daily activities and suffering social isolation caused by the pandemic or by the necessity of long-term care at home. The increasing incidence of sedentarism as well as prolonged immobility caused by long-stay settings (care home) is also a growing health concern. Indeed, spending too much time sitting daily could increase the

Стилі APA, Harvard, Vancouver, ISO та ін.

Chaturvedi, Nalin A., Jake F. Christensen, Reinhardt Klein, and Aleksandar Kojic. "Approximations for Partial Differential Equations Appearing in Li-Ion Battery Models." In ASME 2013 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/dscc2013-4072.

Повний текст джерела

Анотація:

Li-ion based batteries are believed to be the most promising battery system for HEV/PHEV/EV applications due to their high energy density, lack of hysteresis and low self-discharge currents. However, designing a battery, along with its Battery Management System (BMS), that can guarantee safe and reliable operation, is a challenge since aging and other mechanisms involving optimal charge and discharge of the battery are not sufficiently well understood. In a previous article [1], we presented a model that has been studied in [2]–[5] to understand the operation of a Li-ion battery. In this artic

Стилі APA, Harvard, Vancouver, ISO та ін.

Khefacha, Ahlem, and Beatrix Séllei. "Can Hypnosis Develop Emotional Intelligence and Employees’ Skills?" In 8th International Scientific Conference – EMAN 2024 – Economics and Management: How to Cope With Disrupted Times. Association of Economists and Managers of the Balkans, Belgrade, Serbia, 2024. https://doi.org/10.31410/eman.s.p.2024.179.

Повний текст джерела

Анотація:

Emotional intelligence (EI) refers to qualities and skills beyond traditional intellectual and technical competencies. EI proved to be an essential skill that goes alongside leadership skills, positively impacting organizational behaviors and business outcomes and influencing overall work performance. EI is important in organizational settings in three ways: the leader’s EI, the employee’s EI, and the emotional climate of groups and teams. Few studies showed that happier people produce more GDP, so the positive effects are countable in business. People have different levels of EI, but nowa

Стилі APA, Harvard, Vancouver, ISO та ін.

King, Carey W., Jay Zarnikau, and Phil Henshaw. "Defining a Standard Measure for Whole System EROI Combining Economic “Top-Down” and LCA “Bottom-Up” Accounting." In ASME 2010 4th International Conference on Energy Sustainability. ASMEDC, 2010. http://dx.doi.org/10.1115/es2010-90414.

Повний текст джерела

Анотація:

Business investments rely on creating a whole system of different parts, technologies, field and business operations, management, land, financing and commerce using a network of other services. Using the example of a wind farm development, a typical life cycle assessment (LCA) focuses upon the primary technology inputs and their countable embodied direct impacts. What LCA omits are the direct and indirect impacts of the rest of the business system that operates the primary technology, the labor, commerce and other technology employed. A total environmental assessment (TEA) would include the ph

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!