8 research outputs found
On the homomorphism order of labeled posets
Partially ordered sets labeled with k labels (k-posets) and their
homomorphisms are examined. We give a representation of directed graphs by
k-posets; this provides a new proof of the universality of the homomorphism
order of k-posets. This universal order is a distributive lattice. We
investigate some other properties, namely the infinite distributivity, the
computation of infinite suprema and infima, and the complexity of certain
decision problems involving the homomorphism order of k-posets. Sublattices are
also examined.Comment: 14 page
Total Representations
Almost all representations considered in computable analysis are partial. We
provide arguments in favor of total representations (by elements of the Baire
space). Total representations make the well known analogy between numberings
and representations closer, unify some terminology, simplify some technical
details, suggest interesting open questions and new invariants of topological
spaces relevant to computable analysis.Comment: 30 page
Languages ordered by the subword order
We consider a language together with the subword relation, the cover
relation, and regular predicates. For such structures, we consider the
extension of first-order logic by threshold- and modulo-counting quantifiers.
Depending on the language, the used predicates, and the fragment of the logic,
we determine four new combinations that yield decidable theories. These results
extend earlier ones where only the language of all words without the cover
relation and fragments of first-order logic were considered
Wadge-like reducibilities on arbitrary quasi-Polish spaces
The structure of the Wadge degrees on zero-dimensional spaces is very simple
(almost well-ordered), but for many other natural non-zero-dimensional spaces
(including the space of reals) this structure is much more complicated. We
consider weaker notions of reducibility, including the so-called
\Delta^0_\alpha-reductions, and try to find for various natural topological
spaces X the least ordinal \alpha_X such that for every \alpha_X \leq \beta <
\omega_1 the degree-structure induced on X by the \Delta^0_\beta-reductions is
simple (i.e. similar to the Wadge hierarchy on the Baire space). We show that
\alpha_X \leq {\omega} for every quasi-Polish space X, that \alpha_X \leq 3 for
quasi-Polish spaces of dimension different from \infty, and that this last
bound is in fact optimal for many (quasi-)Polish spaces, including the real
line and its powers.Comment: 50 pages, revised version, accepted for publication on Mathematical
Structures in Computer Scienc
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2019. The 29 papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with foundational research with a clear significance for software science
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum