output
20142025
most citedCompleteness and absolute -closedness of topological semilattices

12 citations

11 papers

cs.LO2025

Towards an Analysis of Proofs in Arithmetic

Alexander Leitsch, Anela Lolić, Stella Mahler

Inductive proofs can be represented as proof schemata, i.e. as parameterized sequences of proofs defined in a primitive recursive way. Applications of proof schemata can be found i…

math.LO2024

The breadth of constructibility degrees and definable Sierpiński's coverings

Alessandro Andretta, Lorenzo Notaro

Generalizing a result of Törnquist and Weiss, we study the connection between the existence of Sierpiński's coverings of , and a cardinal invariant of…

math.GN2024

The homeomorphisms of the Sierpiński carpet are not classifiable by countable structures

Dhruv Kulshreshtha, Aristotelis Panagiotopoulos

We show that the homeomorphisms of the Sierpiński carpet are not classifiable, up to conjugacy, using isomorphism types of countable structures as invariants.

math.GN2018★ 10 cited

The closedness of complete subsemilattices in functionally Hausdorff semitopological semilattices

Taras Banakh, Serhii Bardyla, Alex Ravsky

A topologized semilattice is complete if each non-empty chain has and . It is proved that for any complete subsemilattice of…

math.GN2018★ 6 cited

On images of complete topologized subsemilattices in sequential semitopological semilattices

Taras Banakh, Serhii Bardyla

A topologized semilattice is called complete if each non-empty chain has and . We prove that for any continuous homomorphism $h:…

math.GN2017★ 12 cited

Completeness and absolute -closedness of topological semilattices

Taras Banakh, Serhii Bardyla

We find (completeness type) conditions on topological semilattices guaranteeing that each continuous homomorphism has closed image in .

math.LO2017★ 3 cited

Linear orders: when embeddability and epimorphism agree

Riccardo Camerlo, Raphaël Carroy, Alberto Marcone

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 line…

cs.CC2016

The parameterized space complexity of embedding along a path

Hubie Chen, Moritz Müller

The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this pro…

math.LO2015

Cardinal characteristics at κ in a small u(κ) model

A. D. Brooke-Taylor, V. Fischer, S. D. Friedman +1

We provide a model where u(κ) < 2^κ for a supercompact cardinal κ. Garti and Shelah have provided a sketch of how to obtain such a model by modifying the construction in a paper of…

math.LO2015

Killing the GCH everywhere with a single real

Sy David Friedman, Mohammad Golshani

Shelah-Woodin investigate the possibility of violating instances of through the addition of a single real. In particular they show that it is possible to obtain a failure of…

math.LO2014

Representations of ideals in Polish groups and in Banach spaces

Piotr Borodulin-Nadzieja, Barnabas Farkas, Grzegorz Plebanek

We investigate ideals of the form is unconditionally convergent , where is a sequence in a Polish group or in a Banach…