English
Related papers

Related papers: The strength of compactness for countable complete…

200 papers

This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…

Logic · Mathematics 2025-03-04 Sho Shimomichi , Yuto Takeda , Keita Yokoyama

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

We study the reverse mathematics of the theory of countable second-countable topological spaces, with a focus on compactness. We show that the general theory of such spaces works as expected in the subsystem $\mathsf{ACA}_0$ of second-order…

Logic · Mathematics 2011-11-01 François G. Dorais

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

The countable uniform power (or uniform box product) of a uniform space $X$ is a special topology on ${}^{\omega}X$ that lies between the Tychonoff topology and the box topology. We solve an open problem posed by P. Nyikos showing that if…

General Topology · Mathematics 2018-09-20 Rodrigo Hernández-Gutiérrez , Paul J. Szeptycki

One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…

Logic · Mathematics 2022-06-02 Seyed Mohammad Amin Khatami

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

We characterize exactly the compactness properties of the product of \kappa\ copies of the space \omega\ with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…

General Topology · Mathematics 2024-03-11 Abhijit Dasgupta

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust…

Logic in Computer Science · Computer Science 2022-08-29 Amin Farjudian , Eugenio Moggi

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Logic · Mathematics 2019-12-20 Chi Tat Chong , Wei Li , Lu Liu , Yue Yang

A space is od-compact (resp. od-Lindel\"of) provided any cover by open dense sets has a finite (resp. countable) subcover. We first show with simple examples that these properties behave quite poorly under finite or countable unions. We…

General Topology · Mathematics 2015-03-24 Mathieu Baillif

In this paper we investigate more characterizations and applications of $\delta$-strongly compact cardinals. We show that, for a cardinal $\kappa$ the following are equivalent: (1) $\kappa$ is $\delta$-strongly compact, (2) For every…

Logic · Mathematics 2020-09-25 Toshimichi Usuba

Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…

Logic · Mathematics 2019-05-28 Dag Normann , Sam Sanders

In this note, we present a simpler way to prove the compactness of the closed intervals in simply ordered set with order topology.

General Topology · Mathematics 2019-04-01 Sachin B Bhalekar

We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…

Functional Analysis · Mathematics 2008-12-18 Marianne Morillon

We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

We give an exposition of the compactness of $L(Q^\mathrm{cf})$, for any set $C$ of regular cardinals.

Logic · Mathematics 2020-09-11 Enrique Casanovas , Martin Ziegler
‹ Prev 1 2 3 10 Next ›