13 research outputs found
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
Modulo-Counting First-Order Logic on Bounded Expansion Classes
We prove that, on bounded expansion classes, every first-order formula with
modulo counting is equivalent, in a linear-time computable monadic lift, to an
existential first-order formula. As a consequence, we derive, on bounded
expansion classes, that first-order transductions with modulo counting have the
same encoding power as existential first-order transductions. Also,
modulo-counting first-order model checking and computation of the size of sets
definable in modulo-counting first-order logic can be achieved in linear time
on bounded expansion classes. As an application, we prove that a class has
structurally bounded expansion if and only if is a class of bounded depth
vertex-minors of graphs in a bounded expansion class. We also show how our
results can be used to implement fast matrix calculus on bounded expansion
matrices over a finite field.Comment: submitted to CSGT2022 special issu
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