Related papers: When is .999... less than 1?
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9…
The notions of null-sets and nullity are present in all discourses of mathematics. They are based on the dual-pair of notions of "almost-every" and "almost none". A notion of nullity corresponds to a choice of subsets that one interprets as…
The difference between the terms additivity and extensivity, as well as their respective negations, is critically analyzed and illustrated with a few examples. The concepts of subadditivity, pseudo-additivity, and pseudo-extensivity are…
This paper is concerned with learners who aim to learn patterns in infinite binary sequences: shown longer and longer initial segments of a binary sequence, they either attempt to predict whether the next bit will be a 0 or will be a 1 or…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
Significance tests are probably the most extended form of inference in empirical research, and significance is often interpreted as providing greater informational content than non-significance. In this article we show, however, that…
We consider the problem of deriving the no-signaling condition from the assumption that, as seen from a complexity theoretic perspective, the universe is not an exponential place. A fact that disallows such a derivation is the existence of…
This note has two principal aims: to portray an essence of Non-Standard Analysis as a particular structure (which we call lim-rim), noting its interplay with the notion of ultrapower, and to present a construction of Non-Standard Analysis,…
This paper investigates the concept of Nothing from both philosophical and mathematical perspectives, distinguishing between absolute non-being (nihil) and relational negation as a principle of difference. It explores how mathematics…
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…
We present a novel, type-logical analysis of_polarity sensitivity_: how negative polarity items (like "any" and "ever") or positive ones (like "some") are licensed or prohibited. It takes not just scopal relations but also linear order into…
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit…
In this paper I study a variant of the general vertex coloring problem called precoloring. Specifically, I study graph precolorings, by developing new theory, for characterizing the minimal non-extensible precolorings. It is interesting per…
Symbolic equations are one of the many representations used in physics. Understanding these representations is important for students because they are how students access knowledge in physics. In this paper I build off of the work by Redish…
Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for a plethora of applications such as the verification of probabilistic systems, model checking, computational biology, and economics. Positivity (are all terms of…
Diagonal lines in symbolic recurrence plots are closely related to the identification and characterization of specific biprolongable words within a sequence. In this paper we focus on the recurrence plot of a fixed point of a uniform binary…
We study the language universality problem for One-Counter Nets, also known as 1-dimensional Vector Addition Systems with States (1-VASS), parameterized either with an initial counter value, or with an upper bound on the allowed counter…
The paper "Physics without determinism: Alternative interpretations of classical physics" [Phys. Rev. A, 100:062107, Dec 2019] defines finite information quantities (FIQ). A FIQ expresses the available information about the value of a…