English
Related papers

Related papers: Axiomatization of B\"uchi arithmetic

200 papers

There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation…

Artificial Intelligence · Computer Science 2015-03-19 D. M. Gabbay , O. Rodrigues

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…

General Mathematics · Mathematics 2022-10-07 Victor Volfson

In this note we give an elementary demonstration of the fact that AB=I implies BA=I for square matrices A,B with coefficients in a field K. By elementary we mean that our proof follows from the very definitions of matrix and product of a…

Rings and Algebras · Mathematics 2016-09-01 J. M. Almira

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

Number Theory · Mathematics 2007-09-12 Alexei Panchishkin

In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalises strong $q$-additivity and -multiplicativity, respectively. We show that…

Combinatorics · Mathematics 2016-05-13 Sara Kropf , Stephan Wagner

Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion. They have been comprehensively studied by Lynch and Vaandrager for nondeterministic…

Logic in Computer Science · Computer Science 2023-06-22 Natsuki Urabe , Ichiro Hasuo

In this work we present a natural generalization of strong pseudoprime to base $b$, which we have called $q$-pseudoprime to base $b$. It allows us to present another way to define a Midy's number to base $b$ (overpseudoprime to base $b$).…

Number Theory · Mathematics 2014-12-18 John H. Castillo , Gilberto García-Pulgarín , Juan Miguel Velásquez-Soto

Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an…

Logic in Computer Science · Computer Science 2019-03-14 Giorgi Japaridze

We introduce the notion of p*-values (p*-variables), which generalizes p-values (p-variables) in several senses. The new notion has four natural interpretations: operational, probabilistic, Bayesian, and frequentist. A main example of a…

Statistics Theory · Mathematics 2022-02-24 Ruodu Wang

Additive composition (Foltz et al, 1998; Landauer and Dumais, 1997; Mitchell and Lapata, 2010) is a widely used method for computing meanings of phrases, which takes the average of vector representations of the constituent words. In this…

Computation and Language · Computer Science 2017-04-05 Ran Tian , Naoaki Okazaki , Kentaro Inui

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

General Mathematics · Mathematics 2026-04-21 Theophilus Agama , Berndt Gensel

We propose a new axiomatisation of the alpha-equivalence relation for nominal terms, based on a primitive notion of fixed-point constraint. We show that the standard freshness relation between atoms and terms can be derived from the more…

Logic in Computer Science · Computer Science 2023-06-22 Mauricio Ayala-Rincón , Maribel Fernández , Daniele Nantes-Sobrinho

We develop a new type and effect system based on B\"uchi automata to capture finite and infinite traces produced by programs in a small language which allows non-deterministic choices and infinite recursions. There are two key technical…

Logic in Computer Science · Computer Science 2014-01-22 Martin Hofmann , Wei Chen

The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…

Combinatorics · Mathematics 2019-10-03 Matthias Lenz

We give a shorter simpler proof of a result of Szalay on the equation $2^a + 2^b + 1 = z^2$. We give an elementary proof of a result of Luca on the equation of the title for prime $p > 2$. The elementary treatment is made possible by a…

Number Theory · Mathematics 2023-05-23 Reese Scott

Archetypal analysis is a matrix factorization method with convexity constraints. Due to local minima, a good initialization is essential, but frequently used initialization methods yield either sub-optimal starting points or are prone to…

Machine Learning · Computer Science 2025-04-09 Sebastian Mair , Jens Sjölund

We review principal results on axiomatizability of classes of lattices of equivalences

Logic · Mathematics 2025-07-29 Christian Herrmann

We claim to resolve the P=?NP problem via a formal argument for P=NP.

Computational Complexity · Computer Science 2007-05-23 Selmer Bringsjord , Joshua Taylor

The Operator axioms have produced new real numbers with new operators. New operators naturally produce new equations and thus extend the traditional mathematical models which are selected to describe various scientific rules. So new…

Numerical Analysis · Computer Science 2021-02-08 Pith Peishu Xie

This is a short survey on the development of the formal specification and verification language H with emphasis on the scientific part. H is a modern highly expressive language solidly based upon advanced mathematical theories such as the…

Logic · Mathematics 2019-08-28 Răzvan Diaconescu
‹ Prev 1 8 9 10 Next ›