English
Related papers

Related papers: Monotone subsequence via ultrapower

200 papers

Ultraproducts are a well-known tool in the classical model theory of first-order logic. We explore their uses in the context of finite model theory.

Logic · Mathematics 2013-10-14 Philip Dittmann

We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…

Logic · Mathematics 2025-01-24 Joni Puljujärvi , Davide Emilio Quadrellaro

A central problem in the study of resource theories is to find functions that are nonincreasing under resource conversions - termed monotones - in order to quantify resourcefulness. Various constructions of monotones appear in many…

Quantum Physics · Physics 2024-08-07 Tomáš Gonda , Robert W. Spekkens

We revisit the classical monotone-follower problem and consider it in a generalized formulation. Our approach is based on a compactness substitute for nondecreasing processes, the Meyer-Zheng weak convergence, and the maximum principle of…

Optimization and Control · Mathematics 2016-10-14 Jiexian Li , Gordan Zitkovic

The article motivates recent work on saturation of ultrapowers from a general mathematical point of view.

Logic · Mathematics 2018-03-21 M. Malliaris

Pareto optimization via evolutionary multi-objective algorithms has been shown to efficiently solve constrained monotone submodular functions. Traditionally when solving multiple problems, the algorithm is run for each problem separately.…

Neural and Evolutionary Computing · Computer Science 2026-04-17 Liam Wigney , Frank Neumann

Motivated by the model theory of higher order logics, a certain kind of topological spaces had been introduced on ultraproducts. These spaces are called ultratopologies. Ultratopologies provide a natural extra topological structure for…

Logic · Mathematics 2007-05-23 Gabor Sagi , Saharon Shelah

We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.

Logic · Mathematics 2008-03-26 Paolo Lipparini

We combine continuous and integral logics and found a logical framework for metric measure spaces equipped with a family of continuous relations and operations. We prove the ultraproduct theorem and deduce compactness and other usual…

Logic · Mathematics 2019-10-02 Seyed-Mohammad Bagheri , Massoud Pourmahdian

Given a convergence theorem in analysis, under very general conditions a model-theoretic compactness argument implies that there is a uniform bound on the rate of metastability. We illustrate with three examples from ergodic theory.

Functional Analysis · Mathematics 2013-10-17 Jeremy Avigad , José Iovino

Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…

Logic · Mathematics 2018-01-30 Gabriel Goldberg

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

Combinatorics · Mathematics 2024-11-05 Kui-Yo Chen , Zhong-Tang Wu

A common problem in the optimization of structures is the handling of uncertainties in the parameters. If the parameters appear in the constraints, the uncertainties can lead to an infinite number of constraints. Usually the constraints…

Optimization and Control · Mathematics 2012-05-01 Daniel P. Mohr , Ina Stein , Thomas Matzies , Christina A. Knapek

In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…

Logic in Computer Science · Computer Science 2024-07-08 Marc Aiguier , Isabelle Bloch , Romain Pascual

Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…

Computational Complexity · Computer Science 2017-10-25 Nadia Creignou , Markus Kröll , Reinhard Pichler , Sebastian Skritek , Heribert Vollmer

One of the challenges of modern engineering, and robotics in particular, is designing complex systems, composed of many subsystems, rigorously and with optimality guarantees. This paper introduces a theory of co-design that describes…

Logic in Computer Science · Computer Science 2016-10-13 Andrea Censi

Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…

Logic in Computer Science · Computer Science 2014-05-01 Amir M. Ben-Amram , Michael Vainer

This text provides very easy and short proofs of some basic properties of complex power series (addition, subtraction, multiplication, division, rearrangement, composition, differentiation, uniqueness, Taylor's series, Principle of…

Complex Variables · Mathematics 2012-07-31 Oswaldo Rio Branco de Oliveira

In a series of experiments Tao and coworkers\cite{tao1,tao2,tao3} found that superconducting microparticles in the presence of a strong electrostatic field aggregate into balls of macroscopic dimensions. No explanation of this phenomenon…

Superconductivity · Physics 2009-11-11 J. E. Hirsch

We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…

Logic · Mathematics 2018-10-11 Gabriel Goldberg
‹ Prev 1 2 3 10 Next ›