10 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
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
Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)
International audienceOriginating in arithmetics and logic, the theory of ordered sets is now a field of combinatorics that is intimately linked to graph theory, universal algebra and multiple-valued logic, and that has a wide range of classical applications such as formal calculus, classification, decision aid and social choice.This international conference “Algebras, graphs and ordered set” (ALGOS) brings together specialists in the theory of graphs, relational structures and ordered sets, topics that are omnipresent in artificial intelligence and in knowledge discovery, and with concrete applications in biomedical sciences, security, social networks and e-learning systems. One of the goals of this event is to provide a common ground for mathematicians and computer scientists to meet, to present their latest results, and to discuss original applications in related scientific fields. On this basis, we hope for fruitful exchanges that can motivate multidisciplinary projects.The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) has a particular motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this reason, we have particularly welcomed submissions in areas related to Maurice’s many scientific interests:• Lattices and ordered sets• Combinatorics and graph theory• Set theory and theory of relations• Universal algebra and multiple valued logic• Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid and social choice, security, social networks, web semantics..
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Computation and Logic in the Real World
The proceedings contain 78 papers. The topics discussed include: shifting and lifting of cellular automata; learning as data compression; a classification of viruses through recursion theorems; characterizing programming systems allowing program self-reference; thin maximal antichains in the turing degrees; effective computation for nonlinear systems; time-complexity semantics for feasible affine recursions; feasible depth; a continuous derivative for real-valued functions; refocusing generalised normalisation; parameterized complexity and logic; index sets of computable structures with decidable theories; operational semantics for positive relevant logics without distribution; unique existence and computability in constructive reverse mathematics; circuit complexity of regular language; definability in the homomorphic quasiorder of finite labeled forests; and membrane systems and their application to systems biology