English
Related papers

Related papers: Iterated Ultrapowers for the Masses

200 papers

In this paper we investigate cumulative hierarchies of functions on structures, or cumulative powers, and study their properties. Particularly, we show how they extend the preservation phenomena of reduced powers, direct powers and…

Logic · Mathematics 2026-05-14 Pedro Teixeira Yago

Power law or generalized polynomial regressions with unknown real-valued exponents and coefficients, and weakly dependent errors, are considered for observations over time, space or space--time. Consistency and asymptotic normality of…

Statistics Theory · Mathematics 2012-05-14 Peter M. Robinson

This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…

Logic · Mathematics 2011-04-25 Victoria Gitman , Philip Welch

Explainable information retrieval is an emerging research area aiming to make transparent and trustworthy information retrieval systems. Given the increasing use of complex machine learning models in search systems, explainability is…

Information Retrieval · Computer Science 2022-11-07 Avishek Anand , Lijun Lyu , Maximilian Idahl , Yumeng Wang , Jonas Wallat , Zijian Zhang

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

Logic · Mathematics 2024-10-24 Miguel A. Cardona , Diego A. Mejía , Andrés F. Uribe-Zapata

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

The question of how irreversibility can emerge as a generic phenomena when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the…

Quantum Physics · Physics 2013-09-20 Cozmin Ududec , Nathan Wiebe , Joseph Emerson

We consider here Easton support iterations of Prikry type forcing notions. New ways of constructing normal ultrafilters in extensions are presented. It turns out that, in contrast with other supports, seemingly unrelated measures or…

Logic · Mathematics 2023-01-31 Moti Gitik , Eyal Kaplan

A procedure to extend a superintegrable system into a new superintegrable one is systematically tested for the known systems on $\mathbb E^2$ and $\mathbb S^2$ and for a family of systems defined on constant curvature manifolds. The…

Mathematical Physics · Physics 2012-10-12 Claudia M. Chanu , Luca Degiovanni , Giovanni Rastelli

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

Logic · Mathematics 2015-06-23 Diego Alejandro Mejía

Exploring the expansion history of the universe, understanding its evolutionary stages, and predicting its future evolution are important goals in astrophysics. Today, machine learning tools are used to help achieving these goals by…

Machine Learning · Computer Science 2026-03-10 Michael Franklin Mbouopda , Emille E. O. Ishida , Engelbert Mephu Nguifo , Emmanuel Gangler

This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…

Numerical Analysis · Mathematics 2018-06-12 Stefan Hothazie , Munteanu Camelia Elena , Mihaela Nastase

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…

Logic · Mathematics 2024-08-13 Nadav Meir , Aris Papadopoulos , Pierre Touchard

The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.

Logic · Mathematics 2007-12-13 Peter M. Johnson

As the discipline has evolved, research in machine learning has been focused more and more on creating more powerful neural networks, without regard for the interpretability of these networks. Such "black-box models" yield state-of-the-art…

Machine Learning · Computer Science 2021-09-02 Lachlan O'Neill , Simon Angus , Satya Borgohain , Nader Chmait , David L. Dowe

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

Logic · Mathematics 2011-10-18 Jakob Kellner , Saharon Shelah

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

Recent advancements in machine learning have emphasized the need for transparency in model predictions, particularly as interpretability diminishes when using increasingly complex architectures. In this paper, we propose leveraging…

Machine Learning · Computer Science 2025-07-18 Chenrui Zhu , Louenas Bounia , Vu Linh Nguyen , Sébastien Destercke , Arthur Hoarau

We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be…

Combinatorics · Mathematics 2026-05-07 Alexey Gordeev , Lars-Daniel Öhman
‹ Prev 1 3 4 5 6 7 10 Next ›