English
Related papers

Related papers: Concerning the Representability of Self-Reference …

200 papers

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…

Combinatorics · Mathematics 2013-03-05 Edinah K. Gnang , Patrick Devlin

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

Logic in Computer Science · Computer Science 2023-06-22 James Laird

Analysing several characteristic mathematical models: natural and real numbers, Euclidean geometry, group theory, and set theory, I argue that a mathematical model in its final form is a junction of a set of axioms and an internal partial…

History and Overview · Mathematics 2025-03-18 Boris Čulina

In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…

General Mathematics · Mathematics 2012-12-10 Garimella Rama Murthy

In this paper we introduce an enclosure of the numerical range of a class of rational operator functions. In contrast to the numerical range the presented enclosure can be computed exactly in the infinite dimensional case as well as in the…

Functional Analysis · Mathematics 2017-04-25 Christian Engström , Axel Torshage

In this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as G\"odel's G3 logic) that relies on the idea of "denotation" of a formula, that is, a function that…

Logic in Computer Science · Computer Science 2020-02-19 Felicidad Aguado , Pedro Cabalar , David Pearce , Gilberto Pérez , Concepción Vidal

Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…

Logic · Mathematics 2007-05-23 Giovanni Panti

We generalize Menon's identity by considering sums representing arithmetical functions of several variables. As an application, we give a formula for the number of cyclic subgroups of the direct product of several cyclic groups of arbitrary…

Number Theory · Mathematics 2011-09-21 László Tóth

We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…

Number Theory · Mathematics 2024-07-19 Mihai Prunescu , Lorenzo Sauras-Altuzarra

Existence results for Hilbert's problem 13th mean that any equation constructed by continue functions can be given solution represented as a superposition of continue functions of one variable or of continue functions of two variables.…

General Mathematics · Mathematics 2016-05-03 ZiQian Wu

Definite descriptions are phrases of the form 'the $x$ such that $\varphi$', used to refer to single entities in a context. They are often more meaningful to users than individual names alone, in particular when modelling or querying data…

Logic in Computer Science · Computer Science 2021-06-30 Alessandro Artale , Andrea Mazzullo , Ana Ozaki , Frank Wolter

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

Number Theory · Mathematics 2020-01-07 Sándor Z. Kiss , Csaba Sándor

Representation determines how we can reason about a specific problem. Sometimes one representation helps us find a proof more easily than others. Most current automated reasoning tools focus on reasoning within one representation. There is,…

Artificial Intelligence · Computer Science 2015-05-12 Daniel Raggi , Alan Bundy , Gudmund Grov , Alison Pease

We discuss the finiteness of (two-term) silting objects. First, we investigate new triangulated categories without silting object. Second, one studies two classes of $\tau$-tilting-finite algebras and give the numbers of their two-term…

Representation Theory · Mathematics 2023-06-22 Takuma Aihara , Takahiro Honma , Kengo Miyamoto , Qi Wang

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

Logic in Computer Science · Computer Science 2014-12-11 Fred Mesnard , Etienne Payet

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

We consider the ratio of two Gauss hypergeometric functions, in which the parameters of the numerator function differ from the respective parameters of the denominator function by integers. We derive explicit integral representations for…

Classical Analysis and ODEs · Mathematics 2021-12-30 Alexander Dyachenko , Dmitrii Karp

Let $\mathfrak g$ be a complex semisimple Lie algebra. We define what it means for a finite dimensional representation of $\mathfrak g$ to be rectangular and completely classify faithful rectangular representations. As an application, we…

Number Theory · Mathematics 2026-05-27 Chun-Yin Hui , Wonwoong Lee

Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…

Logic in Computer Science · Computer Science 2023-11-13 Dieter Spreen

An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of…

Dynamical Systems · Mathematics 2025-01-29 Valérie Berthé , Paulina Cecchi Bernales , Reem Yassawi