English
Related papers

Related papers: Shift spaces, Languages and Transfinite Induction

200 papers

Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix,…

Formal Languages and Automata Theory · Computer Science 2019-03-11 Joey Eremondi , Oscar H. Ibarra , Ian McQuillan

The aim of the paper is to characterize (pre)compactness in the spaces of Lipschitz/H\"older continuous mappings acting from a compact metric space to a normed space. To this end some extensions and generalizations of already existing…

Functional Analysis · Mathematics 2023-06-21 Jacek Gulgowski , Piotr Kasprzak , Piotr Maćkowiak

Cross-lingual transfer of word embeddings aims to establish the semantic mappings among words in different languages by learning the transformation functions over the corresponding word embedding spaces. Successfully solving this problem…

Computation and Language · Computer Science 2018-09-12 Ruochen Xu , Yiming Yang , Naoki Otani , Yuexin Wu

We introduce a new family of shift spaces --- the subordinate shifts. Using subordinate shifts we prove in an elementary way that for every nonnegative real number $t$ there is a shift space with entropy $t$.

Dynamical Systems · Mathematics 2018-02-01 Marcin Kulczycki , Dominik Kwietniak , Jian Li

The translation operator $T^A$ associated with the special affine Fourier transform (SAFT) $\mathscr{F}_A$ is introduced from harmonic analysis point of view. The analogues of Wendel's theorem, Wiener theorem, Weiner-Tauberian theorem and…

Functional Analysis · Mathematics 2024-07-23 Md Hasan Ali Biswas , Frank Filbir , Radha Ramakrishnan

We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…

Logic in Computer Science · Computer Science 2014-02-13 Carlos Lombardi , Alejandro Ríos , Roel de Vrijer

We study subsystems of open induction which are strongly connected to methods of automated inductive theorem proving. Specifically, we consider systems obtained from restricting induction to atoms, literals, clauses, and dual clauses. We…

Logic · Mathematics 2025-09-09 Stefan Hetzl , Johannes Weiser

Definition. Let $\kappa$ be an infinite cardinal, let {X(i)} be a (not necessarily faithfully indexed) set of topological spaces, and let X be the product of the spaces X(i). The $\kappa$-box product topology on X is the topology generated…

General Topology · Mathematics 2013-11-12 W. W. Comfort , Ivan S. Gotchev

Concept discovery is one of the open problems in the interpretability literature that is important for bridging the gap between non-deep learning experts and model end-users. Among current formulations, concepts defines them by as a…

Machine Learning · Computer Science 2022-02-11 Adrianna Janik , Kris Sankaran

The purpose of these lectures is to introduce the notion of a Stokes-perverse sheaf as a receptacle for the Riemann-Hilbert correspondence for holonomic D-modules. They develop the original idea of P. Deligne in dimension one, and make it…

Algebraic Geometry · Mathematics 2012-11-02 Claude Sabbah

We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Dagnino

Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…

Dynamical Systems · Mathematics 2015-09-10 Jung-Chao Ban , Chih-Hung Chang

The shift graph is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of…

Logic · Mathematics 2024-10-18 Yann Pequignot

Inferential relations govern our concept use. In order to understand a concept it has to be located in a space of implications. There are different kinds of conditions for statements, i.e. that the conditions represent different kinds of…

Artificial Intelligence · Computer Science 2020-07-07 Florian Richter

Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…

Logic in Computer Science · Computer Science 2018-02-12 Daniel Leivant , Jean-Yves Marion

Language models based on the Transformer architecture achieve excellent results in many language-related tasks, such as text classification or sentiment analysis. However, despite the architecture of these models being well-defined, little…

Computation and Language · Computer Science 2025-04-14 Miguel López-Otal , Jorge Gracia , Jordi Bernad , Carlos Bobed , Lucía Pitarch-Ballesteros , Emma Anglés-Herrero

We propose a generalization of continuous lattices and domains through the concept of enriched closure space, defined as a closure space equipped with a preclosure operator satisfying some compatibility conditions. In this framework we are…

Logic in Computer Science · Computer Science 2017-05-16 Paul Poncet

This paper provides an introduction to Kundt spaces, clarifying several important properties, many of which are typically scattered across the mathematical literature or presented without explicit reference to Kundt terminology. While not…

Differential Geometry · Mathematics 2025-02-11 Lilia Mehidi , Abdelghani Zeghib

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

A nilspace system is a generalization of a nilsystem, consisting of a compact nilspace X equipped with a group of nilspace translations acting on X. Nilspace systems appear in different guises in several recent works, and this motivates the…

Dynamical Systems · Mathematics 2020-10-07 Pablo Candela , Diego González-Sánchez , Balázs Szegedy